./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-node-trans.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-node-trans.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 c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:13:01,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:13:01,147 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:01,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:13:01,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:13:01,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:13:01,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:13:01,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:13:01,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:13:01,178 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:13:01,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:13:01,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:13:01,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:13:01,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:13:01,179 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:13:01,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:13:01,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:13:01,183 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:13:01,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:13:01,183 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:13:01,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:13:01,183 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:13:01,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:13:01,183 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:13:01,183 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:13:01,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:13:01,183 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:13:01,183 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:13:01,183 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:13:01,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:13:01,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:13:01,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:13:01,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:13:01,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:13:01,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:13:01,184 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:13:01,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:13:01,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:13:01,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:13:01,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:13:01,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:13:01,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:13:01,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:13:01,184 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 -> c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf [2025-02-08 01:13:01,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:13:01,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:13:01,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:13:01,412 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:13:01,412 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:13:01,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-02-08 01:13:02,644 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e736f7b6/34b6288657a2429287b25c808bba0948/FLAGf102aa26d [2025-02-08 01:13:02,940 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:13:02,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-02-08 01:13:02,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e736f7b6/34b6288657a2429287b25c808bba0948/FLAGf102aa26d [2025-02-08 01:13:03,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e736f7b6/34b6288657a2429287b25c808bba0948 [2025-02-08 01:13:03,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:13:03,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:13:03,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:13:03,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:13:03,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:13:03,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474ef4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03, skipping insertion in model container [2025-02-08 01:13:03,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:13:03,169 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-node-trans.wvr.c[3984,3997] [2025-02-08 01:13:03,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:13:03,195 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:13:03,217 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-node-trans.wvr.c[3984,3997] [2025-02-08 01:13:03,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:13:03,232 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:13:03,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03 WrapperNode [2025-02-08 01:13:03,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:13:03,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:13:03,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:13:03,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:13:03,238 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:03" (1/1) ... [2025-02-08 01:13:03,246 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:03" (1/1) ... [2025-02-08 01:13:03,275 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 406 [2025-02-08 01:13:03,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:13:03,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:13:03,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:13:03,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:13:03,288 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:03" (1/1) ... [2025-02-08 01:13:03,288 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:03" (1/1) ... [2025-02-08 01:13:03,291 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:03" (1/1) ... [2025-02-08 01:13:03,311 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 9, 15]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-02-08 01:13:03,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:03" (1/1) ... [2025-02-08 01:13:03,315 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:03" (1/1) ... [2025-02-08 01:13:03,323 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:03" (1/1) ... [2025-02-08 01:13:03,324 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:03" (1/1) ... [2025-02-08 01:13:03,328 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:03" (1/1) ... [2025-02-08 01:13:03,333 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:03" (1/1) ... [2025-02-08 01:13:03,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:13:03,336 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:13:03,337 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:13:03,337 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:13:03,338 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03" (1/1) ... [2025-02-08 01:13:03,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:13:03,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:03,368 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:03,372 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:03,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:13:03,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:13:03,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:13:03,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 01:13:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:13:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:13:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 01:13:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 01:13:03,390 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 01:13:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 01:13:03,390 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 01:13:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 01:13:03,390 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 01:13:03,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:13:03,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:13:03,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:13:03,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:13:03,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:13:03,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:13:03,392 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:03,506 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:13:03,507 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:13:03,600 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-8: #t~ite9#1 := #t~ret8#1; [2025-02-08 01:13:03,600 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-9: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 01:13:03,600 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-10: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:03,600 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-11: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:03,600 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-12: #t~ret8#1 := minus_#res#1; [2025-02-08 01:13:03,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-8: #t~ite18#1 := #t~ret17#1; [2025-02-08 01:13:03,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-9: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret17#1 && #t~ret17#1 <= 2147483647; [2025-02-08 01:13:03,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-10: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:03,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-11: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:03,638 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-12: #t~ret17#1 := minus_#res#1; [2025-02-08 01:13:03,675 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-8: #t~ite27#1 := #t~ret26#1; [2025-02-08 01:13:03,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-9: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647; [2025-02-08 01:13:03,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-10: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 01:13:03,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-11: havoc minus_~a#1, minus_~b#1; [2025-02-08 01:13:03,676 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-12: #t~ret26#1 := minus_#res#1; [2025-02-08 01:13:03,896 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:13:03,896 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:13:04,178 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:13:04,178 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:13:04,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:13:04 BoogieIcfgContainer [2025-02-08 01:13:04,178 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:13:04,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:13:04,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:13:04,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:13:04,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:13:03" (1/3) ... [2025-02-08 01:13:04,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32cb04df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:13:04, skipping insertion in model container [2025-02-08 01:13:04,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:13:03" (2/3) ... [2025-02-08 01:13:04,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32cb04df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:13:04, skipping insertion in model container [2025-02-08 01:13:04,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:13:04" (3/3) ... [2025-02-08 01:13:04,184 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2025-02-08 01:13:04,222 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:13:04,223 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-trans.wvr.c that has 4 procedures, 32 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-08 01:13:04,223 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:13:04,274 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 01:13:04,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 37 transitions, 95 flow [2025-02-08 01:13:04,339 INFO L124 PetriNetUnfolderBase]: 6/34 cut-off events. [2025-02-08 01:13:04,344 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:13:04,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 6/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-02-08 01:13:04,346 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 37 transitions, 95 flow [2025-02-08 01:13:04,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 30 transitions, 78 flow [2025-02-08 01:13:04,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:13:04,376 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;@2bdd06e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:13:04,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 01:13:04,396 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:13:04,397 INFO L124 PetriNetUnfolderBase]: 6/29 cut-off events. [2025-02-08 01:13:04,397 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:13:04,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:04,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:04,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:04,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:04,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1946785053, now seen corresponding path program 1 times [2025-02-08 01:13:04,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:04,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761418105] [2025-02-08 01:13:04,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:04,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:04,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:13:04,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:13:04,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:04,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:04,974 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:04,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:04,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761418105] [2025-02-08 01:13:04,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761418105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:04,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:04,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:13:04,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200982389] [2025-02-08 01:13:04,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:04,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:13:04,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:05,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:13:05,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:13:05,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:05,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:05,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:05,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:05,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:05,124 INFO L124 PetriNetUnfolderBase]: 130/231 cut-off events. [2025-02-08 01:13:05,125 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-08 01:13:05,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 231 events. 130/231 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 627 event pairs, 124 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 398. Up to 230 conditions per place. [2025-02-08 01:13:05,131 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 28 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-02-08 01:13:05,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 140 flow [2025-02-08 01:13:05,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:13:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:13:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-02-08 01:13:05,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38738738738738737 [2025-02-08 01:13:05,144 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 78 flow. Second operand 3 states and 43 transitions. [2025-02-08 01:13:05,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 140 flow [2025-02-08 01:13:05,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 31 transitions, 128 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 01:13:05,152 INFO L231 Difference]: Finished difference. Result has 31 places, 31 transitions, 78 flow [2025-02-08 01:13:05,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=31, PETRI_TRANSITIONS=31} [2025-02-08 01:13:05,156 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2025-02-08 01:13:05,158 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 31 transitions, 78 flow [2025-02-08 01:13:05,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:05,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:05,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:05,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:13:05,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:05,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:05,159 INFO L85 PathProgramCache]: Analyzing trace with hash -115586471, now seen corresponding path program 1 times [2025-02-08 01:13:05,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:05,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142428784] [2025-02-08 01:13:05,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:05,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:05,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 01:13:05,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 01:13:05,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:05,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:13:05,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:05,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142428784] [2025-02-08 01:13:05,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142428784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:05,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:05,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:05,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865387859] [2025-02-08 01:13:05,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:05,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:13:05,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:05,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:13:05,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:13:05,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:05,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 31 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:05,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:05,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:05,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:05,514 INFO L124 PetriNetUnfolderBase]: 130/232 cut-off events. [2025-02-08 01:13:05,517 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:13:05,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 232 events. 130/232 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 625 event pairs, 124 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 474. Up to 229 conditions per place. [2025-02-08 01:13:05,519 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 27 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-02-08 01:13:05,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 142 flow [2025-02-08 01:13:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:13:05,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:13:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2025-02-08 01:13:05,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32432432432432434 [2025-02-08 01:13:05,520 INFO L175 Difference]: Start difference. First operand has 31 places, 31 transitions, 78 flow. Second operand 4 states and 48 transitions. [2025-02-08 01:13:05,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 142 flow [2025-02-08 01:13:05,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 138 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 01:13:05,521 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 92 flow [2025-02-08 01:13:05,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2025-02-08 01:13:05,523 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2025-02-08 01:13:05,523 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 92 flow [2025-02-08 01:13:05,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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:05,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:05,524 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:05,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:13:05,524 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:05,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:05,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1706512525, now seen corresponding path program 1 times [2025-02-08 01:13:05,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:05,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445968057] [2025-02-08 01:13:05,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:05,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:05,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:13:05,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:13:05,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:05,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:13:05,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:05,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445968057] [2025-02-08 01:13:05,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445968057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:05,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:05,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:05,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851627377] [2025-02-08 01:13:05,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:05,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:13:05,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:05,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:13:05,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:13:05,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:05,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:05,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:05,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:05,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:05,873 INFO L124 PetriNetUnfolderBase]: 130/233 cut-off events. [2025-02-08 01:13:05,873 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:13:05,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 233 events. 130/233 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 625 event pairs, 124 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 474. Up to 231 conditions per place. [2025-02-08 01:13:05,876 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 29 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-02-08 01:13:05,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 158 flow [2025-02-08 01:13:05,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:13:05,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:13:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-02-08 01:13:05,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31756756756756754 [2025-02-08 01:13:05,879 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 92 flow. Second operand 4 states and 47 transitions. [2025-02-08 01:13:05,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 158 flow [2025-02-08 01:13:05,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:13:05,880 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 105 flow [2025-02-08 01:13:05,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2025-02-08 01:13:05,881 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2025-02-08 01:13:05,881 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 105 flow [2025-02-08 01:13:05,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:05,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:05,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:05,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:13:05,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:05,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:05,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1909642725, now seen corresponding path program 1 times [2025-02-08 01:13:05,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:05,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663057042] [2025-02-08 01:13:05,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:05,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:05,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:13:05,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:13:05,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:05,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:06,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 01:13:06,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:06,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663057042] [2025-02-08 01:13:06,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663057042] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:13:06,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348110543] [2025-02-08 01:13:06,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:06,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:06,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:06,125 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:13:06,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:13:06,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:13:06,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:13:06,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:06,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:06,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 01:13:06,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:13:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:13:06,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:13:06,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348110543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:06,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:13:06,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-08 01:13:06,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501858025] [2025-02-08 01:13:06,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:06,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:13:06,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:06,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:13:06,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:13:06,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:06,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:06,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:06,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:06,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:06,407 INFO L124 PetriNetUnfolderBase]: 130/234 cut-off events. [2025-02-08 01:13:06,409 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 01:13:06,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 234 events. 130/234 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 625 event pairs, 124 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 481. Up to 232 conditions per place. [2025-02-08 01:13:06,411 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 30 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2025-02-08 01:13:06,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 173 flow [2025-02-08 01:13:06,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:13:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:13:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-02-08 01:13:06,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31756756756756754 [2025-02-08 01:13:06,413 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 105 flow. Second operand 4 states and 47 transitions. [2025-02-08 01:13:06,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 173 flow [2025-02-08 01:13:06,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 34 transitions, 167 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 01:13:06,415 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 113 flow [2025-02-08 01:13:06,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-02-08 01:13:06,416 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2025-02-08 01:13:06,416 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 113 flow [2025-02-08 01:13:06,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:06,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:06,417 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:06,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 01:13:06,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:06,618 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:06,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:06,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2089559589, now seen corresponding path program 1 times [2025-02-08 01:13:06,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:06,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319012543] [2025-02-08 01:13:06,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:06,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:06,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 01:13:06,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 01:13:06,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:06,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 01:13:06,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:06,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319012543] [2025-02-08 01:13:06,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319012543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:06,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:06,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:13:06,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999207409] [2025-02-08 01:13:06,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:06,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:13:06,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:06,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:13:06,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:13:06,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:06,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:06,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:06,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:06,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:06,862 INFO L124 PetriNetUnfolderBase]: 130/235 cut-off events. [2025-02-08 01:13:06,862 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 01:13:06,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 235 events. 130/235 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 625 event pairs, 124 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 486. Up to 233 conditions per place. [2025-02-08 01:13:06,864 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 31 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2025-02-08 01:13:06,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 183 flow [2025-02-08 01:13:06,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:13:06,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:13:06,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-02-08 01:13:06,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31756756756756754 [2025-02-08 01:13:06,866 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 113 flow. Second operand 4 states and 47 transitions. [2025-02-08 01:13:06,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 183 flow [2025-02-08 01:13:06,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 177 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 01:13:06,867 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 121 flow [2025-02-08 01:13:06,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2025-02-08 01:13:06,869 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2025-02-08 01:13:06,869 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 121 flow [2025-02-08 01:13:06,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:13:06,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:06,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:06,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:13:06,870 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:06,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:06,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1764439928, now seen corresponding path program 1 times [2025-02-08 01:13:06,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:06,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861111008] [2025-02-08 01:13:06,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:06,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:06,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 01:13:06,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:13:06,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:06,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 01:13:07,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:07,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861111008] [2025-02-08 01:13:07,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861111008] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:13:07,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147641364] [2025-02-08 01:13:07,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:07,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:07,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:07,029 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:13:07,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 01:13:07,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 01:13:07,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 01:13:07,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:07,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:07,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 01:13:07,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:13:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:13:07,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:13:07,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147641364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:07,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:13:07,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-08 01:13:07,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140840500] [2025-02-08 01:13:07,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:07,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:13:07,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:07,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:13:07,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:13:07,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:07,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:07,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:07,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:07,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:07,252 INFO L124 PetriNetUnfolderBase]: 130/236 cut-off events. [2025-02-08 01:13:07,252 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 01:13:07,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 236 events. 130/236 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 625 event pairs, 124 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 491. Up to 234 conditions per place. [2025-02-08 01:13:07,253 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 32 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2025-02-08 01:13:07,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 193 flow [2025-02-08 01:13:07,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:13:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:13:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-02-08 01:13:07,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31756756756756754 [2025-02-08 01:13:07,254 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 121 flow. Second operand 4 states and 47 transitions. [2025-02-08 01:13:07,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 193 flow [2025-02-08 01:13:07,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 187 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 01:13:07,255 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 129 flow [2025-02-08 01:13:07,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2025-02-08 01:13:07,256 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2025-02-08 01:13:07,256 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 129 flow [2025-02-08 01:13:07,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:07,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:07,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:07,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 01:13:07,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:07,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:07,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:07,458 INFO L85 PathProgramCache]: Analyzing trace with hash -128739547, now seen corresponding path program 1 times [2025-02-08 01:13:07,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:07,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858736629] [2025-02-08 01:13:07,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:13:07,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:07,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:13:07,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:07,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:07,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:07,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:07,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858736629] [2025-02-08 01:13:07,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858736629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:07,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:07,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:07,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748638080] [2025-02-08 01:13:07,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:07,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:07,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:07,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:07,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:07,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:07,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 129 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:07,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:07,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:07,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:08,269 INFO L124 PetriNetUnfolderBase]: 151/294 cut-off events. [2025-02-08 01:13:08,270 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-08 01:13:08,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 294 events. 151/294 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1079 event pairs, 20 based on Foata normal form. 1/294 useless extension candidates. Maximal degree in co-relation 611. Up to 88 conditions per place. [2025-02-08 01:13:08,271 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 62 selfloop transitions, 4 changer transitions 11/78 dead transitions. [2025-02-08 01:13:08,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 78 transitions, 382 flow [2025-02-08 01:13:08,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2025-02-08 01:13:08,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2025-02-08 01:13:08,272 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 129 flow. Second operand 8 states and 104 transitions. [2025-02-08 01:13:08,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 78 transitions, 382 flow [2025-02-08 01:13:08,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 376 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 01:13:08,274 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 150 flow [2025-02-08 01:13:08,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=150, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2025-02-08 01:13:08,274 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2025-02-08 01:13:08,275 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 150 flow [2025-02-08 01:13:08,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:08,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:08,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:08,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:13:08,275 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:08,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:08,276 INFO L85 PathProgramCache]: Analyzing trace with hash 770605207, now seen corresponding path program 2 times [2025-02-08 01:13:08,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:08,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721144017] [2025-02-08 01:13:08,276 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:08,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:08,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:08,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:08,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:08,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:08,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:08,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:08,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721144017] [2025-02-08 01:13:08,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721144017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:08,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:08,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:08,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996637728] [2025-02-08 01:13:08,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:08,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:08,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:08,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:08,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:08,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:08,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 150 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:08,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:08,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:08,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:08,955 INFO L124 PetriNetUnfolderBase]: 155/315 cut-off events. [2025-02-08 01:13:08,955 INFO L125 PetriNetUnfolderBase]: For 218/218 co-relation queries the response was YES. [2025-02-08 01:13:08,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 315 events. 155/315 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1190 event pairs, 26 based on Foata normal form. 1/315 useless extension candidates. Maximal degree in co-relation 867. Up to 102 conditions per place. [2025-02-08 01:13:08,960 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 59 selfloop transitions, 6 changer transitions 7/73 dead transitions. [2025-02-08 01:13:08,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 73 transitions, 411 flow [2025-02-08 01:13:08,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:08,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2025-02-08 01:13:08,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3277027027027027 [2025-02-08 01:13:08,962 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 150 flow. Second operand 8 states and 97 transitions. [2025-02-08 01:13:08,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 73 transitions, 411 flow [2025-02-08 01:13:08,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 383 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:08,964 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 177 flow [2025-02-08 01:13:08,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=177, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2025-02-08 01:13:08,965 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2025-02-08 01:13:08,965 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 177 flow [2025-02-08 01:13:08,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:08,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:08,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:08,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:13:08,966 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:08,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:08,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1570090651, now seen corresponding path program 3 times [2025-02-08 01:13:08,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:08,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109974537] [2025-02-08 01:13:08,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:08,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:08,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:09,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:09,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:09,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:09,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:09,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109974537] [2025-02-08 01:13:09,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109974537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:09,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:09,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:09,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513381507] [2025-02-08 01:13:09,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:09,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:09,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:09,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:09,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:09,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:09,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 177 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:09,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:09,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:09,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:09,795 INFO L124 PetriNetUnfolderBase]: 181/393 cut-off events. [2025-02-08 01:13:09,796 INFO L125 PetriNetUnfolderBase]: For 609/609 co-relation queries the response was YES. [2025-02-08 01:13:09,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 393 events. 181/393 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1788 event pairs, 26 based on Foata normal form. 1/393 useless extension candidates. Maximal degree in co-relation 1234. Up to 144 conditions per place. [2025-02-08 01:13:09,798 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 68 selfloop transitions, 6 changer transitions 9/84 dead transitions. [2025-02-08 01:13:09,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 541 flow [2025-02-08 01:13:09,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:09,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:09,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2025-02-08 01:13:09,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33783783783783783 [2025-02-08 01:13:09,799 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 177 flow. Second operand 8 states and 100 transitions. [2025-02-08 01:13:09,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 84 transitions, 541 flow [2025-02-08 01:13:09,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 84 transitions, 510 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:09,803 INFO L231 Difference]: Finished difference. Result has 65 places, 44 transitions, 222 flow [2025-02-08 01:13:09,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=65, PETRI_TRANSITIONS=44} [2025-02-08 01:13:09,804 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2025-02-08 01:13:09,804 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 222 flow [2025-02-08 01:13:09,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:09,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:09,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:09,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:13:09,805 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:09,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1864696795, now seen corresponding path program 4 times [2025-02-08 01:13:09,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:09,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697783008] [2025-02-08 01:13:09,805 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:09,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:09,824 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:09,845 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:09,845 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:09,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:10,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:10,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697783008] [2025-02-08 01:13:10,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697783008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:10,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:10,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:10,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514555879] [2025-02-08 01:13:10,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:10,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:10,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:10,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:10,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:10,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:10,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 44 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:10,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:10,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:10,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:10,556 INFO L124 PetriNetUnfolderBase]: 218/504 cut-off events. [2025-02-08 01:13:10,556 INFO L125 PetriNetUnfolderBase]: For 1036/1036 co-relation queries the response was YES. [2025-02-08 01:13:10,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 504 events. 218/504 cut-off events. For 1036/1036 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2546 event pairs, 49 based on Foata normal form. 1/504 useless extension candidates. Maximal degree in co-relation 1714. Up to 209 conditions per place. [2025-02-08 01:13:10,559 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 68 selfloop transitions, 10 changer transitions 8/87 dead transitions. [2025-02-08 01:13:10,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 87 transitions, 593 flow [2025-02-08 01:13:10,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2025-02-08 01:13:10,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33783783783783783 [2025-02-08 01:13:10,560 INFO L175 Difference]: Start difference. First operand has 65 places, 44 transitions, 222 flow. Second operand 8 states and 100 transitions. [2025-02-08 01:13:10,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 87 transitions, 593 flow [2025-02-08 01:13:10,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 87 transitions, 565 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:10,563 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 313 flow [2025-02-08 01:13:10,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=313, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2025-02-08 01:13:10,563 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 38 predicate places. [2025-02-08 01:13:10,564 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 313 flow [2025-02-08 01:13:10,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:10,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:10,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:10,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:13:10,564 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:10,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:10,564 INFO L85 PathProgramCache]: Analyzing trace with hash 933879449, now seen corresponding path program 5 times [2025-02-08 01:13:10,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:10,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211671016] [2025-02-08 01:13:10,564 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:13:10,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:10,575 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:10,593 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:10,593 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:13:10,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:11,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:11,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:11,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211671016] [2025-02-08 01:13:11,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211671016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:11,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:11,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:11,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125599290] [2025-02-08 01:13:11,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:11,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:11,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:11,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:11,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:11,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:11,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 313 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:11,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:11,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:11,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:11,373 INFO L124 PetriNetUnfolderBase]: 292/727 cut-off events. [2025-02-08 01:13:11,374 INFO L125 PetriNetUnfolderBase]: For 2504/2504 co-relation queries the response was YES. [2025-02-08 01:13:11,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2848 conditions, 727 events. 292/727 cut-off events. For 2504/2504 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4507 event pairs, 51 based on Foata normal form. 1/727 useless extension candidates. Maximal degree in co-relation 2809. Up to 276 conditions per place. [2025-02-08 01:13:11,378 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 84 selfloop transitions, 11 changer transitions 10/106 dead transitions. [2025-02-08 01:13:11,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 106 transitions, 873 flow [2025-02-08 01:13:11,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:11,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:11,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2025-02-08 01:13:11,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34459459459459457 [2025-02-08 01:13:11,379 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 313 flow. Second operand 8 states and 102 transitions. [2025-02-08 01:13:11,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 106 transitions, 873 flow [2025-02-08 01:13:11,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 106 transitions, 844 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-02-08 01:13:11,385 INFO L231 Difference]: Finished difference. Result has 80 places, 57 transitions, 428 flow [2025-02-08 01:13:11,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=428, PETRI_PLACES=80, PETRI_TRANSITIONS=57} [2025-02-08 01:13:11,386 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 46 predicate places. [2025-02-08 01:13:11,386 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 57 transitions, 428 flow [2025-02-08 01:13:11,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:11,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:11,386 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:11,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:13:11,386 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:11,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:11,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1299511253, now seen corresponding path program 6 times [2025-02-08 01:13:11,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:11,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348539256] [2025-02-08 01:13:11,387 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:13:11,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:11,397 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:11,404 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:11,404 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:13:11,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:11,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:11,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348539256] [2025-02-08 01:13:11,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348539256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:11,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:11,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:11,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645525518] [2025-02-08 01:13:11,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:11,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:11,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:11,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:11,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:11,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:11,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 57 transitions, 428 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:11,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:11,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:11,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:11,955 INFO L124 PetriNetUnfolderBase]: 285/767 cut-off events. [2025-02-08 01:13:11,955 INFO L125 PetriNetUnfolderBase]: For 3430/3430 co-relation queries the response was YES. [2025-02-08 01:13:11,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3184 conditions, 767 events. 285/767 cut-off events. For 3430/3430 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4868 event pairs, 93 based on Foata normal form. 1/767 useless extension candidates. Maximal degree in co-relation 3141. Up to 337 conditions per place. [2025-02-08 01:13:11,960 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 74 selfloop transitions, 16 changer transitions 8/99 dead transitions. [2025-02-08 01:13:11,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 99 transitions, 888 flow [2025-02-08 01:13:11,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2025-02-08 01:13:11,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32432432432432434 [2025-02-08 01:13:11,961 INFO L175 Difference]: Start difference. First operand has 80 places, 57 transitions, 428 flow. Second operand 8 states and 96 transitions. [2025-02-08 01:13:11,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 99 transitions, 888 flow [2025-02-08 01:13:11,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 99 transitions, 863 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-02-08 01:13:11,969 INFO L231 Difference]: Finished difference. Result has 88 places, 63 transitions, 546 flow [2025-02-08 01:13:11,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=546, PETRI_PLACES=88, PETRI_TRANSITIONS=63} [2025-02-08 01:13:11,969 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 54 predicate places. [2025-02-08 01:13:11,969 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 63 transitions, 546 flow [2025-02-08 01:13:11,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:11,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:11,970 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:11,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 01:13:11,970 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:11,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash 466211115, now seen corresponding path program 7 times [2025-02-08 01:13:11,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:11,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308736431] [2025-02-08 01:13:11,971 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:13:11,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:11,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:13:11,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:11,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:11,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:12,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:12,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308736431] [2025-02-08 01:13:12,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308736431] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:12,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:12,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:12,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939002400] [2025-02-08 01:13:12,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:12,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:12,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:12,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:12,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:12,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:12,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 63 transitions, 546 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:12,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:12,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:12,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:12,695 INFO L124 PetriNetUnfolderBase]: 368/1067 cut-off events. [2025-02-08 01:13:12,696 INFO L125 PetriNetUnfolderBase]: For 6329/6329 co-relation queries the response was YES. [2025-02-08 01:13:12,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4778 conditions, 1067 events. 368/1067 cut-off events. For 6329/6329 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8000 event pairs, 81 based on Foata normal form. 1/1067 useless extension candidates. Maximal degree in co-relation 4731. Up to 401 conditions per place. [2025-02-08 01:13:12,705 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 114 selfloop transitions, 9 changer transitions 15/139 dead transitions. [2025-02-08 01:13:12,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 139 transitions, 1447 flow [2025-02-08 01:13:12,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2025-02-08 01:13:12,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36824324324324326 [2025-02-08 01:13:12,707 INFO L175 Difference]: Start difference. First operand has 88 places, 63 transitions, 546 flow. Second operand 8 states and 109 transitions. [2025-02-08 01:13:12,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 139 transitions, 1447 flow [2025-02-08 01:13:12,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 139 transitions, 1360 flow, removed 35 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:12,719 INFO L231 Difference]: Finished difference. Result has 95 places, 69 transitions, 620 flow [2025-02-08 01:13:12,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=620, PETRI_PLACES=95, PETRI_TRANSITIONS=69} [2025-02-08 01:13:12,720 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 61 predicate places. [2025-02-08 01:13:12,720 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 69 transitions, 620 flow [2025-02-08 01:13:12,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:12,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:12,720 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:12,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 01:13:12,721 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:12,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:12,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1708581153, now seen corresponding path program 8 times [2025-02-08 01:13:12,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:12,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934930206] [2025-02-08 01:13:12,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:12,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:12,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:12,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:12,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:12,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:12,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:12,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934930206] [2025-02-08 01:13:12,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934930206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:12,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:12,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:12,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608751534] [2025-02-08 01:13:12,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:12,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:12,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:12,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:12,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:12,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:12,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 69 transitions, 620 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:12,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:12,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:12,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:13,323 INFO L124 PetriNetUnfolderBase]: 357/1046 cut-off events. [2025-02-08 01:13:13,324 INFO L125 PetriNetUnfolderBase]: For 6595/6595 co-relation queries the response was YES. [2025-02-08 01:13:13,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4854 conditions, 1046 events. 357/1046 cut-off events. For 6595/6595 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7746 event pairs, 67 based on Foata normal form. 1/1046 useless extension candidates. Maximal degree in co-relation 4804. Up to 538 conditions per place. [2025-02-08 01:13:13,331 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 83 selfloop transitions, 18 changer transitions 7/109 dead transitions. [2025-02-08 01:13:13,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 109 transitions, 1100 flow [2025-02-08 01:13:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:13,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2025-02-08 01:13:13,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3344594594594595 [2025-02-08 01:13:13,333 INFO L175 Difference]: Start difference. First operand has 95 places, 69 transitions, 620 flow. Second operand 8 states and 99 transitions. [2025-02-08 01:13:13,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 109 transitions, 1100 flow [2025-02-08 01:13:13,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 109 transitions, 1080 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:13,344 INFO L231 Difference]: Finished difference. Result has 100 places, 71 transitions, 680 flow [2025-02-08 01:13:13,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=680, PETRI_PLACES=100, PETRI_TRANSITIONS=71} [2025-02-08 01:13:13,346 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 66 predicate places. [2025-02-08 01:13:13,346 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 71 transitions, 680 flow [2025-02-08 01:13:13,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:13,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:13,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:13,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 01:13:13,346 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:13,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1655023785, now seen corresponding path program 9 times [2025-02-08 01:13:13,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:13,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255792636] [2025-02-08 01:13:13,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:13,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:13,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:13,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:13,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:13,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:13,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:13,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255792636] [2025-02-08 01:13:13,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255792636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:13,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:13,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:13,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815084253] [2025-02-08 01:13:13,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:13,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:13,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:13,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:13,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:13,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:13,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 71 transitions, 680 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:13,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:13,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:13,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:13,963 INFO L124 PetriNetUnfolderBase]: 354/1036 cut-off events. [2025-02-08 01:13:13,963 INFO L125 PetriNetUnfolderBase]: For 7288/7288 co-relation queries the response was YES. [2025-02-08 01:13:13,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5052 conditions, 1036 events. 354/1036 cut-off events. For 7288/7288 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 7779 event pairs, 78 based on Foata normal form. 1/1036 useless extension candidates. Maximal degree in co-relation 5001. Up to 573 conditions per place. [2025-02-08 01:13:13,969 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 101 selfloop transitions, 11 changer transitions 9/122 dead transitions. [2025-02-08 01:13:13,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 122 transitions, 1269 flow [2025-02-08 01:13:13,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2025-02-08 01:13:13,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3547297297297297 [2025-02-08 01:13:13,971 INFO L175 Difference]: Start difference. First operand has 100 places, 71 transitions, 680 flow. Second operand 8 states and 105 transitions. [2025-02-08 01:13:13,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 122 transitions, 1269 flow [2025-02-08 01:13:13,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 122 transitions, 1212 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:13,980 INFO L231 Difference]: Finished difference. Result has 106 places, 73 transitions, 707 flow [2025-02-08 01:13:13,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=707, PETRI_PLACES=106, PETRI_TRANSITIONS=73} [2025-02-08 01:13:13,980 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 72 predicate places. [2025-02-08 01:13:13,981 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 73 transitions, 707 flow [2025-02-08 01:13:13,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:13,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:13,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:13,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 01:13:13,981 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:13,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:13,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2002730669, now seen corresponding path program 10 times [2025-02-08 01:13:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:13,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798562503] [2025-02-08 01:13:13,982 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:13,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:13,991 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:14,010 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:14,010 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:14,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:14,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:14,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798562503] [2025-02-08 01:13:14,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798562503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:14,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:14,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:14,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478508717] [2025-02-08 01:13:14,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:14,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:14,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:14,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:14,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:14,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:14,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 73 transitions, 707 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:14,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:14,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:14,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:14,658 INFO L124 PetriNetUnfolderBase]: 377/1140 cut-off events. [2025-02-08 01:13:14,659 INFO L125 PetriNetUnfolderBase]: For 8323/8323 co-relation queries the response was YES. [2025-02-08 01:13:14,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5519 conditions, 1140 events. 377/1140 cut-off events. For 8323/8323 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 8780 event pairs, 75 based on Foata normal form. 1/1140 useless extension candidates. Maximal degree in co-relation 5465. Up to 610 conditions per place. [2025-02-08 01:13:14,666 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 88 selfloop transitions, 18 changer transitions 13/120 dead transitions. [2025-02-08 01:13:14,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 120 transitions, 1309 flow [2025-02-08 01:13:14,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:14,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2025-02-08 01:13:14,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34121621621621623 [2025-02-08 01:13:14,668 INFO L175 Difference]: Start difference. First operand has 106 places, 73 transitions, 707 flow. Second operand 8 states and 101 transitions. [2025-02-08 01:13:14,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 120 transitions, 1309 flow [2025-02-08 01:13:14,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 120 transitions, 1266 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:14,681 INFO L231 Difference]: Finished difference. Result has 112 places, 76 transitions, 789 flow [2025-02-08 01:13:14,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=789, PETRI_PLACES=112, PETRI_TRANSITIONS=76} [2025-02-08 01:13:14,681 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 78 predicate places. [2025-02-08 01:13:14,682 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 76 transitions, 789 flow [2025-02-08 01:13:14,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:14,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:14,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:14,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 01:13:14,683 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:14,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:14,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1738140675, now seen corresponding path program 11 times [2025-02-08 01:13:14,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:14,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309641721] [2025-02-08 01:13:14,683 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:13:14,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:14,693 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:14,707 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:14,707 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:13:14,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:14,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:14,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309641721] [2025-02-08 01:13:14,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309641721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:14,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:14,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572298585] [2025-02-08 01:13:14,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:14,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:14,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:14,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:14,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:14,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 76 transitions, 789 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:14,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:14,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:14,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:15,296 INFO L124 PetriNetUnfolderBase]: 371/1123 cut-off events. [2025-02-08 01:13:15,296 INFO L125 PetriNetUnfolderBase]: For 9384/9384 co-relation queries the response was YES. [2025-02-08 01:13:15,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5611 conditions, 1123 events. 371/1123 cut-off events. For 9384/9384 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8722 event pairs, 80 based on Foata normal form. 1/1123 useless extension candidates. Maximal degree in co-relation 5554. Up to 649 conditions per place. [2025-02-08 01:13:15,304 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 90 selfloop transitions, 11 changer transitions 18/120 dead transitions. [2025-02-08 01:13:15,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 120 transitions, 1319 flow [2025-02-08 01:13:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2025-02-08 01:13:15,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34121621621621623 [2025-02-08 01:13:15,306 INFO L175 Difference]: Start difference. First operand has 112 places, 76 transitions, 789 flow. Second operand 8 states and 101 transitions. [2025-02-08 01:13:15,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 120 transitions, 1319 flow [2025-02-08 01:13:15,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 120 transitions, 1282 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:15,321 INFO L231 Difference]: Finished difference. Result has 114 places, 72 transitions, 716 flow [2025-02-08 01:13:15,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=716, PETRI_PLACES=114, PETRI_TRANSITIONS=72} [2025-02-08 01:13:15,321 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 80 predicate places. [2025-02-08 01:13:15,321 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 72 transitions, 716 flow [2025-02-08 01:13:15,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:15,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:15,322 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:15,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 01:13:15,322 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:15,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:15,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2125243141, now seen corresponding path program 12 times [2025-02-08 01:13:15,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:15,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149345467] [2025-02-08 01:13:15,323 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:13:15,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:15,339 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:15,353 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:15,353 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:13:15,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:15,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:15,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149345467] [2025-02-08 01:13:15,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149345467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:15,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:15,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:15,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676995497] [2025-02-08 01:13:15,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:15,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:15,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:15,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:15,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:15,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:15,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 72 transitions, 716 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:15,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:15,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:15,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:15,969 INFO L124 PetriNetUnfolderBase]: 368/1172 cut-off events. [2025-02-08 01:13:15,970 INFO L125 PetriNetUnfolderBase]: For 9124/9124 co-relation queries the response was YES. [2025-02-08 01:13:15,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5766 conditions, 1172 events. 368/1172 cut-off events. For 9124/9124 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9321 event pairs, 93 based on Foata normal form. 1/1172 useless extension candidates. Maximal degree in co-relation 5710. Up to 524 conditions per place. [2025-02-08 01:13:15,978 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 112 selfloop transitions, 13 changer transitions 13/139 dead transitions. [2025-02-08 01:13:15,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 139 transitions, 1557 flow [2025-02-08 01:13:15,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2025-02-08 01:13:15,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36486486486486486 [2025-02-08 01:13:15,980 INFO L175 Difference]: Start difference. First operand has 114 places, 72 transitions, 716 flow. Second operand 8 states and 108 transitions. [2025-02-08 01:13:15,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 139 transitions, 1557 flow [2025-02-08 01:13:15,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 139 transitions, 1499 flow, removed 13 selfloop flow, removed 6 redundant places. [2025-02-08 01:13:15,995 INFO L231 Difference]: Finished difference. Result has 116 places, 78 transitions, 831 flow [2025-02-08 01:13:15,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=831, PETRI_PLACES=116, PETRI_TRANSITIONS=78} [2025-02-08 01:13:15,995 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 82 predicate places. [2025-02-08 01:13:15,995 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 78 transitions, 831 flow [2025-02-08 01:13:15,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:15,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:15,996 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:15,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 01:13:15,996 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:15,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:15,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1661138035, now seen corresponding path program 13 times [2025-02-08 01:13:15,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:15,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067467065] [2025-02-08 01:13:15,997 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:13:15,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:16,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:13:16,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:16,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:16,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:16,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:16,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:16,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067467065] [2025-02-08 01:13:16,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067467065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:16,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:16,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:16,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688581496] [2025-02-08 01:13:16,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:16,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:16,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:16,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:16,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:16,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:16,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 78 transitions, 831 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:16,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:16,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:16,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:16,586 INFO L124 PetriNetUnfolderBase]: 364/1245 cut-off events. [2025-02-08 01:13:16,587 INFO L125 PetriNetUnfolderBase]: For 10131/10131 co-relation queries the response was YES. [2025-02-08 01:13:16,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6088 conditions, 1245 events. 364/1245 cut-off events. For 10131/10131 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 10299 event pairs, 106 based on Foata normal form. 1/1245 useless extension candidates. Maximal degree in co-relation 6029. Up to 594 conditions per place. [2025-02-08 01:13:16,596 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 94 selfloop transitions, 21 changer transitions 10/126 dead transitions. [2025-02-08 01:13:16,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 126 transitions, 1561 flow [2025-02-08 01:13:16,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2025-02-08 01:13:16,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32432432432432434 [2025-02-08 01:13:16,598 INFO L175 Difference]: Start difference. First operand has 116 places, 78 transitions, 831 flow. Second operand 8 states and 96 transitions. [2025-02-08 01:13:16,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 126 transitions, 1561 flow [2025-02-08 01:13:16,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 126 transitions, 1507 flow, removed 23 selfloop flow, removed 3 redundant places. [2025-02-08 01:13:16,615 INFO L231 Difference]: Finished difference. Result has 124 places, 86 transitions, 1017 flow [2025-02-08 01:13:16,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1017, PETRI_PLACES=124, PETRI_TRANSITIONS=86} [2025-02-08 01:13:16,615 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 90 predicate places. [2025-02-08 01:13:16,615 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 86 transitions, 1017 flow [2025-02-08 01:13:16,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:16,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:16,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:16,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 01:13:16,617 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:16,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:16,617 INFO L85 PathProgramCache]: Analyzing trace with hash 910896177, now seen corresponding path program 14 times [2025-02-08 01:13:16,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:16,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045011522] [2025-02-08 01:13:16,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:16,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:16,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:16,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:16,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:16,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:16,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:16,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045011522] [2025-02-08 01:13:16,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045011522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:16,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:16,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:16,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093577098] [2025-02-08 01:13:16,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:16,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:16,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:16,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:16,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:16,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:16,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 86 transitions, 1017 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:16,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:16,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:16,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:17,190 INFO L124 PetriNetUnfolderBase]: 354/1213 cut-off events. [2025-02-08 01:13:17,190 INFO L125 PetriNetUnfolderBase]: For 10698/10698 co-relation queries the response was YES. [2025-02-08 01:13:17,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6178 conditions, 1213 events. 354/1213 cut-off events. For 10698/10698 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 10008 event pairs, 103 based on Foata normal form. 1/1213 useless extension candidates. Maximal degree in co-relation 6115. Up to 728 conditions per place. [2025-02-08 01:13:17,200 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 96 selfloop transitions, 23 changer transitions 9/129 dead transitions. [2025-02-08 01:13:17,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 129 transitions, 1577 flow [2025-02-08 01:13:17,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-02-08 01:13:17,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34797297297297297 [2025-02-08 01:13:17,202 INFO L175 Difference]: Start difference. First operand has 124 places, 86 transitions, 1017 flow. Second operand 8 states and 103 transitions. [2025-02-08 01:13:17,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 129 transitions, 1577 flow [2025-02-08 01:13:17,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 129 transitions, 1521 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:17,219 INFO L231 Difference]: Finished difference. Result has 128 places, 87 transitions, 1056 flow [2025-02-08 01:13:17,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=969, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1056, PETRI_PLACES=128, PETRI_TRANSITIONS=87} [2025-02-08 01:13:17,220 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 94 predicate places. [2025-02-08 01:13:17,220 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 87 transitions, 1056 flow [2025-02-08 01:13:17,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:17,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:17,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:17,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 01:13:17,220 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:17,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:17,221 INFO L85 PathProgramCache]: Analyzing trace with hash 721609339, now seen corresponding path program 15 times [2025-02-08 01:13:17,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:17,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137533605] [2025-02-08 01:13:17,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:17,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:17,230 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:17,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:17,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:17,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:17,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:17,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137533605] [2025-02-08 01:13:17,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137533605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:17,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:17,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:17,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562532057] [2025-02-08 01:13:17,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:17,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:17,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:17,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:17,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:17,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:17,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 87 transitions, 1056 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:17,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:17,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:17,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:17,750 INFO L124 PetriNetUnfolderBase]: 350/1199 cut-off events. [2025-02-08 01:13:17,751 INFO L125 PetriNetUnfolderBase]: For 10313/10313 co-relation queries the response was YES. [2025-02-08 01:13:17,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6138 conditions, 1199 events. 350/1199 cut-off events. For 10313/10313 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 9863 event pairs, 103 based on Foata normal form. 1/1199 useless extension candidates. Maximal degree in co-relation 6075. Up to 728 conditions per place. [2025-02-08 01:13:17,756 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 85 selfloop transitions, 20 changer transitions 18/124 dead transitions. [2025-02-08 01:13:17,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 124 transitions, 1543 flow [2025-02-08 01:13:17,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2025-02-08 01:13:17,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3344594594594595 [2025-02-08 01:13:17,757 INFO L175 Difference]: Start difference. First operand has 128 places, 87 transitions, 1056 flow. Second operand 8 states and 99 transitions. [2025-02-08 01:13:17,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 124 transitions, 1543 flow [2025-02-08 01:13:17,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 124 transitions, 1491 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:17,775 INFO L231 Difference]: Finished difference. Result has 131 places, 84 transitions, 993 flow [2025-02-08 01:13:17,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=993, PETRI_PLACES=131, PETRI_TRANSITIONS=84} [2025-02-08 01:13:17,775 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 97 predicate places. [2025-02-08 01:13:17,775 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 84 transitions, 993 flow [2025-02-08 01:13:17,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:17,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:17,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:17,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 01:13:17,776 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:17,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:17,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2101001033, now seen corresponding path program 16 times [2025-02-08 01:13:17,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:17,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846491523] [2025-02-08 01:13:17,776 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:17,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:17,784 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:17,792 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:17,792 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:17,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:17,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:17,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846491523] [2025-02-08 01:13:17,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846491523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:17,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:17,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:17,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320750015] [2025-02-08 01:13:17,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:17,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:17,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:17,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:17,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:17,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:17,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 84 transitions, 993 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:17,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:17,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:17,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:18,359 INFO L124 PetriNetUnfolderBase]: 339/1168 cut-off events. [2025-02-08 01:13:18,360 INFO L125 PetriNetUnfolderBase]: For 9961/9961 co-relation queries the response was YES. [2025-02-08 01:13:18,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5955 conditions, 1168 events. 339/1168 cut-off events. For 9961/9961 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 9567 event pairs, 86 based on Foata normal form. 1/1168 useless extension candidates. Maximal degree in co-relation 5892. Up to 562 conditions per place. [2025-02-08 01:13:18,366 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 109 selfloop transitions, 18 changer transitions 15/143 dead transitions. [2025-02-08 01:13:18,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 143 transitions, 1760 flow [2025-02-08 01:13:18,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2025-02-08 01:13:18,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3581081081081081 [2025-02-08 01:13:18,367 INFO L175 Difference]: Start difference. First operand has 131 places, 84 transitions, 993 flow. Second operand 8 states and 106 transitions. [2025-02-08 01:13:18,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 143 transitions, 1760 flow [2025-02-08 01:13:18,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 143 transitions, 1678 flow, removed 13 selfloop flow, removed 8 redundant places. [2025-02-08 01:13:18,386 INFO L231 Difference]: Finished difference. Result has 130 places, 89 transitions, 1081 flow [2025-02-08 01:13:18,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1081, PETRI_PLACES=130, PETRI_TRANSITIONS=89} [2025-02-08 01:13:18,387 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 96 predicate places. [2025-02-08 01:13:18,387 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 89 transitions, 1081 flow [2025-02-08 01:13:18,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:18,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:18,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:18,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 01:13:18,388 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:18,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:18,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1521005483, now seen corresponding path program 17 times [2025-02-08 01:13:18,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:18,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503034255] [2025-02-08 01:13:18,389 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:13:18,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:18,398 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:18,410 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:18,411 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:13:18,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:18,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:18,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503034255] [2025-02-08 01:13:18,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503034255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:18,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:18,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:18,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620740159] [2025-02-08 01:13:18,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:18,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:18,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:18,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:18,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:18,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:18,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 89 transitions, 1081 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:18,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:18,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:18,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:19,068 INFO L124 PetriNetUnfolderBase]: 330/1142 cut-off events. [2025-02-08 01:13:19,069 INFO L125 PetriNetUnfolderBase]: For 9813/9813 co-relation queries the response was YES. [2025-02-08 01:13:19,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5870 conditions, 1142 events. 330/1142 cut-off events. For 9813/9813 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9319 event pairs, 84 based on Foata normal form. 1/1142 useless extension candidates. Maximal degree in co-relation 5807. Up to 562 conditions per place. [2025-02-08 01:13:19,076 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 109 selfloop transitions, 18 changer transitions 9/137 dead transitions. [2025-02-08 01:13:19,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 137 transitions, 1695 flow [2025-02-08 01:13:19,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2025-02-08 01:13:19,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2025-02-08 01:13:19,078 INFO L175 Difference]: Start difference. First operand has 130 places, 89 transitions, 1081 flow. Second operand 8 states and 104 transitions. [2025-02-08 01:13:19,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 137 transitions, 1695 flow [2025-02-08 01:13:19,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 137 transitions, 1656 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:19,096 INFO L231 Difference]: Finished difference. Result has 134 places, 91 transitions, 1136 flow [2025-02-08 01:13:19,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1136, PETRI_PLACES=134, PETRI_TRANSITIONS=91} [2025-02-08 01:13:19,097 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 100 predicate places. [2025-02-08 01:13:19,097 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 91 transitions, 1136 flow [2025-02-08 01:13:19,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:19,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:19,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:19,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 01:13:19,098 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:19,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:19,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1201694369, now seen corresponding path program 18 times [2025-02-08 01:13:19,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:19,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556979558] [2025-02-08 01:13:19,099 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:13:19,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:19,109 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:19,115 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:19,116 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:13:19,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:19,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:19,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:19,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556979558] [2025-02-08 01:13:19,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556979558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:19,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:19,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:19,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986461511] [2025-02-08 01:13:19,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:19,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:19,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:19,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:19,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:19,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:19,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 91 transitions, 1136 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:19,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:19,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:19,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:19,727 INFO L124 PetriNetUnfolderBase]: 328/1131 cut-off events. [2025-02-08 01:13:19,728 INFO L125 PetriNetUnfolderBase]: For 10414/10414 co-relation queries the response was YES. [2025-02-08 01:13:19,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5932 conditions, 1131 events. 328/1131 cut-off events. For 10414/10414 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 9191 event pairs, 95 based on Foata normal form. 1/1131 useless extension candidates. Maximal degree in co-relation 5868. Up to 562 conditions per place. [2025-02-08 01:13:19,737 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 116 selfloop transitions, 17 changer transitions 9/143 dead transitions. [2025-02-08 01:13:19,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 143 transitions, 1778 flow [2025-02-08 01:13:19,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:19,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2025-02-08 01:13:19,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3614864864864865 [2025-02-08 01:13:19,741 INFO L175 Difference]: Start difference. First operand has 134 places, 91 transitions, 1136 flow. Second operand 8 states and 107 transitions. [2025-02-08 01:13:19,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 143 transitions, 1778 flow [2025-02-08 01:13:19,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 143 transitions, 1739 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:19,779 INFO L231 Difference]: Finished difference. Result has 139 places, 93 transitions, 1189 flow [2025-02-08 01:13:19,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1189, PETRI_PLACES=139, PETRI_TRANSITIONS=93} [2025-02-08 01:13:19,780 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 105 predicate places. [2025-02-08 01:13:19,780 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 93 transitions, 1189 flow [2025-02-08 01:13:19,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:19,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:19,781 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:19,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 01:13:19,781 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:19,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:19,784 INFO L85 PathProgramCache]: Analyzing trace with hash -458329087, now seen corresponding path program 19 times [2025-02-08 01:13:19,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:19,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676745779] [2025-02-08 01:13:19,785 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:13:19,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:19,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:13:19,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:19,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:19,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:20,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:20,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676745779] [2025-02-08 01:13:20,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676745779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:20,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:20,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:20,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917198820] [2025-02-08 01:13:20,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:20,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:20,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:20,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:20,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:20,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:20,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 93 transitions, 1189 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:20,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:20,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:20,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:20,418 INFO L124 PetriNetUnfolderBase]: 324/1117 cut-off events. [2025-02-08 01:13:20,418 INFO L125 PetriNetUnfolderBase]: For 10483/10483 co-relation queries the response was YES. [2025-02-08 01:13:20,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5925 conditions, 1117 events. 324/1117 cut-off events. For 10483/10483 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9040 event pairs, 95 based on Foata normal form. 1/1117 useless extension candidates. Maximal degree in co-relation 5859. Up to 562 conditions per place. [2025-02-08 01:13:20,424 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 105 selfloop transitions, 14 changer transitions 18/138 dead transitions. [2025-02-08 01:13:20,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 138 transitions, 1752 flow [2025-02-08 01:13:20,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-02-08 01:13:20,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34797297297297297 [2025-02-08 01:13:20,429 INFO L175 Difference]: Start difference. First operand has 139 places, 93 transitions, 1189 flow. Second operand 8 states and 103 transitions. [2025-02-08 01:13:20,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 138 transitions, 1752 flow [2025-02-08 01:13:20,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 138 transitions, 1716 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:20,448 INFO L231 Difference]: Finished difference. Result has 142 places, 90 transitions, 1135 flow [2025-02-08 01:13:20,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1135, PETRI_PLACES=142, PETRI_TRANSITIONS=90} [2025-02-08 01:13:20,449 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 108 predicate places. [2025-02-08 01:13:20,449 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 90 transitions, 1135 flow [2025-02-08 01:13:20,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:20,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:20,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:20,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 01:13:20,449 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:20,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:20,450 INFO L85 PathProgramCache]: Analyzing trace with hash 939781899, now seen corresponding path program 20 times [2025-02-08 01:13:20,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:20,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208791508] [2025-02-08 01:13:20,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:20,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:20,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:20,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:20,466 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:20,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:20,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:20,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208791508] [2025-02-08 01:13:20,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208791508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:20,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:20,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:20,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136135805] [2025-02-08 01:13:20,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:20,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:20,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:20,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:20,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:20,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:20,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 90 transitions, 1135 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:20,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:20,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:20,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:21,012 INFO L124 PetriNetUnfolderBase]: 314/1088 cut-off events. [2025-02-08 01:13:21,012 INFO L125 PetriNetUnfolderBase]: For 10162/10162 co-relation queries the response was YES. [2025-02-08 01:13:21,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5773 conditions, 1088 events. 314/1088 cut-off events. For 10162/10162 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 8793 event pairs, 81 based on Foata normal form. 1/1088 useless extension candidates. Maximal degree in co-relation 5707. Up to 562 conditions per place. [2025-02-08 01:13:21,021 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 94 selfloop transitions, 15 changer transitions 17/127 dead transitions. [2025-02-08 01:13:21,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 127 transitions, 1619 flow [2025-02-08 01:13:21,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2025-02-08 01:13:21,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3344594594594595 [2025-02-08 01:13:21,026 INFO L175 Difference]: Start difference. First operand has 142 places, 90 transitions, 1135 flow. Second operand 8 states and 99 transitions. [2025-02-08 01:13:21,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 127 transitions, 1619 flow [2025-02-08 01:13:21,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 127 transitions, 1577 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-02-08 01:13:21,064 INFO L231 Difference]: Finished difference. Result has 139 places, 87 transitions, 1074 flow [2025-02-08 01:13:21,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1074, PETRI_PLACES=139, PETRI_TRANSITIONS=87} [2025-02-08 01:13:21,064 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 105 predicate places. [2025-02-08 01:13:21,064 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 87 transitions, 1074 flow [2025-02-08 01:13:21,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:21,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:21,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:21,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 01:13:21,065 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:21,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:21,065 INFO L85 PathProgramCache]: Analyzing trace with hash -935087255, now seen corresponding path program 21 times [2025-02-08 01:13:21,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:21,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762505988] [2025-02-08 01:13:21,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:21,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:21,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:21,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:21,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:21,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:21,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:21,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762505988] [2025-02-08 01:13:21,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762505988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:21,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:21,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:21,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997450876] [2025-02-08 01:13:21,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:21,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:21,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:21,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:21,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:21,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:21,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 87 transitions, 1074 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:21,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:21,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:21,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:21,629 INFO L124 PetriNetUnfolderBase]: 306/1063 cut-off events. [2025-02-08 01:13:21,629 INFO L125 PetriNetUnfolderBase]: For 9787/9787 co-relation queries the response was YES. [2025-02-08 01:13:21,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5670 conditions, 1063 events. 306/1063 cut-off events. For 9787/9787 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8553 event pairs, 86 based on Foata normal form. 1/1063 useless extension candidates. Maximal degree in co-relation 5606. Up to 562 conditions per place. [2025-02-08 01:13:21,638 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 111 selfloop transitions, 16 changer transitions 9/137 dead transitions. [2025-02-08 01:13:21,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 137 transitions, 1741 flow [2025-02-08 01:13:21,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:21,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2025-02-08 01:13:21,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3547297297297297 [2025-02-08 01:13:21,639 INFO L175 Difference]: Start difference. First operand has 139 places, 87 transitions, 1074 flow. Second operand 8 states and 105 transitions. [2025-02-08 01:13:21,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 137 transitions, 1741 flow [2025-02-08 01:13:21,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 137 transitions, 1683 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-02-08 01:13:21,658 INFO L231 Difference]: Finished difference. Result has 139 places, 93 transitions, 1184 flow [2025-02-08 01:13:21,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1184, PETRI_PLACES=139, PETRI_TRANSITIONS=93} [2025-02-08 01:13:21,659 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 105 predicate places. [2025-02-08 01:13:21,659 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 93 transitions, 1184 flow [2025-02-08 01:13:21,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:21,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:21,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:21,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 01:13:21,659 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:21,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:21,660 INFO L85 PathProgramCache]: Analyzing trace with hash -128689497, now seen corresponding path program 22 times [2025-02-08 01:13:21,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:21,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887102214] [2025-02-08 01:13:21,660 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:21,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:21,671 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:21,681 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:21,681 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:21,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:21,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:21,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:21,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887102214] [2025-02-08 01:13:21,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887102214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:21,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:21,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:21,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762766960] [2025-02-08 01:13:21,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:21,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:21,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:21,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:21,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:21,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:21,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 93 transitions, 1184 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:21,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:21,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:21,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:22,232 INFO L124 PetriNetUnfolderBase]: 303/1050 cut-off events. [2025-02-08 01:13:22,232 INFO L125 PetriNetUnfolderBase]: For 9630/9630 co-relation queries the response was YES. [2025-02-08 01:13:22,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5677 conditions, 1050 events. 303/1050 cut-off events. For 9630/9630 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 8406 event pairs, 88 based on Foata normal form. 1/1050 useless extension candidates. Maximal degree in co-relation 5612. Up to 562 conditions per place. [2025-02-08 01:13:22,247 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 108 selfloop transitions, 15 changer transitions 8/132 dead transitions. [2025-02-08 01:13:22,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 132 transitions, 1690 flow [2025-02-08 01:13:22,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:22,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-02-08 01:13:22,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34797297297297297 [2025-02-08 01:13:22,248 INFO L175 Difference]: Start difference. First operand has 139 places, 93 transitions, 1184 flow. Second operand 8 states and 103 transitions. [2025-02-08 01:13:22,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 132 transitions, 1690 flow [2025-02-08 01:13:22,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 132 transitions, 1646 flow, removed 13 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:22,272 INFO L231 Difference]: Finished difference. Result has 144 places, 95 transitions, 1230 flow [2025-02-08 01:13:22,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1230, PETRI_PLACES=144, PETRI_TRANSITIONS=95} [2025-02-08 01:13:22,277 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 110 predicate places. [2025-02-08 01:13:22,277 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 95 transitions, 1230 flow [2025-02-08 01:13:22,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:22,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:22,277 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:22,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 01:13:22,278 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:22,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:22,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1281363145, now seen corresponding path program 23 times [2025-02-08 01:13:22,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:22,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748060747] [2025-02-08 01:13:22,278 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:13:22,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:22,291 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:22,300 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:22,301 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:13:22,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:22,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:22,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:22,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748060747] [2025-02-08 01:13:22,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748060747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:22,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:22,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:22,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879132164] [2025-02-08 01:13:22,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:22,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:22,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:22,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:22,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:22,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:22,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 95 transitions, 1230 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:22,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:22,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:22,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:22,850 INFO L124 PetriNetUnfolderBase]: 300/1040 cut-off events. [2025-02-08 01:13:22,851 INFO L125 PetriNetUnfolderBase]: For 9624/9624 co-relation queries the response was YES. [2025-02-08 01:13:22,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5672 conditions, 1040 events. 300/1040 cut-off events. For 9624/9624 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8299 event pairs, 86 based on Foata normal form. 1/1040 useless extension candidates. Maximal degree in co-relation 5606. Up to 562 conditions per place. [2025-02-08 01:13:22,856 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 109 selfloop transitions, 15 changer transitions 11/136 dead transitions. [2025-02-08 01:13:22,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 136 transitions, 1760 flow [2025-02-08 01:13:22,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2025-02-08 01:13:22,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3547297297297297 [2025-02-08 01:13:22,860 INFO L175 Difference]: Start difference. First operand has 144 places, 95 transitions, 1230 flow. Second operand 8 states and 105 transitions. [2025-02-08 01:13:22,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 136 transitions, 1760 flow [2025-02-08 01:13:22,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 136 transitions, 1731 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:22,880 INFO L231 Difference]: Finished difference. Result has 149 places, 94 transitions, 1238 flow [2025-02-08 01:13:22,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1238, PETRI_PLACES=149, PETRI_TRANSITIONS=94} [2025-02-08 01:13:22,882 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 115 predicate places. [2025-02-08 01:13:22,882 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 94 transitions, 1238 flow [2025-02-08 01:13:22,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:22,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:22,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:22,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 01:13:22,882 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:22,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:22,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1773149175, now seen corresponding path program 24 times [2025-02-08 01:13:22,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:22,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367755431] [2025-02-08 01:13:22,883 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:13:22,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:22,896 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:22,906 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:22,906 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:13:22,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:23,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:23,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367755431] [2025-02-08 01:13:23,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367755431] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:23,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:23,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:23,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104101747] [2025-02-08 01:13:23,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:23,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:23,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:23,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:23,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:23,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:23,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 94 transitions, 1238 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:23,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:23,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:23,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:23,389 INFO L124 PetriNetUnfolderBase]: 295/1020 cut-off events. [2025-02-08 01:13:23,389 INFO L125 PetriNetUnfolderBase]: For 9588/9588 co-relation queries the response was YES. [2025-02-08 01:13:23,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5568 conditions, 1020 events. 295/1020 cut-off events. For 9588/9588 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8092 event pairs, 85 based on Foata normal form. 1/1020 useless extension candidates. Maximal degree in co-relation 5500. Up to 562 conditions per place. [2025-02-08 01:13:23,393 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 105 selfloop transitions, 14 changer transitions 10/130 dead transitions. [2025-02-08 01:13:23,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 130 transitions, 1685 flow [2025-02-08 01:13:23,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2025-02-08 01:13:23,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34459459459459457 [2025-02-08 01:13:23,394 INFO L175 Difference]: Start difference. First operand has 149 places, 94 transitions, 1238 flow. Second operand 8 states and 102 transitions. [2025-02-08 01:13:23,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 130 transitions, 1685 flow [2025-02-08 01:13:23,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 130 transitions, 1646 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-02-08 01:13:23,410 INFO L231 Difference]: Finished difference. Result has 149 places, 91 transitions, 1174 flow [2025-02-08 01:13:23,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1174, PETRI_PLACES=149, PETRI_TRANSITIONS=91} [2025-02-08 01:13:23,411 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 115 predicate places. [2025-02-08 01:13:23,411 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 91 transitions, 1174 flow [2025-02-08 01:13:23,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:23,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:23,411 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:23,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 01:13:23,411 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:23,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:23,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1857736831, now seen corresponding path program 25 times [2025-02-08 01:13:23,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:23,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752476555] [2025-02-08 01:13:23,412 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:13:23,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:23,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:13:23,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:23,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:23,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:23,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:23,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752476555] [2025-02-08 01:13:23,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752476555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:23,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:23,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:23,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964799670] [2025-02-08 01:13:23,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:23,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:23,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:23,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:23,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:23,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:23,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 91 transitions, 1174 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:23,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:23,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:23,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:23,921 INFO L124 PetriNetUnfolderBase]: 290/1002 cut-off events. [2025-02-08 01:13:23,921 INFO L125 PetriNetUnfolderBase]: For 9313/9313 co-relation queries the response was YES. [2025-02-08 01:13:23,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5451 conditions, 1002 events. 290/1002 cut-off events. For 9313/9313 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7892 event pairs, 85 based on Foata normal form. 1/1002 useless extension candidates. Maximal degree in co-relation 5385. Up to 562 conditions per place. [2025-02-08 01:13:23,927 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 100 selfloop transitions, 13 changer transitions 9/123 dead transitions. [2025-02-08 01:13:23,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 123 transitions, 1594 flow [2025-02-08 01:13:23,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2025-02-08 01:13:23,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3277027027027027 [2025-02-08 01:13:23,927 INFO L175 Difference]: Start difference. First operand has 149 places, 91 transitions, 1174 flow. Second operand 8 states and 97 transitions. [2025-02-08 01:13:23,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 123 transitions, 1594 flow [2025-02-08 01:13:23,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 123 transitions, 1556 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-08 01:13:23,943 INFO L231 Difference]: Finished difference. Result has 148 places, 89 transitions, 1126 flow [2025-02-08 01:13:23,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1126, PETRI_PLACES=148, PETRI_TRANSITIONS=89} [2025-02-08 01:13:23,944 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 114 predicate places. [2025-02-08 01:13:23,944 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 89 transitions, 1126 flow [2025-02-08 01:13:23,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:23,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:23,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:23,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 01:13:23,948 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:23,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:23,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1284556817, now seen corresponding path program 26 times [2025-02-08 01:13:23,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:23,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473376739] [2025-02-08 01:13:23,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:23,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:23,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:23,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:23,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:23,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:24,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:24,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473376739] [2025-02-08 01:13:24,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473376739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:24,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:24,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:24,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236317137] [2025-02-08 01:13:24,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:24,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:24,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:24,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:24,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:24,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:24,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 89 transitions, 1126 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:24,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:24,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:24,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:24,434 INFO L124 PetriNetUnfolderBase]: 286/987 cut-off events. [2025-02-08 01:13:24,434 INFO L125 PetriNetUnfolderBase]: For 9093/9093 co-relation queries the response was YES. [2025-02-08 01:13:24,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5356 conditions, 987 events. 286/987 cut-off events. For 9093/9093 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 7750 event pairs, 85 based on Foata normal form. 1/987 useless extension candidates. Maximal degree in co-relation 5291. Up to 562 conditions per place. [2025-02-08 01:13:24,439 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 90 selfloop transitions, 9 changer transitions 17/117 dead transitions. [2025-02-08 01:13:24,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 117 transitions, 1521 flow [2025-02-08 01:13:24,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2025-02-08 01:13:24,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3108108108108108 [2025-02-08 01:13:24,440 INFO L175 Difference]: Start difference. First operand has 148 places, 89 transitions, 1126 flow. Second operand 8 states and 92 transitions. [2025-02-08 01:13:24,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 117 transitions, 1521 flow [2025-02-08 01:13:24,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 117 transitions, 1478 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-02-08 01:13:24,456 INFO L231 Difference]: Finished difference. Result has 147 places, 84 transitions, 1013 flow [2025-02-08 01:13:24,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1013, PETRI_PLACES=147, PETRI_TRANSITIONS=84} [2025-02-08 01:13:24,457 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 113 predicate places. [2025-02-08 01:13:24,457 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 84 transitions, 1013 flow [2025-02-08 01:13:24,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:24,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:24,457 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:24,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 01:13:24,457 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:24,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:24,462 INFO L85 PathProgramCache]: Analyzing trace with hash 503061419, now seen corresponding path program 27 times [2025-02-08 01:13:24,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:24,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804287952] [2025-02-08 01:13:24,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:24,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:24,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:24,487 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:24,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:24,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:24,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:24,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804287952] [2025-02-08 01:13:24,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804287952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:24,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:24,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:24,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414171594] [2025-02-08 01:13:24,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:24,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:24,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:24,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:24,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:24,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:24,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 84 transitions, 1013 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:24,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:24,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:24,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:24,992 INFO L124 PetriNetUnfolderBase]: 283/988 cut-off events. [2025-02-08 01:13:24,992 INFO L125 PetriNetUnfolderBase]: For 8871/8871 co-relation queries the response was YES. [2025-02-08 01:13:24,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5296 conditions, 988 events. 283/988 cut-off events. For 8871/8871 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 7835 event pairs, 66 based on Foata normal form. 1/988 useless extension candidates. Maximal degree in co-relation 5232. Up to 488 conditions per place. [2025-02-08 01:13:24,997 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 101 selfloop transitions, 27 changer transitions 9/138 dead transitions. [2025-02-08 01:13:24,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 138 transitions, 1887 flow [2025-02-08 01:13:24,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:24,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2025-02-08 01:13:24,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33783783783783783 [2025-02-08 01:13:24,997 INFO L175 Difference]: Start difference. First operand has 147 places, 84 transitions, 1013 flow. Second operand 8 states and 100 transitions. [2025-02-08 01:13:24,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 138 transitions, 1887 flow [2025-02-08 01:13:25,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 138 transitions, 1827 flow, removed 17 selfloop flow, removed 6 redundant places. [2025-02-08 01:13:25,017 INFO L231 Difference]: Finished difference. Result has 141 places, 92 transitions, 1226 flow [2025-02-08 01:13:25,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1226, PETRI_PLACES=141, PETRI_TRANSITIONS=92} [2025-02-08 01:13:25,017 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 107 predicate places. [2025-02-08 01:13:25,017 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 92 transitions, 1226 flow [2025-02-08 01:13:25,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:25,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:25,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:25,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 01:13:25,018 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:25,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:25,018 INFO L85 PathProgramCache]: Analyzing trace with hash -397231677, now seen corresponding path program 28 times [2025-02-08 01:13:25,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:25,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648646364] [2025-02-08 01:13:25,018 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:25,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:25,028 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:25,048 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:25,048 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:25,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:25,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:25,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:25,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648646364] [2025-02-08 01:13:25,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648646364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:25,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:25,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:25,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541594901] [2025-02-08 01:13:25,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:25,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:25,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:25,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:25,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:25,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:25,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 92 transitions, 1226 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:25,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:25,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:25,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:25,565 INFO L124 PetriNetUnfolderBase]: 281/977 cut-off events. [2025-02-08 01:13:25,566 INFO L125 PetriNetUnfolderBase]: For 9699/9699 co-relation queries the response was YES. [2025-02-08 01:13:25,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5448 conditions, 977 events. 281/977 cut-off events. For 9699/9699 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7685 event pairs, 76 based on Foata normal form. 1/977 useless extension candidates. Maximal degree in co-relation 5383. Up to 488 conditions per place. [2025-02-08 01:13:25,570 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 108 selfloop transitions, 21 changer transitions 9/139 dead transitions. [2025-02-08 01:13:25,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 139 transitions, 1929 flow [2025-02-08 01:13:25,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2025-02-08 01:13:25,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3547297297297297 [2025-02-08 01:13:25,575 INFO L175 Difference]: Start difference. First operand has 141 places, 92 transitions, 1226 flow. Second operand 8 states and 105 transitions. [2025-02-08 01:13:25,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 139 transitions, 1929 flow [2025-02-08 01:13:25,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 139 transitions, 1876 flow, removed 22 selfloop flow, removed 3 redundant places. [2025-02-08 01:13:25,593 INFO L231 Difference]: Finished difference. Result has 149 places, 97 transitions, 1375 flow [2025-02-08 01:13:25,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1375, PETRI_PLACES=149, PETRI_TRANSITIONS=97} [2025-02-08 01:13:25,594 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 115 predicate places. [2025-02-08 01:13:25,594 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 97 transitions, 1375 flow [2025-02-08 01:13:25,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:25,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:25,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:25,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 01:13:25,594 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:25,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:25,595 INFO L85 PathProgramCache]: Analyzing trace with hash 10306539, now seen corresponding path program 29 times [2025-02-08 01:13:25,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:25,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788671929] [2025-02-08 01:13:25,595 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:13:25,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:25,603 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:25,621 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:25,622 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:13:25,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:25,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:25,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788671929] [2025-02-08 01:13:25,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788671929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:25,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:25,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:25,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863699442] [2025-02-08 01:13:25,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:25,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:25,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:25,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:25,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:25,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:25,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 97 transitions, 1375 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:25,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:25,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:25,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:26,186 INFO L124 PetriNetUnfolderBase]: 278/964 cut-off events. [2025-02-08 01:13:26,186 INFO L125 PetriNetUnfolderBase]: For 10220/10220 co-relation queries the response was YES. [2025-02-08 01:13:26,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5478 conditions, 964 events. 278/964 cut-off events. For 10220/10220 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7555 event pairs, 66 based on Foata normal form. 1/964 useless extension candidates. Maximal degree in co-relation 5410. Up to 488 conditions per place. [2025-02-08 01:13:26,192 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 96 selfloop transitions, 30 changer transitions 11/138 dead transitions. [2025-02-08 01:13:26,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 138 transitions, 2001 flow [2025-02-08 01:13:26,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2025-02-08 01:13:26,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33783783783783783 [2025-02-08 01:13:26,193 INFO L175 Difference]: Start difference. First operand has 149 places, 97 transitions, 1375 flow. Second operand 8 states and 100 transitions. [2025-02-08 01:13:26,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 138 transitions, 2001 flow [2025-02-08 01:13:26,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 138 transitions, 1957 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:26,214 INFO L231 Difference]: Finished difference. Result has 153 places, 99 transitions, 1433 flow [2025-02-08 01:13:26,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1339, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1433, PETRI_PLACES=153, PETRI_TRANSITIONS=99} [2025-02-08 01:13:26,214 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 119 predicate places. [2025-02-08 01:13:26,214 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 99 transitions, 1433 flow [2025-02-08 01:13:26,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:26,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:26,215 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:26,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 01:13:26,215 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:26,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1713388981, now seen corresponding path program 30 times [2025-02-08 01:13:26,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:26,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339589195] [2025-02-08 01:13:26,215 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:13:26,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:26,225 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:26,232 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:26,232 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:13:26,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:26,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:26,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339589195] [2025-02-08 01:13:26,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339589195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:26,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:26,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:26,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111355769] [2025-02-08 01:13:26,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:26,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:26,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:26,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:26,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:26,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:26,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 99 transitions, 1433 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:26,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:26,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:26,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:26,749 INFO L124 PetriNetUnfolderBase]: 274/950 cut-off events. [2025-02-08 01:13:26,750 INFO L125 PetriNetUnfolderBase]: For 10456/10456 co-relation queries the response was YES. [2025-02-08 01:13:26,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5452 conditions, 950 events. 274/950 cut-off events. For 10456/10456 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7432 event pairs, 65 based on Foata normal form. 1/950 useless extension candidates. Maximal degree in co-relation 5384. Up to 488 conditions per place. [2025-02-08 01:13:26,755 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 92 selfloop transitions, 25 changer transitions 13/131 dead transitions. [2025-02-08 01:13:26,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 131 transitions, 1952 flow [2025-02-08 01:13:26,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2025-02-08 01:13:26,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32094594594594594 [2025-02-08 01:13:26,756 INFO L175 Difference]: Start difference. First operand has 153 places, 99 transitions, 1433 flow. Second operand 8 states and 95 transitions. [2025-02-08 01:13:26,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 131 transitions, 1952 flow [2025-02-08 01:13:26,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 131 transitions, 1900 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:26,776 INFO L231 Difference]: Finished difference. Result has 154 places, 96 transitions, 1366 flow [2025-02-08 01:13:26,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1366, PETRI_PLACES=154, PETRI_TRANSITIONS=96} [2025-02-08 01:13:26,777 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 120 predicate places. [2025-02-08 01:13:26,777 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 96 transitions, 1366 flow [2025-02-08 01:13:26,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:26,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:26,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:26,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-08 01:13:26,777 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:26,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:26,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1495195383, now seen corresponding path program 31 times [2025-02-08 01:13:26,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:26,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481078565] [2025-02-08 01:13:26,778 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:13:26,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:26,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:13:26,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:26,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:26,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:26,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:26,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481078565] [2025-02-08 01:13:26,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481078565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:26,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:26,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:26,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733047945] [2025-02-08 01:13:26,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:26,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:26,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:26,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:26,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:26,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:26,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 96 transitions, 1366 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:26,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:26,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:26,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:27,248 INFO L124 PetriNetUnfolderBase]: 270/934 cut-off events. [2025-02-08 01:13:27,248 INFO L125 PetriNetUnfolderBase]: For 9771/9771 co-relation queries the response was YES. [2025-02-08 01:13:27,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5381 conditions, 934 events. 270/934 cut-off events. For 9771/9771 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7218 event pairs, 81 based on Foata normal form. 1/934 useless extension candidates. Maximal degree in co-relation 5314. Up to 488 conditions per place. [2025-02-08 01:13:27,252 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 101 selfloop transitions, 23 changer transitions 8/133 dead transitions. [2025-02-08 01:13:27,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 133 transitions, 1883 flow [2025-02-08 01:13:27,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2025-02-08 01:13:27,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34459459459459457 [2025-02-08 01:13:27,253 INFO L175 Difference]: Start difference. First operand has 154 places, 96 transitions, 1366 flow. Second operand 8 states and 102 transitions. [2025-02-08 01:13:27,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 133 transitions, 1883 flow [2025-02-08 01:13:27,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 133 transitions, 1828 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:27,270 INFO L231 Difference]: Finished difference. Result has 154 places, 97 transitions, 1397 flow [2025-02-08 01:13:27,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1397, PETRI_PLACES=154, PETRI_TRANSITIONS=97} [2025-02-08 01:13:27,271 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 120 predicate places. [2025-02-08 01:13:27,271 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 97 transitions, 1397 flow [2025-02-08 01:13:27,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:27,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:27,271 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:27,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-08 01:13:27,271 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:27,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:27,271 INFO L85 PathProgramCache]: Analyzing trace with hash 659659971, now seen corresponding path program 32 times [2025-02-08 01:13:27,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:27,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522047189] [2025-02-08 01:13:27,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:27,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:27,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:27,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:27,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:27,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:27,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:27,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522047189] [2025-02-08 01:13:27,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522047189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:27,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:27,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:27,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994941112] [2025-02-08 01:13:27,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:27,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:27,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:27,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:27,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:27,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:27,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 97 transitions, 1397 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:27,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:27,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:27,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:27,755 INFO L124 PetriNetUnfolderBase]: 267/924 cut-off events. [2025-02-08 01:13:27,755 INFO L125 PetriNetUnfolderBase]: For 9509/9509 co-relation queries the response was YES. [2025-02-08 01:13:27,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5361 conditions, 924 events. 267/924 cut-off events. For 9509/9509 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7131 event pairs, 81 based on Foata normal form. 1/924 useless extension candidates. Maximal degree in co-relation 5293. Up to 488 conditions per place. [2025-02-08 01:13:27,759 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 93 selfloop transitions, 21 changer transitions 16/131 dead transitions. [2025-02-08 01:13:27,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 131 transitions, 1881 flow [2025-02-08 01:13:27,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2025-02-08 01:13:27,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33783783783783783 [2025-02-08 01:13:27,762 INFO L175 Difference]: Start difference. First operand has 154 places, 97 transitions, 1397 flow. Second operand 8 states and 100 transitions. [2025-02-08 01:13:27,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 131 transitions, 1881 flow [2025-02-08 01:13:27,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 131 transitions, 1842 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:27,780 INFO L231 Difference]: Finished difference. Result has 158 places, 95 transitions, 1352 flow [2025-02-08 01:13:27,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1362, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1352, PETRI_PLACES=158, PETRI_TRANSITIONS=95} [2025-02-08 01:13:27,781 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 124 predicate places. [2025-02-08 01:13:27,781 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 95 transitions, 1352 flow [2025-02-08 01:13:27,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:27,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:27,781 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:27,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-08 01:13:27,781 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:27,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:27,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1819218723, now seen corresponding path program 33 times [2025-02-08 01:13:27,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:27,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498153003] [2025-02-08 01:13:27,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:27,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:27,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:27,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:27,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:27,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:27,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:27,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498153003] [2025-02-08 01:13:27,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498153003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:27,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:27,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:27,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9006526] [2025-02-08 01:13:27,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:27,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:27,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:27,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:27,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:27,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:27,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 95 transitions, 1352 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:27,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:27,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:27,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:28,297 INFO L124 PetriNetUnfolderBase]: 259/899 cut-off events. [2025-02-08 01:13:28,297 INFO L125 PetriNetUnfolderBase]: For 9118/9118 co-relation queries the response was YES. [2025-02-08 01:13:28,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5195 conditions, 899 events. 259/899 cut-off events. For 9118/9118 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6869 event pairs, 75 based on Foata normal form. 1/899 useless extension candidates. Maximal degree in co-relation 5126. Up to 488 conditions per place. [2025-02-08 01:13:28,301 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 104 selfloop transitions, 17 changer transitions 10/132 dead transitions. [2025-02-08 01:13:28,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 132 transitions, 1860 flow [2025-02-08 01:13:28,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:28,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-02-08 01:13:28,303 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34797297297297297 [2025-02-08 01:13:28,303 INFO L175 Difference]: Start difference. First operand has 158 places, 95 transitions, 1352 flow. Second operand 8 states and 103 transitions. [2025-02-08 01:13:28,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 132 transitions, 1860 flow [2025-02-08 01:13:28,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 132 transitions, 1812 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-02-08 01:13:28,321 INFO L231 Difference]: Finished difference. Result has 156 places, 95 transitions, 1360 flow [2025-02-08 01:13:28,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1360, PETRI_PLACES=156, PETRI_TRANSITIONS=95} [2025-02-08 01:13:28,322 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 122 predicate places. [2025-02-08 01:13:28,323 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 95 transitions, 1360 flow [2025-02-08 01:13:28,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:28,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:28,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:28,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-08 01:13:28,323 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:28,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:28,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1235293597, now seen corresponding path program 34 times [2025-02-08 01:13:28,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:28,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191112111] [2025-02-08 01:13:28,323 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:28,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:28,337 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:28,352 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:28,352 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:28,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:28,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:28,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:28,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191112111] [2025-02-08 01:13:28,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191112111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:28,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:28,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:28,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118888581] [2025-02-08 01:13:28,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:28,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:28,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:28,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:28,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:28,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:28,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 95 transitions, 1360 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:28,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:28,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:28,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:28,937 INFO L124 PetriNetUnfolderBase]: 256/885 cut-off events. [2025-02-08 01:13:28,937 INFO L125 PetriNetUnfolderBase]: For 9034/9034 co-relation queries the response was YES. [2025-02-08 01:13:28,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5119 conditions, 885 events. 256/885 cut-off events. For 9034/9034 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6725 event pairs, 75 based on Foata normal form. 1/885 useless extension candidates. Maximal degree in co-relation 5051. Up to 488 conditions per place. [2025-02-08 01:13:28,946 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 100 selfloop transitions, 17 changer transitions 9/127 dead transitions. [2025-02-08 01:13:28,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 127 transitions, 1789 flow [2025-02-08 01:13:28,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:28,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2025-02-08 01:13:28,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34121621621621623 [2025-02-08 01:13:28,950 INFO L175 Difference]: Start difference. First operand has 156 places, 95 transitions, 1360 flow. Second operand 8 states and 101 transitions. [2025-02-08 01:13:28,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 127 transitions, 1789 flow [2025-02-08 01:13:28,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 127 transitions, 1749 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-02-08 01:13:28,972 INFO L231 Difference]: Finished difference. Result has 157 places, 93 transitions, 1320 flow [2025-02-08 01:13:28,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1326, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1320, PETRI_PLACES=157, PETRI_TRANSITIONS=93} [2025-02-08 01:13:28,972 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 123 predicate places. [2025-02-08 01:13:28,972 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 93 transitions, 1320 flow [2025-02-08 01:13:28,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:28,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:28,973 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:28,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-08 01:13:28,974 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:28,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:28,974 INFO L85 PathProgramCache]: Analyzing trace with hash 409166081, now seen corresponding path program 35 times [2025-02-08 01:13:28,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:28,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126507359] [2025-02-08 01:13:28,974 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:13:28,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:28,986 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:29,000 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:29,000 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:13:29,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:29,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:29,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126507359] [2025-02-08 01:13:29,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126507359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:29,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:29,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:29,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700317704] [2025-02-08 01:13:29,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:29,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:29,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:29,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:29,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:29,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:29,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 93 transitions, 1320 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:29,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:29,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:29,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:29,481 INFO L124 PetriNetUnfolderBase]: 252/871 cut-off events. [2025-02-08 01:13:29,483 INFO L125 PetriNetUnfolderBase]: For 8824/8824 co-relation queries the response was YES. [2025-02-08 01:13:29,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5036 conditions, 871 events. 252/871 cut-off events. For 8824/8824 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6584 event pairs, 76 based on Foata normal form. 1/871 useless extension candidates. Maximal degree in co-relation 4969. Up to 488 conditions per place. [2025-02-08 01:13:29,487 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 95 selfloop transitions, 15 changer transitions 13/124 dead transitions. [2025-02-08 01:13:29,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 124 transitions, 1760 flow [2025-02-08 01:13:29,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2025-02-08 01:13:29,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3344594594594595 [2025-02-08 01:13:29,488 INFO L175 Difference]: Start difference. First operand has 157 places, 93 transitions, 1320 flow. Second operand 8 states and 99 transitions. [2025-02-08 01:13:29,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 124 transitions, 1760 flow [2025-02-08 01:13:29,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 124 transitions, 1718 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:29,507 INFO L231 Difference]: Finished difference. Result has 160 places, 92 transitions, 1299 flow [2025-02-08 01:13:29,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1299, PETRI_PLACES=160, PETRI_TRANSITIONS=92} [2025-02-08 01:13:29,507 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 126 predicate places. [2025-02-08 01:13:29,508 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 92 transitions, 1299 flow [2025-02-08 01:13:29,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:29,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:29,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:29,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-08 01:13:29,508 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:29,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:29,508 INFO L85 PathProgramCache]: Analyzing trace with hash -746701239, now seen corresponding path program 36 times [2025-02-08 01:13:29,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:29,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950126929] [2025-02-08 01:13:29,509 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:13:29,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:29,517 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:29,522 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:29,522 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:13:29,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:29,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:29,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950126929] [2025-02-08 01:13:29,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950126929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:29,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:29,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:29,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023182438] [2025-02-08 01:13:29,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:29,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:29,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:29,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:29,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:29,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:29,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 92 transitions, 1299 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:29,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:29,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:29,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:29,951 INFO L124 PetriNetUnfolderBase]: 246/851 cut-off events. [2025-02-08 01:13:29,951 INFO L125 PetriNetUnfolderBase]: For 8556/8556 co-relation queries the response was YES. [2025-02-08 01:13:29,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4892 conditions, 851 events. 246/851 cut-off events. For 8556/8556 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6382 event pairs, 74 based on Foata normal form. 1/851 useless extension candidates. Maximal degree in co-relation 4824. Up to 488 conditions per place. [2025-02-08 01:13:29,955 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 96 selfloop transitions, 15 changer transitions 9/121 dead transitions. [2025-02-08 01:13:29,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 121 transitions, 1686 flow [2025-02-08 01:13:29,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2025-02-08 01:13:29,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3277027027027027 [2025-02-08 01:13:29,956 INFO L175 Difference]: Start difference. First operand has 160 places, 92 transitions, 1299 flow. Second operand 8 states and 97 transitions. [2025-02-08 01:13:29,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 121 transitions, 1686 flow [2025-02-08 01:13:29,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 121 transitions, 1634 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-02-08 01:13:29,975 INFO L231 Difference]: Finished difference. Result has 159 places, 91 transitions, 1257 flow [2025-02-08 01:13:29,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1251, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1257, PETRI_PLACES=159, PETRI_TRANSITIONS=91} [2025-02-08 01:13:29,975 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 125 predicate places. [2025-02-08 01:13:29,976 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 91 transitions, 1257 flow [2025-02-08 01:13:29,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:29,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:29,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:29,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-08 01:13:29,976 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:29,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:29,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1319881253, now seen corresponding path program 37 times [2025-02-08 01:13:29,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:29,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138774491] [2025-02-08 01:13:29,977 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:13:29,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:29,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:13:29,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:29,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:29,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:30,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:30,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138774491] [2025-02-08 01:13:30,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138774491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:30,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:30,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:30,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032636944] [2025-02-08 01:13:30,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:30,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:30,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:30,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:30,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:30,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:30,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 91 transitions, 1257 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:30,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:30,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:30,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:30,423 INFO L124 PetriNetUnfolderBase]: 244/840 cut-off events. [2025-02-08 01:13:30,423 INFO L125 PetriNetUnfolderBase]: For 8242/8242 co-relation queries the response was YES. [2025-02-08 01:13:30,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4776 conditions, 840 events. 244/840 cut-off events. For 8242/8242 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6257 event pairs, 74 based on Foata normal form. 1/840 useless extension candidates. Maximal degree in co-relation 4709. Up to 488 conditions per place. [2025-02-08 01:13:30,428 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 84 selfloop transitions, 10 changer transitions 20/115 dead transitions. [2025-02-08 01:13:30,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 115 transitions, 1599 flow [2025-02-08 01:13:30,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:30,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2025-02-08 01:13:30,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3108108108108108 [2025-02-08 01:13:30,430 INFO L175 Difference]: Start difference. First operand has 159 places, 91 transitions, 1257 flow. Second operand 8 states and 92 transitions. [2025-02-08 01:13:30,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 115 transitions, 1599 flow [2025-02-08 01:13:30,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 115 transitions, 1569 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-08 01:13:30,447 INFO L231 Difference]: Finished difference. Result has 159 places, 85 transitions, 1119 flow [2025-02-08 01:13:30,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1119, PETRI_PLACES=159, PETRI_TRANSITIONS=85} [2025-02-08 01:13:30,448 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 125 predicate places. [2025-02-08 01:13:30,448 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 85 transitions, 1119 flow [2025-02-08 01:13:30,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:30,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:30,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:30,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-08 01:13:30,448 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:30,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:30,449 INFO L85 PathProgramCache]: Analyzing trace with hash 176235517, now seen corresponding path program 38 times [2025-02-08 01:13:30,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:30,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264619923] [2025-02-08 01:13:30,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:30,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:30,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:30,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:30,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:30,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:30,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:30,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264619923] [2025-02-08 01:13:30,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264619923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:30,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:30,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:30,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793859987] [2025-02-08 01:13:30,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:30,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:30,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:30,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:30,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:30,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:30,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 85 transitions, 1119 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:30,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:30,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:30,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:30,880 INFO L124 PetriNetUnfolderBase]: 222/777 cut-off events. [2025-02-08 01:13:30,880 INFO L125 PetriNetUnfolderBase]: For 7220/7220 co-relation queries the response was YES. [2025-02-08 01:13:30,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4329 conditions, 777 events. 222/777 cut-off events. For 7220/7220 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5775 event pairs, 42 based on Foata normal form. 1/777 useless extension candidates. Maximal degree in co-relation 4263. Up to 251 conditions per place. [2025-02-08 01:13:30,884 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 90 selfloop transitions, 22 changer transitions 15/128 dead transitions. [2025-02-08 01:13:30,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 128 transitions, 1641 flow [2025-02-08 01:13:30,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2025-02-08 01:13:30,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2025-02-08 01:13:30,885 INFO L175 Difference]: Start difference. First operand has 159 places, 85 transitions, 1119 flow. Second operand 8 states and 104 transitions. [2025-02-08 01:13:30,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 128 transitions, 1641 flow [2025-02-08 01:13:30,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 128 transitions, 1567 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-02-08 01:13:30,900 INFO L231 Difference]: Finished difference. Result has 149 places, 86 transitions, 1136 flow [2025-02-08 01:13:30,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1136, PETRI_PLACES=149, PETRI_TRANSITIONS=86} [2025-02-08 01:13:30,901 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 115 predicate places. [2025-02-08 01:13:30,901 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 86 transitions, 1136 flow [2025-02-08 01:13:30,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:30,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:30,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:30,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-08 01:13:30,901 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:30,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:30,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1712735127, now seen corresponding path program 39 times [2025-02-08 01:13:30,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:30,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569672991] [2025-02-08 01:13:30,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:30,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:30,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:30,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:30,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:30,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:31,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:31,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:31,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569672991] [2025-02-08 01:13:31,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569672991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:31,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:31,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:31,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830943318] [2025-02-08 01:13:31,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:31,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:31,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:31,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:31,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:31,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:31,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 86 transitions, 1136 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:31,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:31,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:31,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:31,382 INFO L124 PetriNetUnfolderBase]: 212/750 cut-off events. [2025-02-08 01:13:31,382 INFO L125 PetriNetUnfolderBase]: For 7053/7053 co-relation queries the response was YES. [2025-02-08 01:13:31,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4280 conditions, 750 events. 212/750 cut-off events. For 7053/7053 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5519 event pairs, 39 based on Foata normal form. 1/750 useless extension candidates. Maximal degree in co-relation 4216. Up to 391 conditions per place. [2025-02-08 01:13:31,385 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 92 selfloop transitions, 20 changer transitions 8/121 dead transitions. [2025-02-08 01:13:31,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 121 transitions, 1579 flow [2025-02-08 01:13:31,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2025-02-08 01:13:31,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34121621621621623 [2025-02-08 01:13:31,386 INFO L175 Difference]: Start difference. First operand has 149 places, 86 transitions, 1136 flow. Second operand 8 states and 101 transitions. [2025-02-08 01:13:31,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 121 transitions, 1579 flow [2025-02-08 01:13:31,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 121 transitions, 1537 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-02-08 01:13:31,397 INFO L231 Difference]: Finished difference. Result has 154 places, 86 transitions, 1157 flow [2025-02-08 01:13:31,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1100, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1157, PETRI_PLACES=154, PETRI_TRANSITIONS=86} [2025-02-08 01:13:31,398 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 120 predicate places. [2025-02-08 01:13:31,398 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 86 transitions, 1157 flow [2025-02-08 01:13:31,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:31,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:31,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:31,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-08 01:13:31,399 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:31,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:31,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1131511543, now seen corresponding path program 40 times [2025-02-08 01:13:31,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:31,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290109388] [2025-02-08 01:13:31,399 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:31,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:31,408 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:31,416 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:31,416 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:31,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:31,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:31,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290109388] [2025-02-08 01:13:31,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290109388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:31,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:31,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:31,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049796492] [2025-02-08 01:13:31,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:31,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:31,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:31,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:31,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:31,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:31,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 86 transitions, 1157 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:31,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:31,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:31,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:31,874 INFO L124 PetriNetUnfolderBase]: 208/735 cut-off events. [2025-02-08 01:13:31,875 INFO L125 PetriNetUnfolderBase]: For 7268/7268 co-relation queries the response was YES. [2025-02-08 01:13:31,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4272 conditions, 735 events. 208/735 cut-off events. For 7268/7268 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5374 event pairs, 39 based on Foata normal form. 1/735 useless extension candidates. Maximal degree in co-relation 4206. Up to 391 conditions per place. [2025-02-08 01:13:31,879 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 83 selfloop transitions, 17 changer transitions 14/115 dead transitions. [2025-02-08 01:13:31,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 115 transitions, 1532 flow [2025-02-08 01:13:31,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:31,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2025-02-08 01:13:31,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32432432432432434 [2025-02-08 01:13:31,879 INFO L175 Difference]: Start difference. First operand has 154 places, 86 transitions, 1157 flow. Second operand 8 states and 96 transitions. [2025-02-08 01:13:31,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 115 transitions, 1532 flow [2025-02-08 01:13:31,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 115 transitions, 1492 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:31,893 INFO L231 Difference]: Finished difference. Result has 157 places, 83 transitions, 1079 flow [2025-02-08 01:13:31,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1119, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1079, PETRI_PLACES=157, PETRI_TRANSITIONS=83} [2025-02-08 01:13:31,893 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 123 predicate places. [2025-02-08 01:13:31,893 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 83 transitions, 1079 flow [2025-02-08 01:13:31,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:31,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:31,894 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:31,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-08 01:13:31,894 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:31,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:31,894 INFO L85 PathProgramCache]: Analyzing trace with hash -958263851, now seen corresponding path program 41 times [2025-02-08 01:13:31,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:31,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469922116] [2025-02-08 01:13:31,895 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:13:31,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:31,903 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:31,910 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:31,910 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:13:31,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:32,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:32,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469922116] [2025-02-08 01:13:32,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469922116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:32,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:32,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:32,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061248701] [2025-02-08 01:13:32,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:32,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:32,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:32,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:32,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:32,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:32,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 83 transitions, 1079 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:32,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:32,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:32,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:32,332 INFO L124 PetriNetUnfolderBase]: 202/714 cut-off events. [2025-02-08 01:13:32,333 INFO L125 PetriNetUnfolderBase]: For 6838/6838 co-relation queries the response was YES. [2025-02-08 01:13:32,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4123 conditions, 714 events. 202/714 cut-off events. For 6838/6838 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5183 event pairs, 39 based on Foata normal form. 1/714 useless extension candidates. Maximal degree in co-relation 4057. Up to 432 conditions per place. [2025-02-08 01:13:32,337 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 78 selfloop transitions, 15 changer transitions 16/110 dead transitions. [2025-02-08 01:13:32,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 110 transitions, 1452 flow [2025-02-08 01:13:32,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:32,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2025-02-08 01:13:32,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3277027027027027 [2025-02-08 01:13:32,338 INFO L175 Difference]: Start difference. First operand has 157 places, 83 transitions, 1079 flow. Second operand 8 states and 97 transitions. [2025-02-08 01:13:32,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 110 transitions, 1452 flow [2025-02-08 01:13:32,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 110 transitions, 1402 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-08 01:13:32,350 INFO L231 Difference]: Finished difference. Result has 154 places, 78 transitions, 969 flow [2025-02-08 01:13:32,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=969, PETRI_PLACES=154, PETRI_TRANSITIONS=78} [2025-02-08 01:13:32,351 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 120 predicate places. [2025-02-08 01:13:32,351 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 78 transitions, 969 flow [2025-02-08 01:13:32,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:32,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:32,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:32,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-08 01:13:32,351 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:32,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:32,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1708040635, now seen corresponding path program 42 times [2025-02-08 01:13:32,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:32,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005345427] [2025-02-08 01:13:32,352 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:13:32,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:32,361 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:32,366 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:32,366 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:13:32,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:32,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:32,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005345427] [2025-02-08 01:13:32,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005345427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:32,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:32,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:32,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65997744] [2025-02-08 01:13:32,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:32,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:32,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:32,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:32,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:32,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:32,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 78 transitions, 969 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:32,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:32,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:32,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:32,761 INFO L124 PetriNetUnfolderBase]: 193/682 cut-off events. [2025-02-08 01:13:32,761 INFO L125 PetriNetUnfolderBase]: For 6116/6116 co-relation queries the response was YES. [2025-02-08 01:13:32,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3906 conditions, 682 events. 193/682 cut-off events. For 6116/6116 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4888 event pairs, 49 based on Foata normal form. 1/682 useless extension candidates. Maximal degree in co-relation 3857. Up to 301 conditions per place. [2025-02-08 01:13:32,765 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 87 selfloop transitions, 17 changer transitions 8/113 dead transitions. [2025-02-08 01:13:32,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 113 transitions, 1384 flow [2025-02-08 01:13:32,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:32,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2025-02-08 01:13:32,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34459459459459457 [2025-02-08 01:13:32,766 INFO L175 Difference]: Start difference. First operand has 154 places, 78 transitions, 969 flow. Second operand 8 states and 102 transitions. [2025-02-08 01:13:32,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 113 transitions, 1384 flow [2025-02-08 01:13:32,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 113 transitions, 1322 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-02-08 01:13:32,776 INFO L231 Difference]: Finished difference. Result has 151 places, 77 transitions, 945 flow [2025-02-08 01:13:32,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=945, PETRI_PLACES=151, PETRI_TRANSITIONS=77} [2025-02-08 01:13:32,777 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 117 predicate places. [2025-02-08 01:13:32,777 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 77 transitions, 945 flow [2025-02-08 01:13:32,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:32,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:32,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:32,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-08 01:13:32,777 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:32,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:32,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1014659217, now seen corresponding path program 43 times [2025-02-08 01:13:32,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:32,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135042885] [2025-02-08 01:13:32,778 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:13:32,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:32,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:13:32,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:32,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:32,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:32,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:32,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:32,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135042885] [2025-02-08 01:13:32,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135042885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:32,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:32,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:32,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595382007] [2025-02-08 01:13:32,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:32,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:32,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:32,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:32,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:32,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:32,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 77 transitions, 945 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:32,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:32,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:32,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:33,281 INFO L124 PetriNetUnfolderBase]: 189/668 cut-off events. [2025-02-08 01:13:33,281 INFO L125 PetriNetUnfolderBase]: For 5610/5610 co-relation queries the response was YES. [2025-02-08 01:13:33,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3787 conditions, 668 events. 189/668 cut-off events. For 5610/5610 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4776 event pairs, 37 based on Foata normal form. 1/668 useless extension candidates. Maximal degree in co-relation 3740. Up to 226 conditions per place. [2025-02-08 01:13:33,285 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 97 selfloop transitions, 14 changer transitions 8/120 dead transitions. [2025-02-08 01:13:33,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 120 transitions, 1430 flow [2025-02-08 01:13:33,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2025-02-08 01:13:33,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3581081081081081 [2025-02-08 01:13:33,285 INFO L175 Difference]: Start difference. First operand has 151 places, 77 transitions, 945 flow. Second operand 8 states and 106 transitions. [2025-02-08 01:13:33,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 120 transitions, 1430 flow [2025-02-08 01:13:33,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 120 transitions, 1373 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-02-08 01:13:33,296 INFO L231 Difference]: Finished difference. Result has 152 places, 76 transitions, 922 flow [2025-02-08 01:13:33,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=922, PETRI_PLACES=152, PETRI_TRANSITIONS=76} [2025-02-08 01:13:33,296 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 118 predicate places. [2025-02-08 01:13:33,296 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 76 transitions, 922 flow [2025-02-08 01:13:33,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:33,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:33,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:33,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-08 01:13:33,297 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:33,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:33,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1791157525, now seen corresponding path program 44 times [2025-02-08 01:13:33,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:33,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34255570] [2025-02-08 01:13:33,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:33,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:33,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:33,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:33,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:33,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:33,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:33,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:33,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34255570] [2025-02-08 01:13:33,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34255570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:33,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:33,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:33,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3373851] [2025-02-08 01:13:33,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:33,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:33,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:33,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:33,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:33,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:33,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 76 transitions, 922 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:33,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:33,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:33,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:33,705 INFO L124 PetriNetUnfolderBase]: 187/657 cut-off events. [2025-02-08 01:13:33,705 INFO L125 PetriNetUnfolderBase]: For 5421/5421 co-relation queries the response was YES. [2025-02-08 01:13:33,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3681 conditions, 657 events. 187/657 cut-off events. For 5421/5421 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4657 event pairs, 49 based on Foata normal form. 1/657 useless extension candidates. Maximal degree in co-relation 3634. Up to 294 conditions per place. [2025-02-08 01:13:33,709 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 75 selfloop transitions, 14 changer transitions 17/107 dead transitions. [2025-02-08 01:13:33,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 107 transitions, 1288 flow [2025-02-08 01:13:33,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2025-02-08 01:13:33,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3310810810810811 [2025-02-08 01:13:33,714 INFO L175 Difference]: Start difference. First operand has 152 places, 76 transitions, 922 flow. Second operand 8 states and 98 transitions. [2025-02-08 01:13:33,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 107 transitions, 1288 flow [2025-02-08 01:13:33,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 107 transitions, 1247 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-02-08 01:13:33,724 INFO L231 Difference]: Finished difference. Result has 153 places, 73 transitions, 860 flow [2025-02-08 01:13:33,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=860, PETRI_PLACES=153, PETRI_TRANSITIONS=73} [2025-02-08 01:13:33,724 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 119 predicate places. [2025-02-08 01:13:33,724 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 73 transitions, 860 flow [2025-02-08 01:13:33,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:33,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:33,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:33,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-08 01:13:33,725 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:33,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:33,725 INFO L85 PathProgramCache]: Analyzing trace with hash 433435633, now seen corresponding path program 45 times [2025-02-08 01:13:33,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:33,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110036482] [2025-02-08 01:13:33,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:33,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:33,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:33,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:33,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:33,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:33,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:33,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110036482] [2025-02-08 01:13:33,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110036482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:33,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:33,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:33,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934766904] [2025-02-08 01:13:33,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:33,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:33,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:33,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:33,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:33,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:33,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 73 transitions, 860 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:33,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:33,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:33,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:34,139 INFO L124 PetriNetUnfolderBase]: 177/628 cut-off events. [2025-02-08 01:13:34,139 INFO L125 PetriNetUnfolderBase]: For 5155/5155 co-relation queries the response was YES. [2025-02-08 01:13:34,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3472 conditions, 628 events. 177/628 cut-off events. For 5155/5155 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4395 event pairs, 35 based on Foata normal form. 1/628 useless extension candidates. Maximal degree in co-relation 3425. Up to 211 conditions per place. [2025-02-08 01:13:34,142 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 83 selfloop transitions, 11 changer transitions 16/111 dead transitions. [2025-02-08 01:13:34,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 111 transitions, 1287 flow [2025-02-08 01:13:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2025-02-08 01:13:34,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34121621621621623 [2025-02-08 01:13:34,143 INFO L175 Difference]: Start difference. First operand has 153 places, 73 transitions, 860 flow. Second operand 8 states and 101 transitions. [2025-02-08 01:13:34,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 111 transitions, 1287 flow [2025-02-08 01:13:34,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 111 transitions, 1218 flow, removed 10 selfloop flow, removed 9 redundant places. [2025-02-08 01:13:34,151 INFO L231 Difference]: Finished difference. Result has 145 places, 70 transitions, 770 flow [2025-02-08 01:13:34,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=770, PETRI_PLACES=145, PETRI_TRANSITIONS=70} [2025-02-08 01:13:34,153 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 111 predicate places. [2025-02-08 01:13:34,153 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 70 transitions, 770 flow [2025-02-08 01:13:34,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:34,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:34,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:34,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-08 01:13:34,153 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:34,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:34,154 INFO L85 PathProgramCache]: Analyzing trace with hash 775016879, now seen corresponding path program 46 times [2025-02-08 01:13:34,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:34,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725269977] [2025-02-08 01:13:34,154 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:34,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:34,163 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:34,170 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:34,170 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:34,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:34,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:34,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725269977] [2025-02-08 01:13:34,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725269977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:34,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:34,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:34,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336572023] [2025-02-08 01:13:34,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:34,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:34,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:34,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:34,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:34,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:34,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 70 transitions, 770 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:34,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:34,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:34,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:34,632 INFO L124 PetriNetUnfolderBase]: 169/603 cut-off events. [2025-02-08 01:13:34,632 INFO L125 PetriNetUnfolderBase]: For 4380/4380 co-relation queries the response was YES. [2025-02-08 01:13:34,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3258 conditions, 603 events. 169/603 cut-off events. For 4380/4380 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4165 event pairs, 40 based on Foata normal form. 1/603 useless extension candidates. Maximal degree in co-relation 3215. Up to 259 conditions per place. [2025-02-08 01:13:34,636 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 88 selfloop transitions, 13 changer transitions 8/110 dead transitions. [2025-02-08 01:13:34,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 110 transitions, 1235 flow [2025-02-08 01:13:34,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2025-02-08 01:13:34,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2025-02-08 01:13:34,637 INFO L175 Difference]: Start difference. First operand has 145 places, 70 transitions, 770 flow. Second operand 8 states and 104 transitions. [2025-02-08 01:13:34,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 110 transitions, 1235 flow [2025-02-08 01:13:34,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 110 transitions, 1138 flow, removed 10 selfloop flow, removed 11 redundant places. [2025-02-08 01:13:34,644 INFO L231 Difference]: Finished difference. Result has 136 places, 71 transitions, 750 flow [2025-02-08 01:13:34,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=750, PETRI_PLACES=136, PETRI_TRANSITIONS=71} [2025-02-08 01:13:34,644 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 102 predicate places. [2025-02-08 01:13:34,644 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 71 transitions, 750 flow [2025-02-08 01:13:34,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:34,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:34,645 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:34,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-08 01:13:34,645 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:34,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:34,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2015471855, now seen corresponding path program 47 times [2025-02-08 01:13:34,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:34,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348537758] [2025-02-08 01:13:34,645 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:13:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:34,654 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:34,669 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:34,669 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:13:34,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:34,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:34,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348537758] [2025-02-08 01:13:34,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348537758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:34,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:34,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:34,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643869192] [2025-02-08 01:13:34,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:34,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:34,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:34,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:34,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:34,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:34,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 71 transitions, 750 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:34,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:34,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:34,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:35,142 INFO L124 PetriNetUnfolderBase]: 167/592 cut-off events. [2025-02-08 01:13:35,142 INFO L125 PetriNetUnfolderBase]: For 3489/3489 co-relation queries the response was YES. [2025-02-08 01:13:35,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 592 events. 167/592 cut-off events. For 3489/3489 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4042 event pairs, 41 based on Foata normal form. 1/592 useless extension candidates. Maximal degree in co-relation 3086. Up to 259 conditions per place. [2025-02-08 01:13:35,144 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 85 selfloop transitions, 13 changer transitions 8/107 dead transitions. [2025-02-08 01:13:35,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 107 transitions, 1161 flow [2025-02-08 01:13:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2025-02-08 01:13:35,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34459459459459457 [2025-02-08 01:13:35,145 INFO L175 Difference]: Start difference. First operand has 136 places, 71 transitions, 750 flow. Second operand 8 states and 102 transitions. [2025-02-08 01:13:35,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 107 transitions, 1161 flow [2025-02-08 01:13:35,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 107 transitions, 1128 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-02-08 01:13:35,151 INFO L231 Difference]: Finished difference. Result has 138 places, 70 transitions, 740 flow [2025-02-08 01:13:35,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=740, PETRI_PLACES=138, PETRI_TRANSITIONS=70} [2025-02-08 01:13:35,152 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 104 predicate places. [2025-02-08 01:13:35,152 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 70 transitions, 740 flow [2025-02-08 01:13:35,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:35,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:35,152 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:35,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-08 01:13:35,152 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:35,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:35,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1790903083, now seen corresponding path program 48 times [2025-02-08 01:13:35,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:35,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046688500] [2025-02-08 01:13:35,153 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:13:35,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:35,161 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:35,166 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:35,166 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 01:13:35,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:35,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:35,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046688500] [2025-02-08 01:13:35,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046688500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:35,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:35,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:35,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545877336] [2025-02-08 01:13:35,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:35,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:35,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:35,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:35,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:35,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:35,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 70 transitions, 740 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:35,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:35,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:35,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:35,567 INFO L124 PetriNetUnfolderBase]: 163/578 cut-off events. [2025-02-08 01:13:35,567 INFO L125 PetriNetUnfolderBase]: For 3440/3440 co-relation queries the response was YES. [2025-02-08 01:13:35,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3057 conditions, 578 events. 163/578 cut-off events. For 3440/3440 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3943 event pairs, 39 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 3017. Up to 259 conditions per place. [2025-02-08 01:13:35,570 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 85 selfloop transitions, 12 changer transitions 8/106 dead transitions. [2025-02-08 01:13:35,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 106 transitions, 1133 flow [2025-02-08 01:13:35,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-02-08 01:13:35,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34797297297297297 [2025-02-08 01:13:35,570 INFO L175 Difference]: Start difference. First operand has 138 places, 70 transitions, 740 flow. Second operand 8 states and 103 transitions. [2025-02-08 01:13:35,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 106 transitions, 1133 flow [2025-02-08 01:13:35,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 106 transitions, 1097 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-02-08 01:13:35,576 INFO L231 Difference]: Finished difference. Result has 139 places, 70 transitions, 741 flow [2025-02-08 01:13:35,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=741, PETRI_PLACES=139, PETRI_TRANSITIONS=70} [2025-02-08 01:13:35,576 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 105 predicate places. [2025-02-08 01:13:35,577 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 70 transitions, 741 flow [2025-02-08 01:13:35,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:35,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:35,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:35,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-02-08 01:13:35,577 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:35,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:35,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1930884199, now seen corresponding path program 49 times [2025-02-08 01:13:35,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:35,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759814191] [2025-02-08 01:13:35,578 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:13:35,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:35,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:13:35,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:35,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:35,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:35,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:35,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759814191] [2025-02-08 01:13:35,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759814191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:35,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:35,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:35,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508346617] [2025-02-08 01:13:35,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:35,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:35,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:35,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:35,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:35,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:35,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 70 transitions, 741 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:35,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:35,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:35,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:36,056 INFO L124 PetriNetUnfolderBase]: 161/567 cut-off events. [2025-02-08 01:13:36,056 INFO L125 PetriNetUnfolderBase]: For 3411/3411 co-relation queries the response was YES. [2025-02-08 01:13:36,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3021 conditions, 567 events. 161/567 cut-off events. For 3411/3411 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3819 event pairs, 40 based on Foata normal form. 1/567 useless extension candidates. Maximal degree in co-relation 2981. Up to 259 conditions per place. [2025-02-08 01:13:36,059 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 80 selfloop transitions, 10 changer transitions 12/103 dead transitions. [2025-02-08 01:13:36,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 103 transitions, 1108 flow [2025-02-08 01:13:36,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:36,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2025-02-08 01:13:36,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34121621621621623 [2025-02-08 01:13:36,060 INFO L175 Difference]: Start difference. First operand has 139 places, 70 transitions, 741 flow. Second operand 8 states and 101 transitions. [2025-02-08 01:13:36,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 103 transitions, 1108 flow [2025-02-08 01:13:36,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 103 transitions, 1087 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:36,065 INFO L231 Difference]: Finished difference. Result has 143 places, 68 transitions, 710 flow [2025-02-08 01:13:36,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=710, PETRI_PLACES=143, PETRI_TRANSITIONS=68} [2025-02-08 01:13:36,066 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 109 predicate places. [2025-02-08 01:13:36,066 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 68 transitions, 710 flow [2025-02-08 01:13:36,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:36,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:36,066 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:36,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-02-08 01:13:36,066 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:36,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:36,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1932354965, now seen corresponding path program 50 times [2025-02-08 01:13:36,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:36,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032340] [2025-02-08 01:13:36,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:13:36,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:36,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:36,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:36,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:13:36,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:36,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:36,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:36,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032340] [2025-02-08 01:13:36,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:36,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:36,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:36,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722585828] [2025-02-08 01:13:36,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:36,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:36,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:36,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:36,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:36,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:36,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 68 transitions, 710 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:36,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:36,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:36,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:36,475 INFO L124 PetriNetUnfolderBase]: 156/549 cut-off events. [2025-02-08 01:13:36,476 INFO L125 PetriNetUnfolderBase]: For 3336/3336 co-relation queries the response was YES. [2025-02-08 01:13:36,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2912 conditions, 549 events. 156/549 cut-off events. For 3336/3336 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3652 event pairs, 39 based on Foata normal form. 1/549 useless extension candidates. Maximal degree in co-relation 2871. Up to 259 conditions per place. [2025-02-08 01:13:36,478 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 78 selfloop transitions, 10 changer transitions 9/98 dead transitions. [2025-02-08 01:13:36,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 98 transitions, 1041 flow [2025-02-08 01:13:36,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2025-02-08 01:13:36,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3277027027027027 [2025-02-08 01:13:36,479 INFO L175 Difference]: Start difference. First operand has 143 places, 68 transitions, 710 flow. Second operand 8 states and 97 transitions. [2025-02-08 01:13:36,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 98 transitions, 1041 flow [2025-02-08 01:13:36,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 98 transitions, 1008 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-02-08 01:13:36,485 INFO L231 Difference]: Finished difference. Result has 142 places, 65 transitions, 648 flow [2025-02-08 01:13:36,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=648, PETRI_PLACES=142, PETRI_TRANSITIONS=65} [2025-02-08 01:13:36,486 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 108 predicate places. [2025-02-08 01:13:36,486 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 65 transitions, 648 flow [2025-02-08 01:13:36,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:36,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:36,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:36,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-02-08 01:13:36,487 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:36,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:36,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1441433521, now seen corresponding path program 51 times [2025-02-08 01:13:36,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:36,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4507810] [2025-02-08 01:13:36,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:13:36,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:36,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:36,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-02-08 01:13:36,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:13:36,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:36,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:36,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4507810] [2025-02-08 01:13:36,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4507810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:36,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:36,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:36,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881277676] [2025-02-08 01:13:36,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:36,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:36,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:36,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:36,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:36,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:36,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 65 transitions, 648 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:36,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:36,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:36,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:36,886 INFO L124 PetriNetUnfolderBase]: 150/529 cut-off events. [2025-02-08 01:13:36,887 INFO L125 PetriNetUnfolderBase]: For 3144/3144 co-relation queries the response was YES. [2025-02-08 01:13:36,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2768 conditions, 529 events. 150/529 cut-off events. For 3144/3144 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3490 event pairs, 39 based on Foata normal form. 1/529 useless extension candidates. Maximal degree in co-relation 2728. Up to 259 conditions per place. [2025-02-08 01:13:36,889 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 67 selfloop transitions, 6 changer transitions 17/91 dead transitions. [2025-02-08 01:13:36,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 91 transitions, 952 flow [2025-02-08 01:13:36,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2025-02-08 01:13:36,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3108108108108108 [2025-02-08 01:13:36,890 INFO L175 Difference]: Start difference. First operand has 142 places, 65 transitions, 648 flow. Second operand 8 states and 92 transitions. [2025-02-08 01:13:36,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 91 transitions, 952 flow [2025-02-08 01:13:36,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 91 transitions, 898 flow, removed 13 selfloop flow, removed 11 redundant places. [2025-02-08 01:13:36,895 INFO L231 Difference]: Finished difference. Result has 135 places, 60 transitions, 541 flow [2025-02-08 01:13:36,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=541, PETRI_PLACES=135, PETRI_TRANSITIONS=60} [2025-02-08 01:13:36,896 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 101 predicate places. [2025-02-08 01:13:36,896 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 60 transitions, 541 flow [2025-02-08 01:13:36,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:36,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:36,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:36,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-02-08 01:13:36,896 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:36,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:36,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1526289071, now seen corresponding path program 52 times [2025-02-08 01:13:36,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:36,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614972841] [2025-02-08 01:13:36,898 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:13:36,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:36,910 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:36,918 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:36,918 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:13:36,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:37,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:37,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614972841] [2025-02-08 01:13:37,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614972841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:37,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:37,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:37,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062546432] [2025-02-08 01:13:37,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:37,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:37,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:37,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:37,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:37,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:37,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 60 transitions, 541 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:37,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:37,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:37,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:37,362 INFO L124 PetriNetUnfolderBase]: 146/528 cut-off events. [2025-02-08 01:13:37,363 INFO L125 PetriNetUnfolderBase]: For 2827/2827 co-relation queries the response was YES. [2025-02-08 01:13:37,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2664 conditions, 528 events. 146/528 cut-off events. For 2827/2827 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3542 event pairs, 31 based on Foata normal form. 1/528 useless extension candidates. Maximal degree in co-relation 2627. Up to 285 conditions per place. [2025-02-08 01:13:37,365 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 88 selfloop transitions, 12 changer transitions 7/108 dead transitions. [2025-02-08 01:13:37,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 108 transitions, 1177 flow [2025-02-08 01:13:37,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2025-02-08 01:13:37,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34459459459459457 [2025-02-08 01:13:37,368 INFO L175 Difference]: Start difference. First operand has 135 places, 60 transitions, 541 flow. Second operand 8 states and 102 transitions. [2025-02-08 01:13:37,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 108 transitions, 1177 flow [2025-02-08 01:13:37,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 108 transitions, 1109 flow, removed 15 selfloop flow, removed 8 redundant places. [2025-02-08 01:13:37,373 INFO L231 Difference]: Finished difference. Result has 121 places, 65 transitions, 635 flow [2025-02-08 01:13:37,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=635, PETRI_PLACES=121, PETRI_TRANSITIONS=65} [2025-02-08 01:13:37,373 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 87 predicate places. [2025-02-08 01:13:37,374 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 65 transitions, 635 flow [2025-02-08 01:13:37,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:37,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:37,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:37,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-02-08 01:13:37,374 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:37,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:37,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1850728035, now seen corresponding path program 53 times [2025-02-08 01:13:37,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:37,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969012142] [2025-02-08 01:13:37,375 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:13:37,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:37,387 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:37,396 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:37,397 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:13:37,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:37,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:37,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:37,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969012142] [2025-02-08 01:13:37,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969012142] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:13:37,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:13:37,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:13:37,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303903429] [2025-02-08 01:13:37,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:13:37,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:13:37,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:37,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:13:37,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:13:37,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:37,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 65 transitions, 635 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:37,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:37,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:37,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:37,786 INFO L124 PetriNetUnfolderBase]: 144/517 cut-off events. [2025-02-08 01:13:37,787 INFO L125 PetriNetUnfolderBase]: For 2836/2836 co-relation queries the response was YES. [2025-02-08 01:13:37,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2680 conditions, 517 events. 144/517 cut-off events. For 2836/2836 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3421 event pairs, 31 based on Foata normal form. 1/517 useless extension candidates. Maximal degree in co-relation 2643. Up to 285 conditions per place. [2025-02-08 01:13:37,789 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 81 selfloop transitions, 14 changer transitions 8/104 dead transitions. [2025-02-08 01:13:37,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 104 transitions, 1145 flow [2025-02-08 01:13:37,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:37,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:37,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2025-02-08 01:13:37,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3344594594594595 [2025-02-08 01:13:37,790 INFO L175 Difference]: Start difference. First operand has 121 places, 65 transitions, 635 flow. Second operand 8 states and 99 transitions. [2025-02-08 01:13:37,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 104 transitions, 1145 flow [2025-02-08 01:13:37,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 104 transitions, 1109 flow, removed 13 selfloop flow, removed 4 redundant places. [2025-02-08 01:13:37,795 INFO L231 Difference]: Finished difference. Result has 128 places, 69 transitions, 745 flow [2025-02-08 01:13:37,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=745, PETRI_PLACES=128, PETRI_TRANSITIONS=69} [2025-02-08 01:13:37,795 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 94 predicate places. [2025-02-08 01:13:37,795 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 69 transitions, 745 flow [2025-02-08 01:13:37,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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:37,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:37,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:37,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-02-08 01:13:37,796 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:37,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:37,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1894937545, now seen corresponding path program 54 times [2025-02-08 01:13:37,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:37,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121692883] [2025-02-08 01:13:37,797 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:13:37,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:37,805 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:37,825 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:37,825 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-02-08 01:13:37,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:38,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:38,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121692883] [2025-02-08 01:13:38,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121692883] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:13:38,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004144482] [2025-02-08 01:13:38,111 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:13:38,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:38,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:38,114 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:13:38,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 01:13:38,259 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:13:38,297 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:38,297 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-02-08 01:13:38,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:38,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:13:38,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:13:39,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:13:39,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 322 treesize of output 1014 [2025-02-08 01:13:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:45,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:13:45,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:45,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004144482] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:13:45,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:13:45,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-02-08 01:13:45,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021622446] [2025-02-08 01:13:45,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:13:45,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 01:13:45,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:45,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 01:13:45,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2025-02-08 01:13:45,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:45,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 69 transitions, 745 flow. Second operand has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 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:45,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:45,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:45,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:13:54,059 INFO L124 PetriNetUnfolderBase]: 141/503 cut-off events. [2025-02-08 01:13:54,063 INFO L125 PetriNetUnfolderBase]: For 3154/3154 co-relation queries the response was YES. [2025-02-08 01:13:54,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2687 conditions, 503 events. 141/503 cut-off events. For 3154/3154 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3294 event pairs, 30 based on Foata normal form. 1/503 useless extension candidates. Maximal degree in co-relation 2647. Up to 285 conditions per place. [2025-02-08 01:13:54,079 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 79 selfloop transitions, 12 changer transitions 9/101 dead transitions. [2025-02-08 01:13:54,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 101 transitions, 1147 flow [2025-02-08 01:13:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:13:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:13:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2025-02-08 01:13:54,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3277027027027027 [2025-02-08 01:13:54,085 INFO L175 Difference]: Start difference. First operand has 128 places, 69 transitions, 745 flow. Second operand 8 states and 97 transitions. [2025-02-08 01:13:54,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 101 transitions, 1147 flow [2025-02-08 01:13:54,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 101 transitions, 1103 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-02-08 01:13:54,102 INFO L231 Difference]: Finished difference. Result has 132 places, 68 transitions, 720 flow [2025-02-08 01:13:54,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=720, PETRI_PLACES=132, PETRI_TRANSITIONS=68} [2025-02-08 01:13:54,103 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 98 predicate places. [2025-02-08 01:13:54,104 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 68 transitions, 720 flow [2025-02-08 01:13:54,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 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:54,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:13:54,104 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:13:54,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 01:13:54,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:54,305 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:13:54,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:13:54,306 INFO L85 PathProgramCache]: Analyzing trace with hash 552227825, now seen corresponding path program 55 times [2025-02-08 01:13:54,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:13:54,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125326408] [2025-02-08 01:13:54,306 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:13:54,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:13:54,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:13:54,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:54,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:54,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:54,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:13:54,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125326408] [2025-02-08 01:13:54,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125326408] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:13:54,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770801260] [2025-02-08 01:13:54,978 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:13:54,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:13:54,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:13:54,981 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:13:54,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 01:13:55,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:13:55,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:13:55,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:13:55,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:13:55,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:13:55,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:13:55,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:13:55,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 122 treesize of output 242 [2025-02-08 01:13:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:55,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:13:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:13:55,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770801260] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:13:55,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:13:55,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-02-08 01:13:55,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597866148] [2025-02-08 01:13:55,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:13:55,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 01:13:55,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:13:55,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 01:13:55,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2025-02-08 01:13:55,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:13:55,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 68 transitions, 720 flow. Second operand has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 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:55,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:13:55,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:13:55,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:01,166 INFO L124 PetriNetUnfolderBase]: 138/489 cut-off events. [2025-02-08 01:14:01,166 INFO L125 PetriNetUnfolderBase]: For 3068/3068 co-relation queries the response was YES. [2025-02-08 01:14:01,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2624 conditions, 489 events. 138/489 cut-off events. For 3068/3068 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3156 event pairs, 31 based on Foata normal form. 1/489 useless extension candidates. Maximal degree in co-relation 2584. Up to 285 conditions per place. [2025-02-08 01:14:01,171 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 74 selfloop transitions, 9 changer transitions 12/96 dead transitions. [2025-02-08 01:14:01,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 96 transitions, 1095 flow [2025-02-08 01:14:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:01,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:01,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2025-02-08 01:14:01,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31756756756756754 [2025-02-08 01:14:01,175 INFO L175 Difference]: Start difference. First operand has 132 places, 68 transitions, 720 flow. Second operand 8 states and 94 transitions. [2025-02-08 01:14:01,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 96 transitions, 1095 flow [2025-02-08 01:14:01,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 96 transitions, 1063 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-02-08 01:14:01,184 INFO L231 Difference]: Finished difference. Result has 133 places, 65 transitions, 661 flow [2025-02-08 01:14:01,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=661, PETRI_PLACES=133, PETRI_TRANSITIONS=65} [2025-02-08 01:14:01,185 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 99 predicate places. [2025-02-08 01:14:01,185 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 65 transitions, 661 flow [2025-02-08 01:14:01,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 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,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:01,189 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:01,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 01:14:01,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:01,392 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:14:01,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:01,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1690438051, now seen corresponding path program 56 times [2025-02-08 01:14:01,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:01,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817112707] [2025-02-08 01:14:01,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:14:01,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:01,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:01,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:01,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:14:01,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:01,720 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:01,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:01,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817112707] [2025-02-08 01:14:01,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817112707] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:01,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579581617] [2025-02-08 01:14:01,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:14:01,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:01,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:14:01,724 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:14:01,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 01:14:01,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:01,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:01,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:14:01,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:01,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:14:01,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:14:02,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:14:02,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 122 treesize of output 242 [2025-02-08 01:14:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:02,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:14:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:02,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579581617] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:14:02,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:14:02,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-02-08 01:14:02,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623696029] [2025-02-08 01:14:02,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:14:02,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 01:14:02,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:02,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 01:14:02,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-02-08 01:14:02,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:02,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 65 transitions, 661 flow. Second operand has 19 states, 19 states have (on average 6.473684210526316) internal successors, (123), 19 states have internal predecessors, (123), 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,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:02,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:02,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:04,736 INFO L124 PetriNetUnfolderBase]: 133/470 cut-off events. [2025-02-08 01:14:04,736 INFO L125 PetriNetUnfolderBase]: For 2893/2893 co-relation queries the response was YES. [2025-02-08 01:14:04,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2498 conditions, 470 events. 133/470 cut-off events. For 2893/2893 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2983 event pairs, 33 based on Foata normal form. 1/470 useless extension candidates. Maximal degree in co-relation 2458. Up to 285 conditions per place. [2025-02-08 01:14:04,739 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 75 selfloop transitions, 11 changer transitions 6/93 dead transitions. [2025-02-08 01:14:04,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 93 transitions, 1011 flow [2025-02-08 01:14:04,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2025-02-08 01:14:04,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3277027027027027 [2025-02-08 01:14:04,740 INFO L175 Difference]: Start difference. First operand has 133 places, 65 transitions, 661 flow. Second operand 8 states and 97 transitions. [2025-02-08 01:14:04,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 93 transitions, 1011 flow [2025-02-08 01:14:04,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 93 transitions, 952 flow, removed 11 selfloop flow, removed 9 redundant places. [2025-02-08 01:14:04,746 INFO L231 Difference]: Finished difference. Result has 129 places, 66 transitions, 662 flow [2025-02-08 01:14:04,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=662, PETRI_PLACES=129, PETRI_TRANSITIONS=66} [2025-02-08 01:14:04,747 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 95 predicate places. [2025-02-08 01:14:04,747 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 66 transitions, 662 flow [2025-02-08 01:14:04,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.473684210526316) internal successors, (123), 19 states have internal predecessors, (123), 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:04,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:04,748 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:04,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 01:14:04,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:04,952 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:14:04,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2031349231, now seen corresponding path program 57 times [2025-02-08 01:14:04,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:04,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332082561] [2025-02-08 01:14:04,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:14:04,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:04,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:05,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:05,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:14:05,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:05,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:05,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332082561] [2025-02-08 01:14:05,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332082561] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:05,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441269767] [2025-02-08 01:14:05,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:14:05,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:05,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:14:05,215 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:14:05,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 01:14:05,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:05,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:05,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:14:05,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:05,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:14:05,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:14:05,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:14:05,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 122 treesize of output 242 [2025-02-08 01:14:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:05,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:14:06,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:06,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441269767] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:14:06,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:14:06,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-02-08 01:14:06,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744205917] [2025-02-08 01:14:06,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:14:06,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 01:14:06,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:06,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 01:14:06,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2025-02-08 01:14:06,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:06,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 66 transitions, 662 flow. Second operand has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 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:06,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:06,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:06,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:07,884 INFO L124 PetriNetUnfolderBase]: 130/460 cut-off events. [2025-02-08 01:14:07,884 INFO L125 PetriNetUnfolderBase]: For 2423/2423 co-relation queries the response was YES. [2025-02-08 01:14:07,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2433 conditions, 460 events. 130/460 cut-off events. For 2423/2423 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2891 event pairs, 33 based on Foata normal form. 1/460 useless extension candidates. Maximal degree in co-relation 2395. Up to 285 conditions per place. [2025-02-08 01:14:07,887 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 68 selfloop transitions, 8 changer transitions 14/91 dead transitions. [2025-02-08 01:14:07,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 91 transitions, 979 flow [2025-02-08 01:14:07,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:07,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2025-02-08 01:14:07,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32094594594594594 [2025-02-08 01:14:07,888 INFO L175 Difference]: Start difference. First operand has 129 places, 66 transitions, 662 flow. Second operand 8 states and 95 transitions. [2025-02-08 01:14:07,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 91 transitions, 979 flow [2025-02-08 01:14:07,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 91 transitions, 961 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 01:14:07,893 INFO L231 Difference]: Finished difference. Result has 133 places, 63 transitions, 612 flow [2025-02-08 01:14:07,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=612, PETRI_PLACES=133, PETRI_TRANSITIONS=63} [2025-02-08 01:14:07,893 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 99 predicate places. [2025-02-08 01:14:07,893 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 63 transitions, 612 flow [2025-02-08 01:14:07,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 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:07,894 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:07,894 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:07,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 01:14:08,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2025-02-08 01:14:08,095 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:14:08,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:08,095 INFO L85 PathProgramCache]: Analyzing trace with hash -715191927, now seen corresponding path program 58 times [2025-02-08 01:14:08,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:08,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525386528] [2025-02-08 01:14:08,096 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:14:08,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:08,110 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:08,125 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:08,125 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:14:08,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:08,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:08,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:08,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525386528] [2025-02-08 01:14:08,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525386528] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:08,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324822338] [2025-02-08 01:14:08,320 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:14:08,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:08,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:14:08,322 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:14:08,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 01:14:08,456 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:08,489 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:08,489 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:14:08,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:08,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:14:08,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:14:08,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:14:08,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 79 [2025-02-08 01:14:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:08,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:14:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:09,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324822338] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:14:09,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:14:09,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-02-08 01:14:09,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880078854] [2025-02-08 01:14:09,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:14:09,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 01:14:09,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:09,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 01:14:09,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-02-08 01:14:09,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:09,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 63 transitions, 612 flow. Second operand has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 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:09,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:09,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:09,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:09,578 INFO L124 PetriNetUnfolderBase]: 125/438 cut-off events. [2025-02-08 01:14:09,579 INFO L125 PetriNetUnfolderBase]: For 2304/2304 co-relation queries the response was YES. [2025-02-08 01:14:09,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2313 conditions, 438 events. 125/438 cut-off events. For 2304/2304 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2690 event pairs, 30 based on Foata normal form. 1/438 useless extension candidates. Maximal degree in co-relation 2274. Up to 285 conditions per place. [2025-02-08 01:14:09,581 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 71 selfloop transitions, 10 changer transitions 7/89 dead transitions. [2025-02-08 01:14:09,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 89 transitions, 914 flow [2025-02-08 01:14:09,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2025-02-08 01:14:09,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31756756756756754 [2025-02-08 01:14:09,584 INFO L175 Difference]: Start difference. First operand has 133 places, 63 transitions, 612 flow. Second operand 8 states and 94 transitions. [2025-02-08 01:14:09,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 89 transitions, 914 flow [2025-02-08 01:14:09,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 89 transitions, 880 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-02-08 01:14:09,590 INFO L231 Difference]: Finished difference. Result has 129 places, 62 transitions, 594 flow [2025-02-08 01:14:09,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=594, PETRI_PLACES=129, PETRI_TRANSITIONS=62} [2025-02-08 01:14:09,599 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 95 predicate places. [2025-02-08 01:14:09,599 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 62 transitions, 594 flow [2025-02-08 01:14:09,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 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:09,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:09,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:09,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 01:14:09,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:09,800 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:14:09,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:09,802 INFO L85 PathProgramCache]: Analyzing trace with hash -365722365, now seen corresponding path program 59 times [2025-02-08 01:14:09,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:09,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642134840] [2025-02-08 01:14:09,802 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:14:09,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:09,813 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:09,827 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:09,829 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:14:09,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:09,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:09,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642134840] [2025-02-08 01:14:09,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642134840] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:09,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521258567] [2025-02-08 01:14:09,999 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:14:09,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:09,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:14:10,001 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:14:10,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 01:14:10,147 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:10,182 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:10,182 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:14:10,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:10,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:14:10,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:14:10,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:14:10,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 79 [2025-02-08 01:14:10,571 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:10,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:14:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:10,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521258567] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:14:10,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:14:10,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-02-08 01:14:10,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827031823] [2025-02-08 01:14:10,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:14:10,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 01:14:10,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:10,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 01:14:10,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-02-08 01:14:10,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:10,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 62 transitions, 594 flow. Second operand has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 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:10,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:10,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:10,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:11,365 INFO L124 PetriNetUnfolderBase]: 123/427 cut-off events. [2025-02-08 01:14:11,366 INFO L125 PetriNetUnfolderBase]: For 2198/2198 co-relation queries the response was YES. [2025-02-08 01:14:11,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2259 conditions, 427 events. 123/427 cut-off events. For 2198/2198 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2586 event pairs, 30 based on Foata normal form. 1/427 useless extension candidates. Maximal degree in co-relation 2223. Up to 285 conditions per place. [2025-02-08 01:14:11,371 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 68 selfloop transitions, 8 changer transitions 10/87 dead transitions. [2025-02-08 01:14:11,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 87 transitions, 911 flow [2025-02-08 01:14:11,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2025-02-08 01:14:11,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3108108108108108 [2025-02-08 01:14:11,375 INFO L175 Difference]: Start difference. First operand has 129 places, 62 transitions, 594 flow. Second operand 8 states and 92 transitions. [2025-02-08 01:14:11,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 87 transitions, 911 flow [2025-02-08 01:14:11,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 87 transitions, 881 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-02-08 01:14:11,380 INFO L231 Difference]: Finished difference. Result has 131 places, 61 transitions, 582 flow [2025-02-08 01:14:11,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=582, PETRI_PLACES=131, PETRI_TRANSITIONS=61} [2025-02-08 01:14:11,380 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 97 predicate places. [2025-02-08 01:14:11,381 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 61 transitions, 582 flow [2025-02-08 01:14:11,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 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:11,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:11,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:11,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 01:14:11,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:11,581 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:14:11,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:11,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1288371941, now seen corresponding path program 60 times [2025-02-08 01:14:11,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:11,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718582905] [2025-02-08 01:14:11,582 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:14:11,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:11,591 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:11,604 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:11,604 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-02-08 01:14:11,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:11,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:11,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718582905] [2025-02-08 01:14:11,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718582905] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:11,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720847278] [2025-02-08 01:14:11,792 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:14:11,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:11,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:14:11,795 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:14:11,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 01:14:11,934 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:11,977 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:11,977 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-02-08 01:14:11,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:11,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:14:11,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:14:12,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:14:12,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 79 [2025-02-08 01:14:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:12,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:14:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:12,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720847278] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:14:12,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:14:12,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-02-08 01:14:12,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604487735] [2025-02-08 01:14:12,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:14:12,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 01:14:12,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:12,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 01:14:12,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-02-08 01:14:12,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:12,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 61 transitions, 582 flow. Second operand has 19 states, 19 states have (on average 6.473684210526316) internal successors, (123), 19 states have internal predecessors, (123), 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:12,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:12,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:12,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:13,370 INFO L124 PetriNetUnfolderBase]: 119/411 cut-off events. [2025-02-08 01:14:13,371 INFO L125 PetriNetUnfolderBase]: For 2111/2111 co-relation queries the response was YES. [2025-02-08 01:14:13,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2162 conditions, 411 events. 119/411 cut-off events. For 2111/2111 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2442 event pairs, 31 based on Foata normal form. 1/411 useless extension candidates. Maximal degree in co-relation 2125. Up to 285 conditions per place. [2025-02-08 01:14:13,372 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 65 selfloop transitions, 8 changer transitions 11/85 dead transitions. [2025-02-08 01:14:13,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 85 transitions, 875 flow [2025-02-08 01:14:13,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2025-02-08 01:14:13,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3108108108108108 [2025-02-08 01:14:13,375 INFO L175 Difference]: Start difference. First operand has 131 places, 61 transitions, 582 flow. Second operand 8 states and 92 transitions. [2025-02-08 01:14:13,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 85 transitions, 875 flow [2025-02-08 01:14:13,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 85 transitions, 847 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-02-08 01:14:13,380 INFO L231 Difference]: Finished difference. Result has 132 places, 60 transitions, 566 flow [2025-02-08 01:14:13,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=566, PETRI_PLACES=132, PETRI_TRANSITIONS=60} [2025-02-08 01:14:13,380 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 98 predicate places. [2025-02-08 01:14:13,380 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 60 transitions, 566 flow [2025-02-08 01:14:13,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.473684210526316) internal successors, (123), 19 states have internal predecessors, (123), 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:13,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:13,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:13,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 01:14:13,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:13,581 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:14:13,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:13,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1286901175, now seen corresponding path program 61 times [2025-02-08 01:14:13,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:13,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87052563] [2025-02-08 01:14:13,582 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:14:13,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:13,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:14:13,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:13,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:13,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:13,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:13,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87052563] [2025-02-08 01:14:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87052563] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:13,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815214262] [2025-02-08 01:14:13,771 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:14:13,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:13,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:14:13,774 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:14:13,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 01:14:13,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 01:14:13,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:13,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:14:13,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:13,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:14:13,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:14:14,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:14:14,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 79 [2025-02-08 01:14:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:14,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:14:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:14,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815214262] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:14:14,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:14:14,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-02-08 01:14:14,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528009368] [2025-02-08 01:14:14,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:14:14,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 01:14:14,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:14,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 01:14:14,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-02-08 01:14:14,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:14,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 60 transitions, 566 flow. Second operand has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 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:14,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:14,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:14,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:15,057 INFO L124 PetriNetUnfolderBase]: 114/393 cut-off events. [2025-02-08 01:14:15,057 INFO L125 PetriNetUnfolderBase]: For 1987/1987 co-relation queries the response was YES. [2025-02-08 01:14:15,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 393 events. 114/393 cut-off events. For 1987/1987 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2290 event pairs, 30 based on Foata normal form. 1/393 useless extension candidates. Maximal degree in co-relation 2020. Up to 285 conditions per place. [2025-02-08 01:14:15,059 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 64 selfloop transitions, 8 changer transitions 7/80 dead transitions. [2025-02-08 01:14:15,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 80 transitions, 807 flow [2025-02-08 01:14:15,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2025-02-08 01:14:15,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2972972972972973 [2025-02-08 01:14:15,062 INFO L175 Difference]: Start difference. First operand has 132 places, 60 transitions, 566 flow. Second operand 8 states and 88 transitions. [2025-02-08 01:14:15,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 80 transitions, 807 flow [2025-02-08 01:14:15,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 80 transitions, 783 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-02-08 01:14:15,066 INFO L231 Difference]: Finished difference. Result has 132 places, 59 transitions, 545 flow [2025-02-08 01:14:15,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=545, PETRI_PLACES=132, PETRI_TRANSITIONS=59} [2025-02-08 01:14:15,067 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 98 predicate places. [2025-02-08 01:14:15,067 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 59 transitions, 545 flow [2025-02-08 01:14:15,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 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:15,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:15,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:15,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 01:14:15,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2025-02-08 01:14:15,272 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:14:15,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:15,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1202594993, now seen corresponding path program 62 times [2025-02-08 01:14:15,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:15,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073787620] [2025-02-08 01:14:15,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:14:15,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:15,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:15,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:15,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:14:15,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:15,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:15,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073787620] [2025-02-08 01:14:15,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073787620] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:15,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037166568] [2025-02-08 01:14:15,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:14:15,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:15,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:14:15,482 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:14:15,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 01:14:15,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:15,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:15,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:14:15,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:15,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:14:15,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:14:15,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:14:15,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 79 [2025-02-08 01:14:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:16,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:14:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:16,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037166568] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:14:16,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:14:16,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-02-08 01:14:16,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715060201] [2025-02-08 01:14:16,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:14:16,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 01:14:16,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:16,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 01:14:16,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-02-08 01:14:16,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:16,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 59 transitions, 545 flow. Second operand has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 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:16,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:16,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:16,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:14:16,761 INFO L124 PetriNetUnfolderBase]: 109/377 cut-off events. [2025-02-08 01:14:16,761 INFO L125 PetriNetUnfolderBase]: For 1824/1824 co-relation queries the response was YES. [2025-02-08 01:14:16,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 377 events. 109/377 cut-off events. For 1824/1824 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2151 event pairs, 29 based on Foata normal form. 1/377 useless extension candidates. Maximal degree in co-relation 1913. Up to 285 conditions per place. [2025-02-08 01:14:16,766 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 52 selfloop transitions, 3 changer transitions 19/75 dead transitions. [2025-02-08 01:14:16,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 75 transitions, 750 flow [2025-02-08 01:14:16,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:14:16,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:14:16,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2025-02-08 01:14:16,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28378378378378377 [2025-02-08 01:14:16,770 INFO L175 Difference]: Start difference. First operand has 132 places, 59 transitions, 545 flow. Second operand 8 states and 84 transitions. [2025-02-08 01:14:16,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 75 transitions, 750 flow [2025-02-08 01:14:16,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 75 transitions, 716 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-02-08 01:14:16,773 INFO L231 Difference]: Finished difference. Result has 129 places, 53 transitions, 439 flow [2025-02-08 01:14:16,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=439, PETRI_PLACES=129, PETRI_TRANSITIONS=53} [2025-02-08 01:14:16,780 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 95 predicate places. [2025-02-08 01:14:16,780 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 53 transitions, 439 flow [2025-02-08 01:14:16,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 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:16,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:14:16,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:14:16,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 01:14:16,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2025-02-08 01:14:16,981 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-02-08 01:14:16,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:14:16,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1546844903, now seen corresponding path program 63 times [2025-02-08 01:14:16,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:14:16,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770792362] [2025-02-08 01:14:16,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:14:16,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:14:16,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:17,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:17,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:14:17,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:17,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:14:17,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770792362] [2025-02-08 01:14:17,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770792362] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:14:17,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872592984] [2025-02-08 01:14:17,226 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:14:17,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:14:17,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:14:17,229 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:14:17,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 01:14:17,399 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-02-08 01:14:17,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 01:14:17,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 01:14:17,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:14:17,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 01:14:17,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:14:17,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:14:17,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 122 treesize of output 242 [2025-02-08 01:14:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:17,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:14:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 01:14:18,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872592984] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:14:18,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:14:18,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-02-08 01:14:18,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712600728] [2025-02-08 01:14:18,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:14:18,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 01:14:18,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:14:18,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 01:14:18,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-02-08 01:14:18,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 37 [2025-02-08 01:14:18,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 53 transitions, 439 flow. Second operand has 20 states, 20 states have (on average 6.55) internal successors, (131), 20 states have internal predecessors, (131), 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:18,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:14:18,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 37 [2025-02-08 01:14:18,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand