./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-2_1-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-2_1-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash edceb7bcc6473f68e1454dc7ab02ec33e8dca99fdd725419b9e71852c466530e --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:54:45,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:54:45,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:54:45,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:54:45,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:54:45,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:54:45,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:54:45,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:54:45,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:54:45,739 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:54:45,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:54:45,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:54:45,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:54:45,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:54:45,740 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:54:45,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:54:45,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:54:45,740 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:54:45,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:54:45,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:54:45,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:54:45,740 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:54:45,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:54:45,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:54:45,740 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:54:45,740 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:54:45,740 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:54:45,741 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:54:45,741 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:54:45,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:54:45,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:54:45,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:54:45,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:54:45,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:54:45,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:54:45,741 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:54:45,741 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:54:45,741 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:54:45,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:54:45,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:54:45,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:54:45,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:54:45,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:54:45,741 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> edceb7bcc6473f68e1454dc7ab02ec33e8dca99fdd725419b9e71852c466530e [2025-03-14 00:54:45,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:54:45,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:54:45,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:54:45,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:54:45,986 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:54:45,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2025-03-14 00:54:47,392 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9af50dd/f48e49f2cd9d4c72a71fe99464c7584b/FLAG68bd075c2 [2025-03-14 00:54:47,681 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:54:47,682 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2025-03-14 00:54:47,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9af50dd/f48e49f2cd9d4c72a71fe99464c7584b/FLAG68bd075c2 [2025-03-14 00:54:47,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9af50dd/f48e49f2cd9d4c72a71fe99464c7584b [2025-03-14 00:54:47,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:54:47,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:54:47,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:54:47,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:54:47,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:54:47,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:54:47" (1/1) ... [2025-03-14 00:54:47,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47cb58e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:47, skipping insertion in model container [2025-03-14 00:54:47,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:54:47" (1/1) ... [2025-03-14 00:54:48,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:54:48,286 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i[186203,186216] [2025-03-14 00:54:48,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:54:48,321 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:54:48,363 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i[186203,186216] [2025-03-14 00:54:48,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:54:48,409 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:54:48,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48 WrapperNode [2025-03-14 00:54:48,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:54:48,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:54:48,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:54:48,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:54:48,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,436 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,454 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 126 [2025-03-14 00:54:48,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:54:48,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:54:48,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:54:48,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:54:48,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,463 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,475 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 13, 2]. 76 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 6, 2]. [2025-03-14 00:54:48,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,484 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:54:48,495 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:54:48,495 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:54:48,495 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:54:48,496 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (1/1) ... [2025-03-14 00:54:48,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:54:48,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:54:48,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 00:54:48,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 00:54:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-14 00:54:48,553 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-14 00:54:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 00:54:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 00:54:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 00:54:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 00:54:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 00:54:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-14 00:54:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 00:54:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 00:54:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-14 00:54:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 00:54:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:54:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-14 00:54:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-14 00:54:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-14 00:54:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:54:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 00:54:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-14 00:54:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:54:48,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:54:48,555 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:54:48,757 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:54:48,759 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:54:49,067 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:54:49,067 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:54:49,067 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:54:49,198 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:54:49,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:49 BoogieIcfgContainer [2025-03-14 00:54:49,199 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:54:49,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:54:49,200 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:54:49,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:54:49,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:54:47" (1/3) ... [2025-03-14 00:54:49,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6424c960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:54:49, skipping insertion in model container [2025-03-14 00:54:49,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:48" (2/3) ... [2025-03-14 00:54:49,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6424c960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:54:49, skipping insertion in model container [2025-03-14 00:54:49,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:49" (3/3) ... [2025-03-14 00:54:49,207 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2025-03-14 00:54:49,217 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:54:49,218 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_1-container_of.i that has 2 procedures, 46 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-14 00:54:49,218 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:54:49,261 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 00:54:49,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 134 flow [2025-03-14 00:54:49,315 INFO L124 PetriNetUnfolderBase]: 10/73 cut-off events. [2025-03-14 00:54:49,317 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 00:54:49,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 73 events. 10/73 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 139 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2025-03-14 00:54:49,319 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 60 transitions, 134 flow [2025-03-14 00:54:49,321 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 53 transitions, 118 flow [2025-03-14 00:54:49,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:54:49,339 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;@727743c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:54:49,339 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-14 00:54:49,343 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:54:49,343 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-14 00:54:49,343 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:54:49,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:49,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-14 00:54:49,344 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:49,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:49,348 INFO L85 PathProgramCache]: Analyzing trace with hash 11330651, now seen corresponding path program 1 times [2025-03-14 00:54:49,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:49,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400347280] [2025-03-14 00:54:49,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:49,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:49,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-14 00:54:49,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-14 00:54:49,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:49,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:49,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:49,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400347280] [2025-03-14 00:54:49,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400347280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:49,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:49,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:54:49,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379418708] [2025-03-14 00:54:49,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:49,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:54:49,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:49,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:54:49,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:54:49,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:54:49,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:49,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:49,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:54:49,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:50,158 INFO L124 PetriNetUnfolderBase]: 466/828 cut-off events. [2025-03-14 00:54:50,158 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-14 00:54:50,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 828 events. 466/828 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3485 event pairs, 345 based on Foata normal form. 3/827 useless extension candidates. Maximal degree in co-relation 1543. Up to 602 conditions per place. [2025-03-14 00:54:50,175 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 39 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2025-03-14 00:54:50,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 218 flow [2025-03-14 00:54:50,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:54:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:54:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-03-14 00:54:50,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-14 00:54:50,211 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 118 flow. Second operand 3 states and 84 transitions. [2025-03-14 00:54:50,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 218 flow [2025-03-14 00:54:50,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 00:54:50,225 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 112 flow [2025-03-14 00:54:50,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-03-14 00:54:50,238 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2025-03-14 00:54:50,240 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 112 flow [2025-03-14 00:54:50,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:50,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:50,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-14 00:54:50,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:54:50,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:50,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:50,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1996087732, now seen corresponding path program 1 times [2025-03-14 00:54:50,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:50,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157327720] [2025-03-14 00:54:50,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:50,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:50,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-14 00:54:50,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-14 00:54:50,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:50,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:50,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:50,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157327720] [2025-03-14 00:54:50,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157327720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:50,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:50,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:54:50,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658694427] [2025-03-14 00:54:50,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:50,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:54:50,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:50,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:54:50,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:54:50,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:54:50,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:50,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:50,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:54:50,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:50,650 INFO L124 PetriNetUnfolderBase]: 466/821 cut-off events. [2025-03-14 00:54:50,650 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-14 00:54:50,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 821 events. 466/821 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3467 event pairs, 155 based on Foata normal form. 1/821 useless extension candidates. Maximal degree in co-relation 818. Up to 553 conditions per place. [2025-03-14 00:54:50,658 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 47 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2025-03-14 00:54:50,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 265 flow [2025-03-14 00:54:50,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:54:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:54:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-03-14 00:54:50,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2025-03-14 00:54:50,662 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 112 flow. Second operand 5 states and 109 transitions. [2025-03-14 00:54:50,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 265 flow [2025-03-14 00:54:50,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:54:50,665 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 126 flow [2025-03-14 00:54:50,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-03-14 00:54:50,666 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2025-03-14 00:54:50,666 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 126 flow [2025-03-14 00:54:50,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:50,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:50,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:50,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:54:50,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:50,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:50,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1937579247, now seen corresponding path program 1 times [2025-03-14 00:54:50,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:50,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941989773] [2025-03-14 00:54:50,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:50,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:50,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:54:50,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:54:50,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:50,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:50,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:50,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:50,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941989773] [2025-03-14 00:54:50,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941989773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:50,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:50,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:54:50,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91530682] [2025-03-14 00:54:50,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:50,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:54:50,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:50,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:54:50,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:54:50,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:54:50,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:50,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:50,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:54:50,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:51,167 INFO L124 PetriNetUnfolderBase]: 562/1029 cut-off events. [2025-03-14 00:54:51,168 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2025-03-14 00:54:51,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2319 conditions, 1029 events. 562/1029 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4902 event pairs, 252 based on Foata normal form. 64/1092 useless extension candidates. Maximal degree in co-relation 228. Up to 545 conditions per place. [2025-03-14 00:54:51,175 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 49 selfloop transitions, 10 changer transitions 4/67 dead transitions. [2025-03-14 00:54:51,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 306 flow [2025-03-14 00:54:51,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:54:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:54:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-03-14 00:54:51,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-03-14 00:54:51,178 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 126 flow. Second operand 4 states and 102 transitions. [2025-03-14 00:54:51,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 306 flow [2025-03-14 00:54:51,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 00:54:51,181 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 150 flow [2025-03-14 00:54:51,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2025-03-14 00:54:51,182 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2025-03-14 00:54:51,182 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 150 flow [2025-03-14 00:54:51,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:51,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:51,182 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] [2025-03-14 00:54:51,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:54:51,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:51,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:51,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2131125183, now seen corresponding path program 1 times [2025-03-14 00:54:51,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:51,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986290035] [2025-03-14 00:54:51,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:51,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:51,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 00:54:51,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 00:54:51,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:51,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:51,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:51,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:51,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986290035] [2025-03-14 00:54:51,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986290035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:51,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:51,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:54:51,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054461322] [2025-03-14 00:54:51,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:51,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:54:51,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:51,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:54:51,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:54:51,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-14 00:54:51,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:51,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:51,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-14 00:54:51,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:51,442 INFO L124 PetriNetUnfolderBase]: 225/408 cut-off events. [2025-03-14 00:54:51,442 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2025-03-14 00:54:51,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 408 events. 225/408 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1425 event pairs, 46 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 927. Up to 217 conditions per place. [2025-03-14 00:54:51,445 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 48 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-03-14 00:54:51,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 278 flow [2025-03-14 00:54:51,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:54:51,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:54:51,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-03-14 00:54:51,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2025-03-14 00:54:51,448 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 150 flow. Second operand 4 states and 131 transitions. [2025-03-14 00:54:51,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 278 flow [2025-03-14 00:54:51,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 248 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-14 00:54:51,451 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 96 flow [2025-03-14 00:54:51,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-03-14 00:54:51,454 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -12 predicate places. [2025-03-14 00:54:51,454 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 96 flow [2025-03-14 00:54:51,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:51,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:51,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:51,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:54:51,454 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:51,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:51,455 INFO L85 PathProgramCache]: Analyzing trace with hash -889048815, now seen corresponding path program 1 times [2025-03-14 00:54:51,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:51,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470855124] [2025-03-14 00:54:51,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:51,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:51,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:54:51,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:54:51,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:51,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:51,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:51,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470855124] [2025-03-14 00:54:51,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470855124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:51,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:51,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:54:51,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510355291] [2025-03-14 00:54:51,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:51,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:54:51,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:51,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:54:51,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:54:52,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:54:52,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 96 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:52,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:52,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:54:52,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:52,353 INFO L124 PetriNetUnfolderBase]: 268/499 cut-off events. [2025-03-14 00:54:52,353 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-03-14 00:54:52,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 499 events. 268/499 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1842 event pairs, 14 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 226. Up to 139 conditions per place. [2025-03-14 00:54:52,356 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 67 selfloop transitions, 21 changer transitions 0/90 dead transitions. [2025-03-14 00:54:52,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 90 transitions, 411 flow [2025-03-14 00:54:52,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 00:54:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 00:54:52,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 206 transitions. [2025-03-14 00:54:52,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2861111111111111 [2025-03-14 00:54:52,357 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 96 flow. Second operand 12 states and 206 transitions. [2025-03-14 00:54:52,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 90 transitions, 411 flow [2025-03-14 00:54:52,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:54:52,359 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 197 flow [2025-03-14 00:54:52,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=197, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2025-03-14 00:54:52,360 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2025-03-14 00:54:52,360 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 197 flow [2025-03-14 00:54:52,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:52,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:52,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:52,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:54:52,360 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:52,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:52,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1008231267, now seen corresponding path program 2 times [2025-03-14 00:54:52,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:52,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736751608] [2025-03-14 00:54:52,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:54:52,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:52,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:54:52,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:54:52,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:54:52,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:52,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:52,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736751608] [2025-03-14 00:54:52,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736751608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:52,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:52,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:54:52,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646159132] [2025-03-14 00:54:52,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:52,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:54:52,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:52,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:54:52,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:54:52,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-14 00:54:52,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 197 flow. Second operand has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:52,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:52,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-14 00:54:52,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:53,220 INFO L124 PetriNetUnfolderBase]: 300/555 cut-off events. [2025-03-14 00:54:53,220 INFO L125 PetriNetUnfolderBase]: For 511/511 co-relation queries the response was YES. [2025-03-14 00:54:53,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1505 conditions, 555 events. 300/555 cut-off events. For 511/511 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2227 event pairs, 19 based on Foata normal form. 8/563 useless extension candidates. Maximal degree in co-relation 1482. Up to 282 conditions per place. [2025-03-14 00:54:53,224 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 60 selfloop transitions, 30 changer transitions 0/98 dead transitions. [2025-03-14 00:54:53,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 98 transitions, 601 flow [2025-03-14 00:54:53,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 00:54:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 00:54:53,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 294 transitions. [2025-03-14 00:54:53,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49 [2025-03-14 00:54:53,225 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 197 flow. Second operand 10 states and 294 transitions. [2025-03-14 00:54:53,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 98 transitions, 601 flow [2025-03-14 00:54:53,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 98 transitions, 569 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-14 00:54:53,232 INFO L231 Difference]: Finished difference. Result has 66 places, 70 transitions, 418 flow [2025-03-14 00:54:53,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=418, PETRI_PLACES=66, PETRI_TRANSITIONS=70} [2025-03-14 00:54:53,233 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2025-03-14 00:54:53,233 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 418 flow [2025-03-14 00:54:53,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:53,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:53,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:53,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:54:53,234 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:53,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:53,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2073951171, now seen corresponding path program 3 times [2025-03-14 00:54:53,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:53,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936044125] [2025-03-14 00:54:53,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:54:53,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:53,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:54:53,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:54:53,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 00:54:53,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:53,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:53,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936044125] [2025-03-14 00:54:53,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936044125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:53,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:53,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 00:54:53,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144443484] [2025-03-14 00:54:53,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:53,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 00:54:53,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:53,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 00:54:53,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-14 00:54:53,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:54:53,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 418 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:53,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:53,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:54:53,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:54,923 INFO L124 PetriNetUnfolderBase]: 389/724 cut-off events. [2025-03-14 00:54:54,923 INFO L125 PetriNetUnfolderBase]: For 910/910 co-relation queries the response was YES. [2025-03-14 00:54:54,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2417 conditions, 724 events. 389/724 cut-off events. For 910/910 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3081 event pairs, 18 based on Foata normal form. 1/725 useless extension candidates. Maximal degree in co-relation 2384. Up to 153 conditions per place. [2025-03-14 00:54:54,930 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 93 selfloop transitions, 45 changer transitions 0/140 dead transitions. [2025-03-14 00:54:54,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 140 transitions, 984 flow [2025-03-14 00:54:54,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 00:54:54,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 00:54:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 268 transitions. [2025-03-14 00:54:54,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2791666666666667 [2025-03-14 00:54:54,933 INFO L175 Difference]: Start difference. First operand has 66 places, 70 transitions, 418 flow. Second operand 16 states and 268 transitions. [2025-03-14 00:54:54,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 140 transitions, 984 flow [2025-03-14 00:54:54,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 140 transitions, 982 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 00:54:54,941 INFO L231 Difference]: Finished difference. Result has 85 places, 81 transitions, 634 flow [2025-03-14 00:54:54,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=634, PETRI_PLACES=85, PETRI_TRANSITIONS=81} [2025-03-14 00:54:54,943 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2025-03-14 00:54:54,944 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 81 transitions, 634 flow [2025-03-14 00:54:54,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:54,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:54,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] [2025-03-14 00:54:54,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 00:54:54,944 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:54,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:54,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1869156349, now seen corresponding path program 4 times [2025-03-14 00:54:54,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:54,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564579471] [2025-03-14 00:54:54,945 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:54:54,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:54,969 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-14 00:54:54,984 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:54:54,985 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 00:54:54,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:55,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:55,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:55,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564579471] [2025-03-14 00:54:55,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564579471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:55,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:55,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:54:55,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333331182] [2025-03-14 00:54:55,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:55,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:54:55,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:55,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:54:55,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:54:55,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-14 00:54:55,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 81 transitions, 634 flow. Second operand has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:55,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:55,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-14 00:54:55,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:55,712 INFO L124 PetriNetUnfolderBase]: 634/1181 cut-off events. [2025-03-14 00:54:55,712 INFO L125 PetriNetUnfolderBase]: For 3189/3189 co-relation queries the response was YES. [2025-03-14 00:54:55,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4354 conditions, 1181 events. 634/1181 cut-off events. For 3189/3189 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5932 event pairs, 102 based on Foata normal form. 8/1189 useless extension candidates. Maximal degree in co-relation 4309. Up to 369 conditions per place. [2025-03-14 00:54:55,720 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 102 selfloop transitions, 49 changer transitions 0/160 dead transitions. [2025-03-14 00:54:55,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 160 transitions, 1462 flow [2025-03-14 00:54:55,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 00:54:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 00:54:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 339 transitions. [2025-03-14 00:54:55,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5136363636363637 [2025-03-14 00:54:55,722 INFO L175 Difference]: Start difference. First operand has 85 places, 81 transitions, 634 flow. Second operand 11 states and 339 transitions. [2025-03-14 00:54:55,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 160 transitions, 1462 flow [2025-03-14 00:54:55,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 160 transitions, 1405 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-14 00:54:55,738 INFO L231 Difference]: Finished difference. Result has 95 places, 104 transitions, 999 flow [2025-03-14 00:54:55,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=999, PETRI_PLACES=95, PETRI_TRANSITIONS=104} [2025-03-14 00:54:55,739 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 42 predicate places. [2025-03-14 00:54:55,739 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 104 transitions, 999 flow [2025-03-14 00:54:55,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:55,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:55,739 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:55,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:54:55,740 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:55,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:55,740 INFO L85 PathProgramCache]: Analyzing trace with hash -564419071, now seen corresponding path program 5 times [2025-03-14 00:54:55,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:55,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208076653] [2025-03-14 00:54:55,740 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 00:54:55,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:55,757 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:54:55,769 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:54:55,770 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:54:55,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:56,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:56,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208076653] [2025-03-14 00:54:56,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208076653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:56,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:56,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:54:56,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993707253] [2025-03-14 00:54:56,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:56,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:54:56,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:56,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:54:56,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:54:56,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-14 00:54:56,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 104 transitions, 999 flow. Second operand has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:56,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:56,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-14 00:54:56,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:56,508 INFO L124 PetriNetUnfolderBase]: 646/1215 cut-off events. [2025-03-14 00:54:56,509 INFO L125 PetriNetUnfolderBase]: For 5344/5344 co-relation queries the response was YES. [2025-03-14 00:54:56,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5223 conditions, 1215 events. 646/1215 cut-off events. For 5344/5344 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6245 event pairs, 52 based on Foata normal form. 12/1227 useless extension candidates. Maximal degree in co-relation 5171. Up to 489 conditions per place. [2025-03-14 00:54:56,519 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 93 selfloop transitions, 78 changer transitions 0/180 dead transitions. [2025-03-14 00:54:56,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 180 transitions, 2010 flow [2025-03-14 00:54:56,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 00:54:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 00:54:56,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 348 transitions. [2025-03-14 00:54:56,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-14 00:54:56,521 INFO L175 Difference]: Start difference. First operand has 95 places, 104 transitions, 999 flow. Second operand 12 states and 348 transitions. [2025-03-14 00:54:56,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 180 transitions, 2010 flow [2025-03-14 00:54:56,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 180 transitions, 1947 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-14 00:54:56,542 INFO L231 Difference]: Finished difference. Result has 107 places, 135 transitions, 1580 flow [2025-03-14 00:54:56,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1580, PETRI_PLACES=107, PETRI_TRANSITIONS=135} [2025-03-14 00:54:56,543 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 54 predicate places. [2025-03-14 00:54:56,543 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 135 transitions, 1580 flow [2025-03-14 00:54:56,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:56,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:56,543 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:56,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 00:54:56,543 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:56,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:56,544 INFO L85 PathProgramCache]: Analyzing trace with hash 476794071, now seen corresponding path program 6 times [2025-03-14 00:54:56,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:56,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961826278] [2025-03-14 00:54:56,544 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 00:54:56,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:56,561 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:54:56,571 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:54:56,571 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 00:54:56,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:57,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:57,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:57,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961826278] [2025-03-14 00:54:57,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961826278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:57,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:57,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 00:54:57,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043692576] [2025-03-14 00:54:57,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:57,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 00:54:57,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:57,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 00:54:57,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-14 00:54:57,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:54:57,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 135 transitions, 1580 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:57,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:57,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:54:57,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:58,140 INFO L124 PetriNetUnfolderBase]: 646/1213 cut-off events. [2025-03-14 00:54:58,140 INFO L125 PetriNetUnfolderBase]: For 7055/7055 co-relation queries the response was YES. [2025-03-14 00:54:58,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5722 conditions, 1213 events. 646/1213 cut-off events. For 7055/7055 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6165 event pairs, 62 based on Foata normal form. 1/1214 useless extension candidates. Maximal degree in co-relation 5667. Up to 377 conditions per place. [2025-03-14 00:54:58,150 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 135 selfloop transitions, 85 changer transitions 0/222 dead transitions. [2025-03-14 00:54:58,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 222 transitions, 2584 flow [2025-03-14 00:54:58,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 00:54:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 00:54:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 293 transitions. [2025-03-14 00:54:58,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2872549019607843 [2025-03-14 00:54:58,153 INFO L175 Difference]: Start difference. First operand has 107 places, 135 transitions, 1580 flow. Second operand 17 states and 293 transitions. [2025-03-14 00:54:58,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 222 transitions, 2584 flow [2025-03-14 00:54:58,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 222 transitions, 2487 flow, removed 28 selfloop flow, removed 5 redundant places. [2025-03-14 00:54:58,178 INFO L231 Difference]: Finished difference. Result has 127 places, 150 transitions, 1979 flow [2025-03-14 00:54:58,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1979, PETRI_PLACES=127, PETRI_TRANSITIONS=150} [2025-03-14 00:54:58,180 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 74 predicate places. [2025-03-14 00:54:58,180 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 150 transitions, 1979 flow [2025-03-14 00:54:58,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:58,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:58,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:58,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 00:54:58,181 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:58,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:58,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1456827013, now seen corresponding path program 7 times [2025-03-14 00:54:58,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:58,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868738905] [2025-03-14 00:54:58,182 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 00:54:58,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:58,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:54:58,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:54:58,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:58,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:54:58,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:58,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868738905] [2025-03-14 00:54:58,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868738905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:58,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:58,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 00:54:58,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353529373] [2025-03-14 00:54:58,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:58,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 00:54:58,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:58,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 00:54:58,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-14 00:54:58,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:54:58,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 150 transitions, 1979 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:58,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:58,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:54:58,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:59,826 INFO L124 PetriNetUnfolderBase]: 868/1627 cut-off events. [2025-03-14 00:54:59,826 INFO L125 PetriNetUnfolderBase]: For 11619/11619 co-relation queries the response was YES. [2025-03-14 00:54:59,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7858 conditions, 1627 events. 868/1627 cut-off events. For 11619/11619 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8975 event pairs, 46 based on Foata normal form. 1/1628 useless extension candidates. Maximal degree in co-relation 7791. Up to 313 conditions per place. [2025-03-14 00:54:59,838 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 145 selfloop transitions, 118 changer transitions 0/265 dead transitions. [2025-03-14 00:54:59,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 265 transitions, 3495 flow [2025-03-14 00:54:59,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 00:54:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 00:54:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 305 transitions. [2025-03-14 00:54:59,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2824074074074074 [2025-03-14 00:54:59,841 INFO L175 Difference]: Start difference. First operand has 127 places, 150 transitions, 1979 flow. Second operand 18 states and 305 transitions. [2025-03-14 00:54:59,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 265 transitions, 3495 flow [2025-03-14 00:54:59,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 265 transitions, 3399 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-14 00:54:59,914 INFO L231 Difference]: Finished difference. Result has 145 places, 177 transitions, 2737 flow [2025-03-14 00:54:59,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1906, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2737, PETRI_PLACES=145, PETRI_TRANSITIONS=177} [2025-03-14 00:54:59,915 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 92 predicate places. [2025-03-14 00:54:59,915 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 177 transitions, 2737 flow [2025-03-14 00:54:59,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:54:59,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:59,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:59,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 00:54:59,917 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:59,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:59,918 INFO L85 PathProgramCache]: Analyzing trace with hash 753717213, now seen corresponding path program 8 times [2025-03-14 00:54:59,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:59,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741606446] [2025-03-14 00:54:59,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:54:59,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:59,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:54:59,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:54:59,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:54:59,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:00,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:00,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741606446] [2025-03-14 00:55:00,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741606446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:55:00,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:55:00,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:55:00,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516893865] [2025-03-14 00:55:00,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:55:00,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:55:00,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:00,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:55:00,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:55:00,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-14 00:55:00,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 177 transitions, 2737 flow. Second operand has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:00,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:00,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-14 00:55:00,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:02,004 INFO L124 PetriNetUnfolderBase]: 890/1673 cut-off events. [2025-03-14 00:55:02,004 INFO L125 PetriNetUnfolderBase]: For 15665/15665 co-relation queries the response was YES. [2025-03-14 00:55:02,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8658 conditions, 1673 events. 890/1673 cut-off events. For 15665/15665 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9425 event pairs, 132 based on Foata normal form. 8/1681 useless extension candidates. Maximal degree in co-relation 8585. Up to 481 conditions per place. [2025-03-14 00:55:02,110 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 127 selfloop transitions, 97 changer transitions 0/236 dead transitions. [2025-03-14 00:55:02,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 236 transitions, 3694 flow [2025-03-14 00:55:02,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 00:55:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 00:55:02,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 357 transitions. [2025-03-14 00:55:02,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49583333333333335 [2025-03-14 00:55:02,115 INFO L175 Difference]: Start difference. First operand has 145 places, 177 transitions, 2737 flow. Second operand 12 states and 357 transitions. [2025-03-14 00:55:02,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 236 transitions, 3694 flow [2025-03-14 00:55:02,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 236 transitions, 3604 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-14 00:55:02,187 INFO L231 Difference]: Finished difference. Result has 155 places, 188 transitions, 3138 flow [2025-03-14 00:55:02,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2659, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3138, PETRI_PLACES=155, PETRI_TRANSITIONS=188} [2025-03-14 00:55:02,189 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 102 predicate places. [2025-03-14 00:55:02,189 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 188 transitions, 3138 flow [2025-03-14 00:55:02,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.125) internal successors, (201), 8 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:02,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:02,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] [2025-03-14 00:55:02,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 00:55:02,190 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:02,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:02,190 INFO L85 PathProgramCache]: Analyzing trace with hash -323835375, now seen corresponding path program 9 times [2025-03-14 00:55:02,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:02,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053407017] [2025-03-14 00:55:02,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:55:02,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:02,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:55:02,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:55:02,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 00:55:02,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:02,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:02,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053407017] [2025-03-14 00:55:02,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053407017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:55:02,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:55:02,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 00:55:02,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169356343] [2025-03-14 00:55:02,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:55:02,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 00:55:02,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:02,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 00:55:02,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-14 00:55:02,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:55:02,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 188 transitions, 3138 flow. Second operand has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:02,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:02,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:55:02,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:03,740 INFO L124 PetriNetUnfolderBase]: 890/1671 cut-off events. [2025-03-14 00:55:03,740 INFO L125 PetriNetUnfolderBase]: For 18052/18052 co-relation queries the response was YES. [2025-03-14 00:55:03,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9387 conditions, 1671 events. 890/1671 cut-off events. For 18052/18052 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9323 event pairs, 135 based on Foata normal form. 1/1672 useless extension candidates. Maximal degree in co-relation 9313. Up to 356 conditions per place. [2025-03-14 00:55:03,763 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 162 selfloop transitions, 114 changer transitions 0/277 dead transitions. [2025-03-14 00:55:03,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 277 transitions, 4352 flow [2025-03-14 00:55:03,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 00:55:03,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 00:55:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 321 transitions. [2025-03-14 00:55:03,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28157894736842104 [2025-03-14 00:55:03,765 INFO L175 Difference]: Start difference. First operand has 155 places, 188 transitions, 3138 flow. Second operand 19 states and 321 transitions. [2025-03-14 00:55:03,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 277 transitions, 4352 flow [2025-03-14 00:55:03,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 277 transitions, 4158 flow, removed 44 selfloop flow, removed 8 redundant places. [2025-03-14 00:55:03,876 INFO L231 Difference]: Finished difference. Result has 167 places, 194 transitions, 3476 flow [2025-03-14 00:55:03,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2989, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3476, PETRI_PLACES=167, PETRI_TRANSITIONS=194} [2025-03-14 00:55:03,877 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 114 predicate places. [2025-03-14 00:55:03,877 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 194 transitions, 3476 flow [2025-03-14 00:55:03,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.333333333333334) internal successors, (148), 12 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:03,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:03,878 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:55:03,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 00:55:03,879 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:03,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:03,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1999889587, now seen corresponding path program 1 times [2025-03-14 00:55:03,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:03,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916949238] [2025-03-14 00:55:03,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:55:03,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:03,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 00:55:03,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:03,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:55:03,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:04,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:04,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:04,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916949238] [2025-03-14 00:55:04,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916949238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:55:04,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:55:04,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-14 00:55:04,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058291018] [2025-03-14 00:55:04,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:55:04,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 00:55:04,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:04,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 00:55:04,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-14 00:55:04,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:55:04,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 194 transitions, 3476 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:04,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:04,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:55:04,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:05,538 INFO L124 PetriNetUnfolderBase]: 962/1815 cut-off events. [2025-03-14 00:55:05,538 INFO L125 PetriNetUnfolderBase]: For 22283/22283 co-relation queries the response was YES. [2025-03-14 00:55:05,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10206 conditions, 1815 events. 962/1815 cut-off events. For 22283/22283 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 10422 event pairs, 221 based on Foata normal form. 1/1816 useless extension candidates. Maximal degree in co-relation 9882. Up to 1421 conditions per place. [2025-03-14 00:55:05,551 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 137 selfloop transitions, 73 changer transitions 47/258 dead transitions. [2025-03-14 00:55:05,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 258 transitions, 4638 flow [2025-03-14 00:55:05,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 00:55:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 00:55:05,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 231 transitions. [2025-03-14 00:55:05,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.275 [2025-03-14 00:55:05,554 INFO L175 Difference]: Start difference. First operand has 167 places, 194 transitions, 3476 flow. Second operand 14 states and 231 transitions. [2025-03-14 00:55:05,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 258 transitions, 4638 flow [2025-03-14 00:55:05,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 258 transitions, 4449 flow, removed 18 selfloop flow, removed 11 redundant places. [2025-03-14 00:55:05,634 INFO L231 Difference]: Finished difference. Result has 174 places, 193 transitions, 3489 flow [2025-03-14 00:55:05,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3314, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3489, PETRI_PLACES=174, PETRI_TRANSITIONS=193} [2025-03-14 00:55:05,635 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 121 predicate places. [2025-03-14 00:55:05,635 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 193 transitions, 3489 flow [2025-03-14 00:55:05,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:05,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:05,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:55:05,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 00:55:05,635 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:05,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:05,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2132970693, now seen corresponding path program 2 times [2025-03-14 00:55:05,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:05,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730994763] [2025-03-14 00:55:05,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:55:05,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:05,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-14 00:55:05,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:05,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:55:05,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:06,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:06,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730994763] [2025-03-14 00:55:06,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730994763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:55:06,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:55:06,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 00:55:06,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718253983] [2025-03-14 00:55:06,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:55:06,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 00:55:06,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:06,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 00:55:06,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-14 00:55:06,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:55:06,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 193 transitions, 3489 flow. Second operand has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:06,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:06,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:55:06,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:06,945 INFO L124 PetriNetUnfolderBase]: 941/1780 cut-off events. [2025-03-14 00:55:06,945 INFO L125 PetriNetUnfolderBase]: For 20951/20951 co-relation queries the response was YES. [2025-03-14 00:55:06,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10064 conditions, 1780 events. 941/1780 cut-off events. For 20951/20951 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10224 event pairs, 295 based on Foata normal form. 1/1781 useless extension candidates. Maximal degree in co-relation 9984. Up to 1351 conditions per place. [2025-03-14 00:55:06,979 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 163 selfloop transitions, 57 changer transitions 53/274 dead transitions. [2025-03-14 00:55:06,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 274 transitions, 4909 flow [2025-03-14 00:55:07,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 00:55:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 00:55:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 233 transitions. [2025-03-14 00:55:07,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2773809523809524 [2025-03-14 00:55:07,016 INFO L175 Difference]: Start difference. First operand has 174 places, 193 transitions, 3489 flow. Second operand 14 states and 233 transitions. [2025-03-14 00:55:07,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 274 transitions, 4909 flow [2025-03-14 00:55:07,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 274 transitions, 4651 flow, removed 44 selfloop flow, removed 12 redundant places. [2025-03-14 00:55:07,128 INFO L231 Difference]: Finished difference. Result has 174 places, 194 transitions, 3377 flow [2025-03-14 00:55:07,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3274, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3377, PETRI_PLACES=174, PETRI_TRANSITIONS=194} [2025-03-14 00:55:07,133 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 121 predicate places. [2025-03-14 00:55:07,134 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 194 transitions, 3377 flow [2025-03-14 00:55:07,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:07,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:07,134 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:55:07,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 00:55:07,134 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:07,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:07,134 INFO L85 PathProgramCache]: Analyzing trace with hash 987557807, now seen corresponding path program 3 times [2025-03-14 00:55:07,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:07,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506872323] [2025-03-14 00:55:07,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:55:07,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:07,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-03-14 00:55:07,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:07,190 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 00:55:07,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:07,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:07,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506872323] [2025-03-14 00:55:07,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506872323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:55:07,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:55:07,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 00:55:07,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150524568] [2025-03-14 00:55:07,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:55:07,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 00:55:07,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:07,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 00:55:07,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-14 00:55:07,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:55:07,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 194 transitions, 3377 flow. Second operand has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:07,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:07,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:55:07,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:08,431 INFO L124 PetriNetUnfolderBase]: 808/1535 cut-off events. [2025-03-14 00:55:08,431 INFO L125 PetriNetUnfolderBase]: For 17571/17571 co-relation queries the response was YES. [2025-03-14 00:55:08,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8595 conditions, 1535 events. 808/1535 cut-off events. For 17571/17571 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8543 event pairs, 263 based on Foata normal form. 1/1536 useless extension candidates. Maximal degree in co-relation 8520. Up to 1245 conditions per place. [2025-03-14 00:55:08,441 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 132 selfloop transitions, 46 changer transitions 56/235 dead transitions. [2025-03-14 00:55:08,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 235 transitions, 4113 flow [2025-03-14 00:55:08,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 00:55:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 00:55:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 219 transitions. [2025-03-14 00:55:08,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28076923076923077 [2025-03-14 00:55:08,442 INFO L175 Difference]: Start difference. First operand has 174 places, 194 transitions, 3377 flow. Second operand 13 states and 219 transitions. [2025-03-14 00:55:08,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 235 transitions, 4113 flow [2025-03-14 00:55:08,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 235 transitions, 3922 flow, removed 10 selfloop flow, removed 10 redundant places. [2025-03-14 00:55:08,501 INFO L231 Difference]: Finished difference. Result has 175 places, 165 transitions, 2831 flow [2025-03-14 00:55:08,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3186, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2831, PETRI_PLACES=175, PETRI_TRANSITIONS=165} [2025-03-14 00:55:08,502 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 122 predicate places. [2025-03-14 00:55:08,502 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 165 transitions, 2831 flow [2025-03-14 00:55:08,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:08,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:08,502 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:55:08,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 00:55:08,504 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:08,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:08,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1072325331, now seen corresponding path program 4 times [2025-03-14 00:55:08,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:08,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729600650] [2025-03-14 00:55:08,505 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:55:08,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:08,518 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-14 00:55:08,531 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:08,531 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 00:55:08,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:08,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:08,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729600650] [2025-03-14 00:55:08,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729600650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:55:08,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:55:08,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 00:55:08,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264192931] [2025-03-14 00:55:08,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:55:08,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 00:55:08,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:08,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 00:55:08,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-14 00:55:08,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-14 00:55:08,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 165 transitions, 2831 flow. Second operand has 9 states, 9 states have (on average 24.88888888888889) internal successors, (224), 9 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:08,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:08,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-14 00:55:08,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:09,187 INFO L124 PetriNetUnfolderBase]: 654/1255 cut-off events. [2025-03-14 00:55:09,188 INFO L125 PetriNetUnfolderBase]: For 13170/13170 co-relation queries the response was YES. [2025-03-14 00:55:09,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6861 conditions, 1255 events. 654/1255 cut-off events. For 13170/13170 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6687 event pairs, 101 based on Foata normal form. 12/1267 useless extension candidates. Maximal degree in co-relation 6794. Up to 651 conditions per place. [2025-03-14 00:55:09,195 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 98 selfloop transitions, 75 changer transitions 3/186 dead transitions. [2025-03-14 00:55:09,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 186 transitions, 3158 flow [2025-03-14 00:55:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 00:55:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 00:55:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 327 transitions. [2025-03-14 00:55:09,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4954545454545455 [2025-03-14 00:55:09,196 INFO L175 Difference]: Start difference. First operand has 175 places, 165 transitions, 2831 flow. Second operand 11 states and 327 transitions. [2025-03-14 00:55:09,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 186 transitions, 3158 flow [2025-03-14 00:55:09,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 186 transitions, 2919 flow, removed 23 selfloop flow, removed 26 redundant places. [2025-03-14 00:55:09,242 INFO L231 Difference]: Finished difference. Result has 152 places, 161 transitions, 2664 flow [2025-03-14 00:55:09,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2471, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2664, PETRI_PLACES=152, PETRI_TRANSITIONS=161} [2025-03-14 00:55:09,243 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 99 predicate places. [2025-03-14 00:55:09,243 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 161 transitions, 2664 flow [2025-03-14 00:55:09,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.88888888888889) internal successors, (224), 9 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:09,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:09,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:55:09,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 00:55:09,243 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:09,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:09,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1637876969, now seen corresponding path program 5 times [2025-03-14 00:55:09,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:09,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734588971] [2025-03-14 00:55:09,244 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 00:55:09,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:09,257 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-14 00:55:09,264 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:09,265 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:55:09,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:09,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:09,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:09,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734588971] [2025-03-14 00:55:09,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734588971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:55:09,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:55:09,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 00:55:09,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809158957] [2025-03-14 00:55:09,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:55:09,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 00:55:09,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:09,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 00:55:09,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-14 00:55:09,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:55:09,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 161 transitions, 2664 flow. Second operand has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:09,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:09,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:55:09,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:10,449 INFO L124 PetriNetUnfolderBase]: 709/1358 cut-off events. [2025-03-14 00:55:10,449 INFO L125 PetriNetUnfolderBase]: For 14165/14165 co-relation queries the response was YES. [2025-03-14 00:55:10,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7319 conditions, 1358 events. 709/1358 cut-off events. For 14165/14165 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7390 event pairs, 185 based on Foata normal form. 1/1359 useless extension candidates. Maximal degree in co-relation 7221. Up to 983 conditions per place. [2025-03-14 00:55:10,456 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 116 selfloop transitions, 39 changer transitions 42/198 dead transitions. [2025-03-14 00:55:10,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 198 transitions, 3295 flow [2025-03-14 00:55:10,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 00:55:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 00:55:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 226 transitions. [2025-03-14 00:55:10,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26904761904761904 [2025-03-14 00:55:10,458 INFO L175 Difference]: Start difference. First operand has 152 places, 161 transitions, 2664 flow. Second operand 14 states and 226 transitions. [2025-03-14 00:55:10,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 198 transitions, 3295 flow [2025-03-14 00:55:10,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 198 transitions, 3141 flow, removed 10 selfloop flow, removed 9 redundant places. [2025-03-14 00:55:10,498 INFO L231 Difference]: Finished difference. Result has 158 places, 136 transitions, 2193 flow [2025-03-14 00:55:10,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2514, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2193, PETRI_PLACES=158, PETRI_TRANSITIONS=136} [2025-03-14 00:55:10,499 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 105 predicate places. [2025-03-14 00:55:10,499 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 136 transitions, 2193 flow [2025-03-14 00:55:10,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:10,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:10,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:55:10,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 00:55:10,500 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:10,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:10,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1230900875, now seen corresponding path program 6 times [2025-03-14 00:55:10,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:10,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842095388] [2025-03-14 00:55:10,500 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 00:55:10,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:10,513 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 1 equivalence classes. [2025-03-14 00:55:10,517 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:10,519 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 00:55:10,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:10,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:10,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842095388] [2025-03-14 00:55:10,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842095388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:55:10,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:55:10,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:55:10,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111348583] [2025-03-14 00:55:10,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:55:10,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:55:10,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:10,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:55:10,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:55:10,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-14 00:55:10,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 136 transitions, 2193 flow. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:10,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:10,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-14 00:55:10,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:10,992 INFO L124 PetriNetUnfolderBase]: 521/1018 cut-off events. [2025-03-14 00:55:10,992 INFO L125 PetriNetUnfolderBase]: For 9773/9773 co-relation queries the response was YES. [2025-03-14 00:55:10,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5385 conditions, 1018 events. 521/1018 cut-off events. For 9773/9773 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5247 event pairs, 58 based on Foata normal form. 18/1036 useless extension candidates. Maximal degree in co-relation 5328. Up to 408 conditions per place. [2025-03-14 00:55:10,997 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 93 selfloop transitions, 69 changer transitions 0/171 dead transitions. [2025-03-14 00:55:10,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 171 transitions, 2593 flow [2025-03-14 00:55:10,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 00:55:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 00:55:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 354 transitions. [2025-03-14 00:55:10,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2025-03-14 00:55:10,998 INFO L175 Difference]: Start difference. First operand has 158 places, 136 transitions, 2193 flow. Second operand 12 states and 354 transitions. [2025-03-14 00:55:10,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 171 transitions, 2593 flow [2025-03-14 00:55:11,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 171 transitions, 2230 flow, removed 29 selfloop flow, removed 25 redundant places. [2025-03-14 00:55:11,024 INFO L231 Difference]: Finished difference. Result has 126 places, 140 transitions, 2007 flow [2025-03-14 00:55:11,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1741, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2007, PETRI_PLACES=126, PETRI_TRANSITIONS=140} [2025-03-14 00:55:11,024 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 73 predicate places. [2025-03-14 00:55:11,024 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 140 transitions, 2007 flow [2025-03-14 00:55:11,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:11,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:11,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:55:11,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 00:55:11,025 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:11,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:11,025 INFO L85 PathProgramCache]: Analyzing trace with hash -101881355, now seen corresponding path program 7 times [2025-03-14 00:55:11,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:11,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896367834] [2025-03-14 00:55:11,025 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 00:55:11,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:11,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 00:55:11,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:11,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:55:11,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:11,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:11,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896367834] [2025-03-14 00:55:11,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896367834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:55:11,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:55:11,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-14 00:55:11,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147001539] [2025-03-14 00:55:11,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:55:11,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 00:55:11,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:11,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 00:55:11,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-14 00:55:11,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:55:11,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 140 transitions, 2007 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:11,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:11,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:55:11,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:12,146 INFO L124 PetriNetUnfolderBase]: 587/1156 cut-off events. [2025-03-14 00:55:12,146 INFO L125 PetriNetUnfolderBase]: For 10479/10479 co-relation queries the response was YES. [2025-03-14 00:55:12,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6024 conditions, 1156 events. 587/1156 cut-off events. For 10479/10479 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6134 event pairs, 118 based on Foata normal form. 1/1157 useless extension candidates. Maximal degree in co-relation 5628. Up to 664 conditions per place. [2025-03-14 00:55:12,153 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 116 selfloop transitions, 48 changer transitions 35/200 dead transitions. [2025-03-14 00:55:12,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 200 transitions, 3000 flow [2025-03-14 00:55:12,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 00:55:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 00:55:12,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 223 transitions. [2025-03-14 00:55:12,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2654761904761905 [2025-03-14 00:55:12,154 INFO L175 Difference]: Start difference. First operand has 126 places, 140 transitions, 2007 flow. Second operand 14 states and 223 transitions. [2025-03-14 00:55:12,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 200 transitions, 3000 flow [2025-03-14 00:55:12,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 200 transitions, 2890 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-03-14 00:55:12,185 INFO L231 Difference]: Finished difference. Result has 134 places, 140 transitions, 2031 flow [2025-03-14 00:55:12,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1909, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2031, PETRI_PLACES=134, PETRI_TRANSITIONS=140} [2025-03-14 00:55:12,186 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 81 predicate places. [2025-03-14 00:55:12,186 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 140 transitions, 2031 flow [2025-03-14 00:55:12,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:12,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:12,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:55:12,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 00:55:12,186 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:12,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:12,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1872020603, now seen corresponding path program 8 times [2025-03-14 00:55:12,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:12,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713078348] [2025-03-14 00:55:12,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:55:12,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:12,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 00:55:12,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:12,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:55:12,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:12,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:12,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713078348] [2025-03-14 00:55:12,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713078348] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:55:12,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160245342] [2025-03-14 00:55:12,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:55:12,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:55:12,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:55:12,732 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:55:12,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 00:55:12,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 00:55:12,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:12,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:55:12,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:12,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-14 00:55:12,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:55:12,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-14 00:55:13,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2025-03-14 00:55:13,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:55:13,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-14 00:55:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:13,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:55:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:13,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160245342] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:55:13,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:55:13,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2025-03-14 00:55:13,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575439551] [2025-03-14 00:55:13,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:55:13,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-14 00:55:13,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:13,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-14 00:55:13,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2025-03-14 00:55:13,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:55:13,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 140 transitions, 2031 flow. Second operand has 30 states, 30 states have (on average 12.6) internal successors, (378), 30 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:13,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:13,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:55:13,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:15,033 INFO L124 PetriNetUnfolderBase]: 495/982 cut-off events. [2025-03-14 00:55:15,033 INFO L125 PetriNetUnfolderBase]: For 8853/8853 co-relation queries the response was YES. [2025-03-14 00:55:15,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5139 conditions, 982 events. 495/982 cut-off events. For 8853/8853 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5015 event pairs, 44 based on Foata normal form. 1/983 useless extension candidates. Maximal degree in co-relation 5088. Up to 569 conditions per place. [2025-03-14 00:55:15,040 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 86 selfloop transitions, 62 changer transitions 42/191 dead transitions. [2025-03-14 00:55:15,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 191 transitions, 2800 flow [2025-03-14 00:55:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 00:55:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 00:55:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 302 transitions. [2025-03-14 00:55:15,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2649122807017544 [2025-03-14 00:55:15,063 INFO L175 Difference]: Start difference. First operand has 134 places, 140 transitions, 2031 flow. Second operand 19 states and 302 transitions. [2025-03-14 00:55:15,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 191 transitions, 2800 flow [2025-03-14 00:55:15,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 191 transitions, 2644 flow, removed 16 selfloop flow, removed 11 redundant places. [2025-03-14 00:55:15,094 INFO L231 Difference]: Finished difference. Result has 139 places, 126 transitions, 1796 flow [2025-03-14 00:55:15,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1888, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1796, PETRI_PLACES=139, PETRI_TRANSITIONS=126} [2025-03-14 00:55:15,094 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 86 predicate places. [2025-03-14 00:55:15,094 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 126 transitions, 1796 flow [2025-03-14 00:55:15,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 12.6) internal successors, (378), 30 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:15,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:15,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:55:15,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 00:55:15,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-14 00:55:15,299 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:15,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:15,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1005705399, now seen corresponding path program 9 times [2025-03-14 00:55:15,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:15,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946303658] [2025-03-14 00:55:15,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:55:15,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:15,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-03-14 00:55:15,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:15,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 00:55:15,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:15,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:15,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:15,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946303658] [2025-03-14 00:55:15,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946303658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:55:15,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:55:15,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 00:55:15,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059744417] [2025-03-14 00:55:15,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:55:15,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 00:55:15,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:15,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 00:55:15,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-14 00:55:15,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-14 00:55:15,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 126 transitions, 1796 flow. Second operand has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:15,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:15,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-14 00:55:15,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:16,188 INFO L124 PetriNetUnfolderBase]: 284/607 cut-off events. [2025-03-14 00:55:16,189 INFO L125 PetriNetUnfolderBase]: For 5190/5190 co-relation queries the response was YES. [2025-03-14 00:55:16,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3056 conditions, 607 events. 284/607 cut-off events. For 5190/5190 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2818 event pairs, 32 based on Foata normal form. 18/625 useless extension candidates. Maximal degree in co-relation 2850. Up to 145 conditions per place. [2025-03-14 00:55:16,200 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 76 selfloop transitions, 56 changer transitions 10/150 dead transitions. [2025-03-14 00:55:16,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 150 transitions, 2062 flow [2025-03-14 00:55:16,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 00:55:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 00:55:16,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 356 transitions. [2025-03-14 00:55:16,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2025-03-14 00:55:16,202 INFO L175 Difference]: Start difference. First operand has 139 places, 126 transitions, 1796 flow. Second operand 12 states and 356 transitions. [2025-03-14 00:55:16,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 150 transitions, 2062 flow [2025-03-14 00:55:16,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 150 transitions, 1849 flow, removed 18 selfloop flow, removed 18 redundant places. [2025-03-14 00:55:16,218 INFO L231 Difference]: Finished difference. Result has 130 places, 117 transitions, 1623 flow [2025-03-14 00:55:16,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1403, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1623, PETRI_PLACES=130, PETRI_TRANSITIONS=117} [2025-03-14 00:55:16,221 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 77 predicate places. [2025-03-14 00:55:16,221 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 117 transitions, 1623 flow [2025-03-14 00:55:16,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.25) internal successors, (202), 8 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:16,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:16,221 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:55:16,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 00:55:16,222 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:16,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:16,225 INFO L85 PathProgramCache]: Analyzing trace with hash 76991465, now seen corresponding path program 10 times [2025-03-14 00:55:16,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:16,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461315271] [2025-03-14 00:55:16,226 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:55:16,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:16,279 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-14 00:55:16,291 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:16,291 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 00:55:16,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:16,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:16,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461315271] [2025-03-14 00:55:16,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461315271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:55:16,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:55:16,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 00:55:16,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195246543] [2025-03-14 00:55:16,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:55:16,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 00:55:16,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:16,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 00:55:16,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-14 00:55:16,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:55:16,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 117 transitions, 1623 flow. Second operand has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:16,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:16,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:55:16,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:17,312 INFO L124 PetriNetUnfolderBase]: 276/579 cut-off events. [2025-03-14 00:55:17,312 INFO L125 PetriNetUnfolderBase]: For 5266/5266 co-relation queries the response was YES. [2025-03-14 00:55:17,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2997 conditions, 579 events. 276/579 cut-off events. For 5266/5266 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2530 event pairs, 69 based on Foata normal form. 1/580 useless extension candidates. Maximal degree in co-relation 2618. Up to 324 conditions per place. [2025-03-14 00:55:17,315 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 74 selfloop transitions, 30 changer transitions 39/144 dead transitions. [2025-03-14 00:55:17,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 144 transitions, 2049 flow [2025-03-14 00:55:17,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 00:55:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 00:55:17,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 236 transitions. [2025-03-14 00:55:17,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26222222222222225 [2025-03-14 00:55:17,316 INFO L175 Difference]: Start difference. First operand has 130 places, 117 transitions, 1623 flow. Second operand 15 states and 236 transitions. [2025-03-14 00:55:17,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 144 transitions, 2049 flow [2025-03-14 00:55:17,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 144 transitions, 1872 flow, removed 26 selfloop flow, removed 11 redundant places. [2025-03-14 00:55:17,331 INFO L231 Difference]: Finished difference. Result has 134 places, 90 transitions, 1171 flow [2025-03-14 00:55:17,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1171, PETRI_PLACES=134, PETRI_TRANSITIONS=90} [2025-03-14 00:55:17,332 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 81 predicate places. [2025-03-14 00:55:17,332 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 90 transitions, 1171 flow [2025-03-14 00:55:17,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:17,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:17,333 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:55:17,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 00:55:17,333 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:17,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:17,333 INFO L85 PathProgramCache]: Analyzing trace with hash -287839179, now seen corresponding path program 11 times [2025-03-14 00:55:17,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:17,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003660812] [2025-03-14 00:55:17,333 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 00:55:17,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:17,347 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 00:55:17,355 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:17,355 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:55:17,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:18,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:18,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003660812] [2025-03-14 00:55:18,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003660812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:55:18,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369298690] [2025-03-14 00:55:18,019 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 00:55:18,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:55:18,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:55:18,021 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:55:18,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 00:55:18,137 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 00:55:18,188 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:18,188 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:55:18,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:18,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-14 00:55:18,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:55:18,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-14 00:55:18,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-03-14 00:55:18,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:55:18,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-14 00:55:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:18,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:55:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:18,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369298690] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:55:18,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:55:18,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2025-03-14 00:55:18,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202015948] [2025-03-14 00:55:18,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:55:18,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-14 00:55:18,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:18,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-14 00:55:18,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2025-03-14 00:55:18,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:55:18,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 90 transitions, 1171 flow. Second operand has 27 states, 27 states have (on average 13.074074074074074) internal successors, (353), 27 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:18,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:18,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:55:18,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:19,509 INFO L124 PetriNetUnfolderBase]: 214/447 cut-off events. [2025-03-14 00:55:19,510 INFO L125 PetriNetUnfolderBase]: For 3648/3648 co-relation queries the response was YES. [2025-03-14 00:55:19,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2151 conditions, 447 events. 214/447 cut-off events. For 3648/3648 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1787 event pairs, 30 based on Foata normal form. 1/448 useless extension candidates. Maximal degree in co-relation 2111. Up to 130 conditions per place. [2025-03-14 00:55:19,512 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 63 selfloop transitions, 28 changer transitions 32/124 dead transitions. [2025-03-14 00:55:19,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 124 transitions, 1563 flow [2025-03-14 00:55:19,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 00:55:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 00:55:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 242 transitions. [2025-03-14 00:55:19,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2520833333333333 [2025-03-14 00:55:19,513 INFO L175 Difference]: Start difference. First operand has 134 places, 90 transitions, 1171 flow. Second operand 16 states and 242 transitions. [2025-03-14 00:55:19,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 124 transitions, 1563 flow [2025-03-14 00:55:19,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 124 transitions, 1308 flow, removed 11 selfloop flow, removed 28 redundant places. [2025-03-14 00:55:19,521 INFO L231 Difference]: Finished difference. Result has 107 places, 76 transitions, 776 flow [2025-03-14 00:55:19,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=776, PETRI_PLACES=107, PETRI_TRANSITIONS=76} [2025-03-14 00:55:19,522 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 54 predicate places. [2025-03-14 00:55:19,522 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 76 transitions, 776 flow [2025-03-14 00:55:19,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 13.074074074074074) internal successors, (353), 27 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:19,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:19,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:55:19,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 00:55:19,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-14 00:55:19,723 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:19,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:19,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1914859863, now seen corresponding path program 12 times [2025-03-14 00:55:19,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:19,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787281521] [2025-03-14 00:55:19,723 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 00:55:19,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:19,736 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-14 00:55:19,741 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:19,741 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 00:55:19,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:20,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:20,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:20,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787281521] [2025-03-14 00:55:20,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787281521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:55:20,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049936022] [2025-03-14 00:55:20,239 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 00:55:20,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:55:20,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:55:20,241 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:55:20,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 00:55:20,367 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-14 00:55:20,399 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:20,399 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 00:55:20,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:20,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-14 00:55:20,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:55:20,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-14 00:55:20,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2025-03-14 00:55:20,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:55:20,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-14 00:55:20,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:20,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:55:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:21,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049936022] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:55:21,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:55:21,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2025-03-14 00:55:21,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146135962] [2025-03-14 00:55:21,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:55:21,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-14 00:55:21,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:21,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-14 00:55:21,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2025-03-14 00:55:21,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:55:21,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 76 transitions, 776 flow. Second operand has 30 states, 30 states have (on average 12.666666666666666) internal successors, (380), 30 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:21,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:21,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:55:21,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:21,954 INFO L124 PetriNetUnfolderBase]: 143/302 cut-off events. [2025-03-14 00:55:21,954 INFO L125 PetriNetUnfolderBase]: For 1664/1664 co-relation queries the response was YES. [2025-03-14 00:55:21,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1333 conditions, 302 events. 143/302 cut-off events. For 1664/1664 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1019 event pairs, 9 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 1313. Up to 103 conditions per place. [2025-03-14 00:55:21,956 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 37 selfloop transitions, 20 changer transitions 47/105 dead transitions. [2025-03-14 00:55:21,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 105 transitions, 1091 flow [2025-03-14 00:55:21,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 00:55:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 00:55:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 274 transitions. [2025-03-14 00:55:21,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24035087719298245 [2025-03-14 00:55:21,958 INFO L175 Difference]: Start difference. First operand has 107 places, 76 transitions, 776 flow. Second operand 19 states and 274 transitions. [2025-03-14 00:55:21,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 105 transitions, 1091 flow [2025-03-14 00:55:21,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 105 transitions, 952 flow, removed 3 selfloop flow, removed 19 redundant places. [2025-03-14 00:55:21,962 INFO L231 Difference]: Finished difference. Result has 100 places, 52 transitions, 402 flow [2025-03-14 00:55:21,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=402, PETRI_PLACES=100, PETRI_TRANSITIONS=52} [2025-03-14 00:55:21,962 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 47 predicate places. [2025-03-14 00:55:21,962 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 52 transitions, 402 flow [2025-03-14 00:55:21,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 12.666666666666666) internal successors, (380), 30 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:21,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:21,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:55:21,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 00:55:22,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:55:22,164 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:22,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:22,164 INFO L85 PathProgramCache]: Analyzing trace with hash -445674559, now seen corresponding path program 13 times [2025-03-14 00:55:22,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:22,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361116742] [2025-03-14 00:55:22,164 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 00:55:22,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:22,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 00:55:22,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:22,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:55:22,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:23,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:23,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:23,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361116742] [2025-03-14 00:55:23,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361116742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:55:23,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270341216] [2025-03-14 00:55:23,083 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 00:55:23,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:55:23,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:55:23,085 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:55:23,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 00:55:23,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 00:55:23,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:23,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:55:23,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:23,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-14 00:55:23,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:55:23,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-14 00:55:23,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-03-14 00:55:23,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:55:23,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-14 00:55:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:23,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:55:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:24,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270341216] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:55:24,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:55:24,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2025-03-14 00:55:24,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43004653] [2025-03-14 00:55:24,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:55:24,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-14 00:55:24,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:24,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-14 00:55:24,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2025-03-14 00:55:24,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:55:24,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 52 transitions, 402 flow. Second operand has 31 states, 31 states have (on average 12.806451612903226) internal successors, (397), 31 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:24,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:24,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:55:24,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:24,748 INFO L124 PetriNetUnfolderBase]: 74/159 cut-off events. [2025-03-14 00:55:24,748 INFO L125 PetriNetUnfolderBase]: For 658/658 co-relation queries the response was YES. [2025-03-14 00:55:24,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 159 events. 74/159 cut-off events. For 658/658 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 369 event pairs, 2 based on Foata normal form. 1/160 useless extension candidates. Maximal degree in co-relation 639. Up to 37 conditions per place. [2025-03-14 00:55:24,749 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 0 selfloop transitions, 0 changer transitions 64/64 dead transitions. [2025-03-14 00:55:24,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 64 transitions, 551 flow [2025-03-14 00:55:24,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 00:55:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 00:55:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 218 transitions. [2025-03-14 00:55:24,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22708333333333333 [2025-03-14 00:55:24,750 INFO L175 Difference]: Start difference. First operand has 100 places, 52 transitions, 402 flow. Second operand 16 states and 218 transitions. [2025-03-14 00:55:24,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 64 transitions, 551 flow [2025-03-14 00:55:24,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 64 transitions, 388 flow, removed 9 selfloop flow, removed 30 redundant places. [2025-03-14 00:55:24,752 INFO L231 Difference]: Finished difference. Result has 70 places, 0 transitions, 0 flow [2025-03-14 00:55:24,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=0, PETRI_PLACES=70, PETRI_TRANSITIONS=0} [2025-03-14 00:55:24,752 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 17 predicate places. [2025-03-14 00:55:24,752 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 0 transitions, 0 flow [2025-03-14 00:55:24,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 12.806451612903226) internal successors, (397), 31 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 00:55:24,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-03-14 00:55:24,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-03-14 00:55:24,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-03-14 00:55:24,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-03-14 00:55:24,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-03-14 00:55:24,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-03-14 00:55:24,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-03-14 00:55:24,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-03-14 00:55:24,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-14 00:55:24,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-14 00:55:24,956 INFO L422 BasicCegarLoop]: Path program histogram: [13, 9, 1, 1, 1, 1] [2025-03-14 00:55:24,959 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:55:24,959 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:55:24,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 12:55:24 BasicIcfg [2025-03-14 00:55:24,963 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:55:24,963 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:55:24,963 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:55:24,963 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:55:24,964 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:49" (3/4) ... [2025-03-14 00:55:24,965 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 00:55:24,968 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-03-14 00:55:24,972 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 100 nodes and edges [2025-03-14 00:55:24,973 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-03-14 00:55:24,973 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-14 00:55:24,973 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 00:55:25,033 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:55:25,034 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:55:25,034 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:55:25,035 INFO L158 Benchmark]: Toolchain (without parser) took 37081.62ms. Allocated memory was 201.3MB in the beginning and 755.0MB in the end (delta: 553.6MB). Free memory was 152.2MB in the beginning and 265.5MB in the end (delta: -113.3MB). Peak memory consumption was 437.6MB. Max. memory is 16.1GB. [2025-03-14 00:55:25,035 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:55:25,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.73ms. Allocated memory is still 201.3MB. Free memory was 151.8MB in the beginning and 121.0MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-14 00:55:25,035 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.62ms. Allocated memory is still 201.3MB. Free memory was 121.0MB in the beginning and 118.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:55:25,035 INFO L158 Benchmark]: Boogie Preprocessor took 39.86ms. Allocated memory is still 201.3MB. Free memory was 118.5MB in the beginning and 115.4MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:55:25,035 INFO L158 Benchmark]: IcfgBuilder took 703.58ms. Allocated memory is still 201.3MB. Free memory was 115.4MB in the beginning and 72.7MB in the end (delta: 42.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-14 00:55:25,036 INFO L158 Benchmark]: TraceAbstraction took 35762.52ms. Allocated memory was 201.3MB in the beginning and 755.0MB in the end (delta: 553.6MB). Free memory was 72.3MB in the beginning and 273.8MB in the end (delta: -201.5MB). Peak memory consumption was 353.7MB. Max. memory is 16.1GB. [2025-03-14 00:55:25,036 INFO L158 Benchmark]: Witness Printer took 70.44ms. Allocated memory is still 755.0MB. Free memory was 273.8MB in the beginning and 265.5MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:55:25,037 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.73ms. Allocated memory is still 201.3MB. Free memory was 151.8MB in the beginning and 121.0MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.62ms. Allocated memory is still 201.3MB. Free memory was 121.0MB in the beginning and 118.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.86ms. Allocated memory is still 201.3MB. Free memory was 118.5MB in the beginning and 115.4MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 703.58ms. Allocated memory is still 201.3MB. Free memory was 115.4MB in the beginning and 72.7MB in the end (delta: 42.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 35762.52ms. Allocated memory was 201.3MB in the beginning and 755.0MB in the end (delta: 553.6MB). Free memory was 72.3MB in the beginning and 273.8MB in the end (delta: -201.5MB). Peak memory consumption was 353.7MB. Max. memory is 16.1GB. * Witness Printer took 70.44ms. Allocated memory is still 755.0MB. Free memory was 273.8MB in the beginning and 265.5MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 60 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.7s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.0s, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3057 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2942 mSDsluCounter, 2729 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2669 mSDsCounter, 324 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10885 IncrementalHoareTripleChecker+Invalid, 11209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 324 mSolverCounterUnsat, 60 mSDtfsCounter, 10885 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 708 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 470 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2243 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3489occurred in iteration=14, InterpolantAutomatonStates: 332, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 833 NumberOfCodeBlocks, 833 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 923 ConstructedInterpolants, 0 QuantifiedInterpolants, 14656 SizeOfPredicates, 117 NumberOfNonLiveVariables, 1280 ConjunctsInSsa, 258 ConjunctsInUnsatCore, 34 InterpolantComputations, 22 PerfectInterpolantSequences, 0/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 00:55:25,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE