./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-2_1-container_of.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash edceb7bcc6473f68e1454dc7ab02ec33e8dca99fdd725419b9e71852c466530e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:31:41,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:31:41,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:31:41,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:31:41,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:31:41,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:31:41,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:31:41,878 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:31:41,878 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:31:41,879 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:31:41,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:31:41,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:31:41,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:31:41,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:31:41,879 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:31:41,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:31:41,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:31:41,880 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:31:41,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:31:41,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:31:41,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:31:41,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:31:41,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:31:41,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:31:41,881 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:31:41,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:31:41,881 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:31:41,881 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:31:41,881 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:31:41,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:31:41,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:31:41,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:31:41,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:31:41,882 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:31:41,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:31:41,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:31:41,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:31:41,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:31:41,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:31:41,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:31:41,883 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:31:41,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:31:41,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:31:41,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:31:41,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:31:41,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:31:41,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:31:41,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:31:41,884 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> edceb7bcc6473f68e1454dc7ab02ec33e8dca99fdd725419b9e71852c466530e [2025-01-09 16:31:42,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:31:42,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:31:42,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:31:42,200 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:31:42,200 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:31:42,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2025-01-09 16:31:43,653 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e8f81c2d/ead57688554e4b79b8267f85816c4958/FLAGd75839c5a [2025-01-09 16:31:44,017 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:31:44,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2025-01-09 16:31:44,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e8f81c2d/ead57688554e4b79b8267f85816c4958/FLAGd75839c5a [2025-01-09 16:31:44,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e8f81c2d/ead57688554e4b79b8267f85816c4958 [2025-01-09 16:31:44,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:31:44,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:31:44,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:31:44,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:31:44,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:31:44,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:31:44" (1/1) ... [2025-01-09 16:31:44,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12e8e9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:44, skipping insertion in model container [2025-01-09 16:31:44,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:31:44" (1/1) ... [2025-01-09 16:31:44,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:31:44,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i[186203,186216] [2025-01-09 16:31:44,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:31:44,506 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:31:44,575 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i[186203,186216] [2025-01-09 16:31:44,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:31:44,648 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:31:44,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:44 WrapperNode [2025-01-09 16:31:44,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:31:44,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:31:44,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:31:44,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:31:44,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:44" (1/1) ... [2025-01-09 16:31:44,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:44" (1/1) ... [2025-01-09 16:31:44,710 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 126 [2025-01-09 16:31:44,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:31:44,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:31:44,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:31:44,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:31:44,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:44" (1/1) ... [2025-01-09 16:31:44,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:44" (1/1) ... [2025-01-09 16:31:44,726 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:44" (1/1) ... [2025-01-09 16:31:44,752 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-01-09 16:31:44,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:44" (1/1) ... [2025-01-09 16:31:44,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:44" (1/1) ... [2025-01-09 16:31:44,774 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:44" (1/1) ... [2025-01-09 16:31:44,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:44" (1/1) ... [2025-01-09 16:31:44,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:44" (1/1) ... [2025-01-09 16:31:44,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:44" (1/1) ... [2025-01-09 16:31:44,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:44" (1/1) ... [2025-01-09 16:31:44,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:31:44,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:31:44,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:31:44,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:31:44,799 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:44" (1/1) ... [2025-01-09 16:31:44,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:31:44,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:31:44,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:31:44,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:31:44,871 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-01-09 16:31:44,871 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-01-09 16:31:44,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 16:31:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 16:31:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:31:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:31:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:31:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 16:31:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:31:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:31:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 16:31:44,872 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:31:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:31:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 16:31:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 16:31:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 16:31:44,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:31:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:31:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 16:31:44,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:31:44,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:31:44,875 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:31:45,163 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:31:45,165 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:31:45,419 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:31:45,420 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:31:45,564 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:31:45,564 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:31:45,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:31:45 BoogieIcfgContainer [2025-01-09 16:31:45,564 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:31:45,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:31:45,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:31:45,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:31:45,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:31:44" (1/3) ... [2025-01-09 16:31:45,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568e8afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:31:45, skipping insertion in model container [2025-01-09 16:31:45,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:44" (2/3) ... [2025-01-09 16:31:45,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568e8afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:31:45, skipping insertion in model container [2025-01-09 16:31:45,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:31:45" (3/3) ... [2025-01-09 16:31:45,578 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2025-01-09 16:31:45,592 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:31:45,593 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-01-09 16:31:45,594 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:31:45,656 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:31:45,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 134 flow [2025-01-09 16:31:45,741 INFO L124 PetriNetUnfolderBase]: 10/73 cut-off events. [2025-01-09 16:31:45,743 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:31:45,746 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 7. Compared 136 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-01-09 16:31:45,748 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 60 transitions, 134 flow [2025-01-09 16:31:45,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 53 transitions, 118 flow [2025-01-09 16:31:45,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:31:45,772 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;@2fc35058, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:31:45,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-09 16:31:45,778 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:31:45,780 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-01-09 16:31:45,780 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:31:45,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:45,781 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-09 16:31:45,781 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:31:45,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:45,787 INFO L85 PathProgramCache]: Analyzing trace with hash 13054026, now seen corresponding path program 1 times [2025-01-09 16:31:45,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:45,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785052072] [2025-01-09 16:31:45,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:45,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:45,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 16:31:45,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 16:31:45,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:45,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:46,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:46,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785052072] [2025-01-09 16:31:46,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785052072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:46,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:46,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:31:46,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234928016] [2025-01-09 16:31:46,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:46,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:31:46,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:46,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:31:46,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:31:46,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-01-09 16:31:46,424 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-01-09 16:31:46,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:46,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-01-09 16:31:46,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:46,731 INFO L124 PetriNetUnfolderBase]: 466/835 cut-off events. [2025-01-09 16:31:46,732 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 16:31:46,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1660 conditions, 835 events. 466/835 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3555 event pairs, 345 based on Foata normal form. 3/834 useless extension candidates. Maximal degree in co-relation 1550. Up to 602 conditions per place. [2025-01-09 16:31:46,744 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 39 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2025-01-09 16:31:46,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 218 flow [2025-01-09 16:31:46,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:31:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:31:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-01-09 16:31:46,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-01-09 16:31:46,762 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 118 flow. Second operand 3 states and 84 transitions. [2025-01-09 16:31:46,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 218 flow [2025-01-09 16:31:46,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:31:46,771 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 112 flow [2025-01-09 16:31:46,774 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-01-09 16:31:46,779 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2025-01-09 16:31:46,780 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 112 flow [2025-01-09 16:31:46,780 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-01-09 16:31:46,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:46,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 16:31:46,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:31:46,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:31:46,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:46,781 INFO L85 PathProgramCache]: Analyzing trace with hash -339911441, now seen corresponding path program 1 times [2025-01-09 16:31:46,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:46,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712804730] [2025-01-09 16:31:46,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:46,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:46,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 16:31:46,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 16:31:46,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:46,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:47,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:47,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712804730] [2025-01-09 16:31:47,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712804730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:47,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:47,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:31:47,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801352399] [2025-01-09 16:31:47,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:47,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:31:47,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:47,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:31:47,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:31:47,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-01-09 16:31:47,031 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-01-09 16:31:47,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:47,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-01-09 16:31:47,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:47,272 INFO L124 PetriNetUnfolderBase]: 466/821 cut-off events. [2025-01-09 16:31:47,272 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-01-09 16:31:47,274 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 45. Compared 3485 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-01-09 16:31:47,282 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 47 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2025-01-09 16:31:47,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 265 flow [2025-01-09 16:31:47,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:31:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:31:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-01-09 16:31:47,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2025-01-09 16:31:47,285 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 112 flow. Second operand 5 states and 109 transitions. [2025-01-09 16:31:47,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 265 flow [2025-01-09 16:31:47,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:31:47,291 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 126 flow [2025-01-09 16:31:47,292 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-01-09 16:31:47,292 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2025-01-09 16:31:47,292 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 126 flow [2025-01-09 16:31:47,295 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-01-09 16:31:47,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:47,297 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:31:47,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:31:47,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:31:47,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:47,298 INFO L85 PathProgramCache]: Analyzing trace with hash 80723095, now seen corresponding path program 1 times [2025-01-09 16:31:47,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:47,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647765144] [2025-01-09 16:31:47,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:47,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:47,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:31:47,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:31:47,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:47,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:47,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:47,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647765144] [2025-01-09 16:31:47,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647765144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:47,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:47,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:31:47,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800939617] [2025-01-09 16:31:47,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:47,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:31:47,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:47,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:31:47,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:31:47,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-01-09 16:31:47,539 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-01-09 16:31:47,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:47,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-01-09 16:31:47,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:47,809 INFO L124 PetriNetUnfolderBase]: 562/1029 cut-off events. [2025-01-09 16:31:47,809 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-01-09 16:31:47,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2319 conditions, 1029 events. 562/1029 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4890 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-01-09 16:31:47,819 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 49 selfloop transitions, 10 changer transitions 4/67 dead transitions. [2025-01-09 16:31:47,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 306 flow [2025-01-09 16:31:47,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:31:47,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:31:47,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-01-09 16:31:47,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-01-09 16:31:47,822 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 126 flow. Second operand 4 states and 102 transitions. [2025-01-09 16:31:47,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 306 flow [2025-01-09 16:31:47,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:31:47,826 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 150 flow [2025-01-09 16:31:47,827 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-01-09 16:31:47,828 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2025-01-09 16:31:47,828 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 150 flow [2025-01-09 16:31:47,828 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-01-09 16:31:47,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:47,829 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-01-09 16:31:47,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:31:47,829 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:31:47,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:47,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1652907070, now seen corresponding path program 1 times [2025-01-09 16:31:47,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:47,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795012242] [2025-01-09 16:31:47,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:47,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:47,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:31:47,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:31:47,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:47,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:47,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:47,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795012242] [2025-01-09 16:31:47,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795012242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:47,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:47,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:31:47,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062320178] [2025-01-09 16:31:47,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:47,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:31:47,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:47,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:31:47,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:31:47,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-01-09 16:31:47,977 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-01-09 16:31:47,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:47,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-01-09 16:31:47,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:48,151 INFO L124 PetriNetUnfolderBase]: 225/408 cut-off events. [2025-01-09 16:31:48,151 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-01-09 16:31:48,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 408 events. 225/408 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1435 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-01-09 16:31:48,154 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 48 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-01-09 16:31:48,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 278 flow [2025-01-09 16:31:48,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:31:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:31:48,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-01-09 16:31:48,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2025-01-09 16:31:48,156 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 150 flow. Second operand 4 states and 131 transitions. [2025-01-09 16:31:48,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 278 flow [2025-01-09 16:31:48,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 248 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-01-09 16:31:48,158 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 96 flow [2025-01-09 16:31:48,161 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-01-09 16:31:48,162 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -12 predicate places. [2025-01-09 16:31:48,163 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 96 flow [2025-01-09 16:31:48,163 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-01-09 16:31:48,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:48,163 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-01-09 16:31:48,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:31:48,163 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:31:48,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:48,164 INFO L85 PathProgramCache]: Analyzing trace with hash -62179198, now seen corresponding path program 1 times [2025-01-09 16:31:48,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:48,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844956010] [2025-01-09 16:31:48,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:48,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:48,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:31:48,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:31:48,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:48,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:48,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:48,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844956010] [2025-01-09 16:31:48,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844956010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:48,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:48,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:31:48,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339641016] [2025-01-09 16:31:48,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:48,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:31:48,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:48,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:31:48,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:31:48,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-01-09 16:31:48,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 96 flow. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:48,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:48,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-01-09 16:31:48,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:49,352 INFO L124 PetriNetUnfolderBase]: 483/862 cut-off events. [2025-01-09 16:31:49,353 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-01-09 16:31:49,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2098 conditions, 862 events. 483/862 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3897 event pairs, 64 based on Foata normal form. 8/868 useless extension candidates. Maximal degree in co-relation 366. Up to 223 conditions per place. [2025-01-09 16:31:49,360 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 83 selfloop transitions, 23 changer transitions 0/113 dead transitions. [2025-01-09 16:31:49,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 113 transitions, 539 flow [2025-01-09 16:31:49,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:31:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:31:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 317 transitions. [2025-01-09 16:31:49,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5283333333333333 [2025-01-09 16:31:49,363 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 96 flow. Second operand 10 states and 317 transitions. [2025-01-09 16:31:49,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 113 transitions, 539 flow [2025-01-09 16:31:49,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 113 transitions, 519 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:31:49,368 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 272 flow [2025-01-09 16:31:49,368 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=272, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2025-01-09 16:31:49,368 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2025-01-09 16:31:49,371 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 56 transitions, 272 flow [2025-01-09 16:31:49,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:49,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:49,371 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-01-09 16:31:49,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:31:49,371 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:31:49,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:49,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1900616770, now seen corresponding path program 2 times [2025-01-09 16:31:49,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:49,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940505023] [2025-01-09 16:31:49,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:31:49,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:49,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:31:49,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:31:49,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:31:49,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:50,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:50,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940505023] [2025-01-09 16:31:50,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940505023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:50,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:50,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:31:50,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281171558] [2025-01-09 16:31:50,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:50,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:31:50,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:50,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:31:50,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:31:50,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-01-09 16:31:50,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 272 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-01-09 16:31:50,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:50,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-01-09 16:31:50,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:50,636 INFO L124 PetriNetUnfolderBase]: 537/964 cut-off events. [2025-01-09 16:31:50,636 INFO L125 PetriNetUnfolderBase]: For 1460/1460 co-relation queries the response was YES. [2025-01-09 16:31:50,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3246 conditions, 964 events. 537/964 cut-off events. For 1460/1460 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4456 event pairs, 30 based on Foata normal form. 8/970 useless extension candidates. Maximal degree in co-relation 1740. Up to 330 conditions per place. [2025-01-09 16:31:50,646 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 78 selfloop transitions, 49 changer transitions 0/134 dead transitions. [2025-01-09 16:31:50,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 134 transitions, 966 flow [2025-01-09 16:31:50,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:31:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:31:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 348 transitions. [2025-01-09 16:31:50,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-01-09 16:31:50,648 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 272 flow. Second operand 12 states and 348 transitions. [2025-01-09 16:31:50,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 134 transitions, 966 flow [2025-01-09 16:31:50,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 134 transitions, 952 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:31:50,655 INFO L231 Difference]: Finished difference. Result has 70 places, 86 transitions, 640 flow [2025-01-09 16:31:50,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=640, PETRI_PLACES=70, PETRI_TRANSITIONS=86} [2025-01-09 16:31:50,656 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 17 predicate places. [2025-01-09 16:31:50,656 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 86 transitions, 640 flow [2025-01-09 16:31:50,656 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-01-09 16:31:50,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:50,656 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-01-09 16:31:50,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:31:50,656 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:31:50,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:50,657 INFO L85 PathProgramCache]: Analyzing trace with hash -426585704, now seen corresponding path program 3 times [2025-01-09 16:31:50,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:50,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129999966] [2025-01-09 16:31:50,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:31:50,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:50,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:31:50,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:31:50,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:31:50,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:51,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:51,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129999966] [2025-01-09 16:31:51,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129999966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:51,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:51,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:31:51,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113657444] [2025-01-09 16:31:51,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:51,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:31:51,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:51,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:31:51,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:31:51,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-01-09 16:31:51,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 86 transitions, 640 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-01-09 16:31:51,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:51,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-01-09 16:31:51,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:52,617 INFO L124 PetriNetUnfolderBase]: 834/1543 cut-off events. [2025-01-09 16:31:52,618 INFO L125 PetriNetUnfolderBase]: For 4885/4885 co-relation queries the response was YES. [2025-01-09 16:31:52,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6024 conditions, 1543 events. 834/1543 cut-off events. For 4885/4885 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8357 event pairs, 88 based on Foata normal form. 0/1541 useless extension candidates. Maximal degree in co-relation 3651. Up to 548 conditions per place. [2025-01-09 16:31:52,632 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 121 selfloop transitions, 56 changer transitions 0/179 dead transitions. [2025-01-09 16:31:52,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 179 transitions, 1599 flow [2025-01-09 16:31:52,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:31:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:31:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 261 transitions. [2025-01-09 16:31:52,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29 [2025-01-09 16:31:52,635 INFO L175 Difference]: Start difference. First operand has 70 places, 86 transitions, 640 flow. Second operand 15 states and 261 transitions. [2025-01-09 16:31:52,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 179 transitions, 1599 flow [2025-01-09 16:31:52,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 179 transitions, 1518 flow, removed 30 selfloop flow, removed 4 redundant places. [2025-01-09 16:31:52,654 INFO L231 Difference]: Finished difference. Result has 88 places, 106 transitions, 966 flow [2025-01-09 16:31:52,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=966, PETRI_PLACES=88, PETRI_TRANSITIONS=106} [2025-01-09 16:31:52,655 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2025-01-09 16:31:52,655 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 106 transitions, 966 flow [2025-01-09 16:31:52,655 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-01-09 16:31:52,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:52,655 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-01-09 16:31:52,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:31:52,658 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:31:52,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:52,658 INFO L85 PathProgramCache]: Analyzing trace with hash -974318922, now seen corresponding path program 4 times [2025-01-09 16:31:52,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:52,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839544743] [2025-01-09 16:31:52,659 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:31:52,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:52,685 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:31:52,700 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:31:52,700 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:31:52,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:53,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:53,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839544743] [2025-01-09 16:31:53,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839544743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:53,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:53,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:31:53,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277990990] [2025-01-09 16:31:53,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:53,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:31:53,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:53,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:31:53,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:31:53,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-01-09 16:31:53,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 106 transitions, 966 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-01-09 16:31:53,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:53,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-01-09 16:31:53,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:53,805 INFO L124 PetriNetUnfolderBase]: 875/1646 cut-off events. [2025-01-09 16:31:53,806 INFO L125 PetriNetUnfolderBase]: For 6126/6126 co-relation queries the response was YES. [2025-01-09 16:31:53,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6910 conditions, 1646 events. 875/1646 cut-off events. For 6126/6126 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9188 event pairs, 67 based on Foata normal form. 2/1648 useless extension candidates. Maximal degree in co-relation 6864. Up to 586 conditions per place. [2025-01-09 16:31:53,820 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 103 selfloop transitions, 66 changer transitions 0/171 dead transitions. [2025-01-09 16:31:53,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 171 transitions, 1755 flow [2025-01-09 16:31:53,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:31:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:31:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 206 transitions. [2025-01-09 16:31:53,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2861111111111111 [2025-01-09 16:31:53,822 INFO L175 Difference]: Start difference. First operand has 88 places, 106 transitions, 966 flow. Second operand 12 states and 206 transitions. [2025-01-09 16:31:53,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 171 transitions, 1755 flow [2025-01-09 16:31:53,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 171 transitions, 1709 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-01-09 16:31:53,841 INFO L231 Difference]: Finished difference. Result has 99 places, 114 transitions, 1177 flow [2025-01-09 16:31:53,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1177, PETRI_PLACES=99, PETRI_TRANSITIONS=114} [2025-01-09 16:31:53,842 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 46 predicate places. [2025-01-09 16:31:53,842 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 114 transitions, 1177 flow [2025-01-09 16:31:53,842 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-01-09 16:31:53,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:53,842 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-01-09 16:31:53,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:31:53,842 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:31:53,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:53,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1135815428, now seen corresponding path program 5 times [2025-01-09 16:31:53,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:53,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578922791] [2025-01-09 16:31:53,843 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:31:53,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:53,865 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:31:53,876 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:31:53,877 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:31:53,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:54,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:54,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578922791] [2025-01-09 16:31:54,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578922791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:54,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:54,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:31:54,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371253184] [2025-01-09 16:31:54,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:54,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:31:54,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:54,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:31:54,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:31:54,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-01-09 16:31:54,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 114 transitions, 1177 flow. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:54,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:54,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-01-09 16:31:54,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:54,775 INFO L124 PetriNetUnfolderBase]: 784/1503 cut-off events. [2025-01-09 16:31:54,775 INFO L125 PetriNetUnfolderBase]: For 7958/7958 co-relation queries the response was YES. [2025-01-09 16:31:54,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6648 conditions, 1503 events. 784/1503 cut-off events. For 7958/7958 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8325 event pairs, 139 based on Foata normal form. 14/1517 useless extension candidates. Maximal degree in co-relation 6595. Up to 934 conditions per place. [2025-01-09 16:31:54,788 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 83 selfloop transitions, 74 changer transitions 0/167 dead transitions. [2025-01-09 16:31:54,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 167 transitions, 2020 flow [2025-01-09 16:31:54,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:31:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:31:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 272 transitions. [2025-01-09 16:31:54,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2025-01-09 16:31:54,792 INFO L175 Difference]: Start difference. First operand has 99 places, 114 transitions, 1177 flow. Second operand 9 states and 272 transitions. [2025-01-09 16:31:54,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 167 transitions, 2020 flow [2025-01-09 16:31:54,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 167 transitions, 1922 flow, removed 20 selfloop flow, removed 6 redundant places. [2025-01-09 16:31:54,822 INFO L231 Difference]: Finished difference. Result has 107 places, 142 transitions, 1742 flow [2025-01-09 16:31:54,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1742, PETRI_PLACES=107, PETRI_TRANSITIONS=142} [2025-01-09 16:31:54,823 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 54 predicate places. [2025-01-09 16:31:54,823 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 142 transitions, 1742 flow [2025-01-09 16:31:54,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 7 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:54,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:54,824 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-01-09 16:31:54,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:31:54,824 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:31:54,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:54,825 INFO L85 PathProgramCache]: Analyzing trace with hash 634599078, now seen corresponding path program 6 times [2025-01-09 16:31:54,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:54,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262624825] [2025-01-09 16:31:54,825 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:31:54,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:54,849 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:31:54,861 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:31:54,862 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:31:54,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:55,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:55,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262624825] [2025-01-09 16:31:55,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262624825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:55,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:55,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:31:55,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520488585] [2025-01-09 16:31:55,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:55,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:31:55,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:55,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:31:55,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:31:55,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-01-09 16:31:55,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 142 transitions, 1742 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-01-09 16:31:55,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:55,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-01-09 16:31:55,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:55,857 INFO L124 PetriNetUnfolderBase]: 784/1499 cut-off events. [2025-01-09 16:31:55,857 INFO L125 PetriNetUnfolderBase]: For 9159/9159 co-relation queries the response was YES. [2025-01-09 16:31:55,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7166 conditions, 1499 events. 784/1499 cut-off events. For 9159/9159 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8237 event pairs, 68 based on Foata normal form. 2/1501 useless extension candidates. Maximal degree in co-relation 7100. Up to 545 conditions per place. [2025-01-09 16:31:55,872 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 109 selfloop transitions, 77 changer transitions 0/187 dead transitions. [2025-01-09 16:31:55,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 187 transitions, 2454 flow [2025-01-09 16:31:55,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:31:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:31:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 202 transitions. [2025-01-09 16:31:55,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28055555555555556 [2025-01-09 16:31:55,875 INFO L175 Difference]: Start difference. First operand has 107 places, 142 transitions, 1742 flow. Second operand 12 states and 202 transitions. [2025-01-09 16:31:55,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 187 transitions, 2454 flow [2025-01-09 16:31:55,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 187 transitions, 2352 flow, removed 44 selfloop flow, removed 3 redundant places. [2025-01-09 16:31:55,921 INFO L231 Difference]: Finished difference. Result has 114 places, 141 transitions, 1838 flow [2025-01-09 16:31:55,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1838, PETRI_PLACES=114, PETRI_TRANSITIONS=141} [2025-01-09 16:31:55,922 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 61 predicate places. [2025-01-09 16:31:55,922 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 141 transitions, 1838 flow [2025-01-09 16:31:55,923 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-01-09 16:31:55,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:55,923 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-01-09 16:31:55,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:31:55,923 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:31:55,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:55,924 INFO L85 PathProgramCache]: Analyzing trace with hash -17525711, now seen corresponding path program 1 times [2025-01-09 16:31:55,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:55,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655717092] [2025-01-09 16:31:55,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:55,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:55,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:31:55,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:31:55,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:55,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:56,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:56,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655717092] [2025-01-09 16:31:56,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655717092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:56,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:56,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:31:56,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920544157] [2025-01-09 16:31:56,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:56,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:31:56,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:56,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:31:56,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:31:56,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-01-09 16:31:56,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 141 transitions, 1838 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-01-09 16:31:56,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:56,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-01-09 16:31:56,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:57,831 INFO L124 PetriNetUnfolderBase]: 941/1788 cut-off events. [2025-01-09 16:31:57,831 INFO L125 PetriNetUnfolderBase]: For 11944/11944 co-relation queries the response was YES. [2025-01-09 16:31:57,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8750 conditions, 1788 events. 941/1788 cut-off events. For 11944/11944 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10241 event pairs, 187 based on Foata normal form. 1/1789 useless extension candidates. Maximal degree in co-relation 8551. Up to 1164 conditions per place. [2025-01-09 16:31:57,848 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 140 selfloop transitions, 58 changer transitions 40/239 dead transitions. [2025-01-09 16:31:57,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 239 transitions, 3349 flow [2025-01-09 16:31:57,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:31:57,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:31:57,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 245 transitions. [2025-01-09 16:31:57,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2722222222222222 [2025-01-09 16:31:57,850 INFO L175 Difference]: Start difference. First operand has 114 places, 141 transitions, 1838 flow. Second operand 15 states and 245 transitions. [2025-01-09 16:31:57,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 239 transitions, 3349 flow [2025-01-09 16:31:57,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 239 transitions, 3195 flow, removed 19 selfloop flow, removed 10 redundant places. [2025-01-09 16:31:57,917 INFO L231 Difference]: Finished difference. Result has 124 places, 160 transitions, 2171 flow [2025-01-09 16:31:57,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1736, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2171, PETRI_PLACES=124, PETRI_TRANSITIONS=160} [2025-01-09 16:31:57,919 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 71 predicate places. [2025-01-09 16:31:57,919 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 160 transitions, 2171 flow [2025-01-09 16:31:57,920 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-01-09 16:31:57,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:57,920 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-01-09 16:31:57,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:31:57,920 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:31:57,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:57,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1926880621, now seen corresponding path program 2 times [2025-01-09 16:31:57,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:57,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359368336] [2025-01-09 16:31:57,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:31:57,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:57,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:31:57,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:31:57,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:31:57,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:58,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:58,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359368336] [2025-01-09 16:31:58,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359368336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:58,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:58,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:31:58,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355152411] [2025-01-09 16:31:58,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:58,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:31:58,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:58,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:31:58,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:31:58,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-01-09 16:31:58,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 160 transitions, 2171 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-01-09 16:31:58,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:58,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-01-09 16:31:58,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:59,700 INFO L124 PetriNetUnfolderBase]: 804/1533 cut-off events. [2025-01-09 16:31:59,700 INFO L125 PetriNetUnfolderBase]: For 11124/11124 co-relation queries the response was YES. [2025-01-09 16:31:59,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7759 conditions, 1533 events. 804/1533 cut-off events. For 11124/11124 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8409 event pairs, 204 based on Foata normal form. 1/1534 useless extension candidates. Maximal degree in co-relation 7699. Up to 1175 conditions per place. [2025-01-09 16:31:59,713 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 107 selfloop transitions, 56 changer transitions 47/211 dead transitions. [2025-01-09 16:31:59,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 211 transitions, 2980 flow [2025-01-09 16:31:59,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:31:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 16:31:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 231 transitions. [2025-01-09 16:31:59,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.275 [2025-01-09 16:31:59,715 INFO L175 Difference]: Start difference. First operand has 124 places, 160 transitions, 2171 flow. Second operand 14 states and 231 transitions. [2025-01-09 16:31:59,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 211 transitions, 2980 flow [2025-01-09 16:31:59,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 211 transitions, 2780 flow, removed 23 selfloop flow, removed 10 redundant places. [2025-01-09 16:31:59,773 INFO L231 Difference]: Finished difference. Result has 129 places, 150 transitions, 2048 flow [2025-01-09 16:31:59,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1988, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2048, PETRI_PLACES=129, PETRI_TRANSITIONS=150} [2025-01-09 16:31:59,774 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 76 predicate places. [2025-01-09 16:31:59,774 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 150 transitions, 2048 flow [2025-01-09 16:31:59,774 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-01-09 16:31:59,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:59,774 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-01-09 16:31:59,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:31:59,775 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:31:59,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:59,775 INFO L85 PathProgramCache]: Analyzing trace with hash -835392765, now seen corresponding path program 3 times [2025-01-09 16:31:59,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:59,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983816985] [2025-01-09 16:31:59,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:31:59,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:59,794 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:31:59,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:31:59,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:31:59,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:32:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:32:00,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:32:00,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983816985] [2025-01-09 16:32:00,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983816985] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:32:00,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533019818] [2025-01-09 16:32:00,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:32:00,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:32:00,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:32:00,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:32:00,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:32:00,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:32:00,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:32:00,756 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:32:00,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:32:00,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-01-09 16:32:00,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:32:00,820 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-01-09 16:32:01,224 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 33 treesize of output 14 [2025-01-09 16:32:01,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2025-01-09 16:32:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:32:01,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:32:02,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-01-09 16:32:02,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533019818] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:32:02,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:32:02,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 27 [2025-01-09 16:32:02,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253286701] [2025-01-09 16:32:02,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:32:02,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 16:32:02,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:32:02,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 16:32:02,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2025-01-09 16:32:02,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-01-09 16:32:02,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 150 transitions, 2048 flow. Second operand has 27 states, 27 states have (on average 12.962962962962964) internal successors, (350), 27 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:32:02,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:32:02,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-01-09 16:32:02,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:32:03,838 INFO L124 PetriNetUnfolderBase]: 895/1690 cut-off events. [2025-01-09 16:32:03,838 INFO L125 PetriNetUnfolderBase]: For 11017/11017 co-relation queries the response was YES. [2025-01-09 16:32:03,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8346 conditions, 1690 events. 895/1690 cut-off events. For 11017/11017 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9473 event pairs, 214 based on Foata normal form. 1/1691 useless extension candidates. Maximal degree in co-relation 8287. Up to 1184 conditions per place. [2025-01-09 16:32:03,849 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 132 selfloop transitions, 58 changer transitions 40/231 dead transitions. [2025-01-09 16:32:03,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 231 transitions, 3282 flow [2025-01-09 16:32:03,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 16:32:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-09 16:32:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 258 transitions. [2025-01-09 16:32:03,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26875 [2025-01-09 16:32:03,852 INFO L175 Difference]: Start difference. First operand has 129 places, 150 transitions, 2048 flow. Second operand 16 states and 258 transitions. [2025-01-09 16:32:03,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 231 transitions, 3282 flow [2025-01-09 16:32:03,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 231 transitions, 3075 flow, removed 9 selfloop flow, removed 12 redundant places. [2025-01-09 16:32:03,894 INFO L231 Difference]: Finished difference. Result has 127 places, 160 transitions, 2181 flow [2025-01-09 16:32:03,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2181, PETRI_PLACES=127, PETRI_TRANSITIONS=160} [2025-01-09 16:32:03,895 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 74 predicate places. [2025-01-09 16:32:03,896 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 160 transitions, 2181 flow [2025-01-09 16:32:03,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 12.962962962962964) internal successors, (350), 27 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:32:03,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:32:03,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:32:03,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:32:04,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 16:32:04,097 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:32:04,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:32:04,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1308024175, now seen corresponding path program 4 times [2025-01-09 16:32:04,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:32:04,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999192719] [2025-01-09 16:32:04,098 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:32:04,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:32:04,116 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:32:04,127 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:32:04,128 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:32:04,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:32:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:32:04,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:32:04,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999192719] [2025-01-09 16:32:04,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999192719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:32:04,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:32:04,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:32:04,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349972130] [2025-01-09 16:32:04,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:32:04,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:32:04,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:32:04,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:32:04,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:32:04,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-01-09 16:32:04,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 160 transitions, 2181 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-01-09 16:32:04,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:32:04,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-01-09 16:32:04,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:32:05,671 INFO L124 PetriNetUnfolderBase]: 828/1585 cut-off events. [2025-01-09 16:32:05,671 INFO L125 PetriNetUnfolderBase]: For 9978/9978 co-relation queries the response was YES. [2025-01-09 16:32:05,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7816 conditions, 1585 events. 828/1585 cut-off events. For 9978/9978 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8959 event pairs, 236 based on Foata normal form. 1/1586 useless extension candidates. Maximal degree in co-relation 7756. Up to 1098 conditions per place. [2025-01-09 16:32:05,685 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 128 selfloop transitions, 49 changer transitions 45/223 dead transitions. [2025-01-09 16:32:05,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 223 transitions, 3152 flow [2025-01-09 16:32:05,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 16:32:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 16:32:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 220 transitions. [2025-01-09 16:32:05,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28205128205128205 [2025-01-09 16:32:05,688 INFO L175 Difference]: Start difference. First operand has 127 places, 160 transitions, 2181 flow. Second operand 13 states and 220 transitions. [2025-01-09 16:32:05,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 223 transitions, 3152 flow [2025-01-09 16:32:05,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 223 transitions, 3085 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-01-09 16:32:05,731 INFO L231 Difference]: Finished difference. Result has 134 places, 153 transitions, 2176 flow [2025-01-09 16:32:05,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2131, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2176, PETRI_PLACES=134, PETRI_TRANSITIONS=153} [2025-01-09 16:32:05,731 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 81 predicate places. [2025-01-09 16:32:05,731 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 153 transitions, 2176 flow [2025-01-09 16:32:05,732 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-01-09 16:32:05,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:32:05,732 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-01-09 16:32:05,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:32:05,732 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:32:05,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:32:05,732 INFO L85 PathProgramCache]: Analyzing trace with hash 455871811, now seen corresponding path program 5 times [2025-01-09 16:32:05,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:32:05,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353419669] [2025-01-09 16:32:05,733 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:32:05,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:32:05,753 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:32:05,772 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:32:05,772 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:32:05,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:32:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:32:06,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:32:06,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353419669] [2025-01-09 16:32:06,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353419669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:32:06,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:32:06,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:32:06,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624401330] [2025-01-09 16:32:06,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:32:06,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:32:06,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:32:06,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:32:06,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:32:06,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-01-09 16:32:06,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 153 transitions, 2176 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-01-09 16:32:06,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:32:06,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-01-09 16:32:06,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:32:07,253 INFO L124 PetriNetUnfolderBase]: 712/1361 cut-off events. [2025-01-09 16:32:07,253 INFO L125 PetriNetUnfolderBase]: For 9672/9672 co-relation queries the response was YES. [2025-01-09 16:32:07,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6882 conditions, 1361 events. 712/1361 cut-off events. For 9672/9672 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7342 event pairs, 207 based on Foata normal form. 1/1362 useless extension candidates. Maximal degree in co-relation 6823. Up to 885 conditions per place. [2025-01-09 16:32:07,263 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 110 selfloop transitions, 43 changer transitions 58/212 dead transitions. [2025-01-09 16:32:07,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 212 transitions, 3061 flow [2025-01-09 16:32:07,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:32:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 16:32:07,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 230 transitions. [2025-01-09 16:32:07,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27380952380952384 [2025-01-09 16:32:07,266 INFO L175 Difference]: Start difference. First operand has 134 places, 153 transitions, 2176 flow. Second operand 14 states and 230 transitions. [2025-01-09 16:32:07,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 212 transitions, 3061 flow [2025-01-09 16:32:07,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 212 transitions, 2963 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-01-09 16:32:07,303 INFO L231 Difference]: Finished difference. Result has 140 places, 133 transitions, 1835 flow [2025-01-09 16:32:07,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1835, PETRI_PLACES=140, PETRI_TRANSITIONS=133} [2025-01-09 16:32:07,304 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 87 predicate places. [2025-01-09 16:32:07,304 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 133 transitions, 1835 flow [2025-01-09 16:32:07,304 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-01-09 16:32:07,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:32:07,304 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-01-09 16:32:07,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:32:07,304 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:32:07,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:32:07,305 INFO L85 PathProgramCache]: Analyzing trace with hash 388074667, now seen corresponding path program 6 times [2025-01-09 16:32:07,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:32:07,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024204424] [2025-01-09 16:32:07,305 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:32:07,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:32:07,322 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:32:07,330 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:32:07,331 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:32:07,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:32:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:32:07,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:32:07,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024204424] [2025-01-09 16:32:07,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024204424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:32:07,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:32:07,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:32:07,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771453875] [2025-01-09 16:32:07,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:32:07,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:32:07,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:32:07,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:32:07,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:32:07,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-01-09 16:32:07,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 133 transitions, 1835 flow. Second operand has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:32:07,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:32:07,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-01-09 16:32:07,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:32:07,904 INFO L124 PetriNetUnfolderBase]: 478/937 cut-off events. [2025-01-09 16:32:07,905 INFO L125 PetriNetUnfolderBase]: For 6346/6346 co-relation queries the response was YES. [2025-01-09 16:32:07,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4649 conditions, 937 events. 478/937 cut-off events. For 6346/6346 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4627 event pairs, 85 based on Foata normal form. 12/949 useless extension candidates. Maximal degree in co-relation 4593. Up to 477 conditions per place. [2025-01-09 16:32:07,909 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 92 selfloop transitions, 56 changer transitions 3/158 dead transitions. [2025-01-09 16:32:07,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 158 transitions, 2163 flow [2025-01-09 16:32:07,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:32:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:32:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 305 transitions. [2025-01-09 16:32:07,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2025-01-09 16:32:07,911 INFO L175 Difference]: Start difference. First operand has 140 places, 133 transitions, 1835 flow. Second operand 10 states and 305 transitions. [2025-01-09 16:32:07,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 158 transitions, 2163 flow [2025-01-09 16:32:07,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 158 transitions, 2007 flow, removed 38 selfloop flow, removed 15 redundant places. [2025-01-09 16:32:07,932 INFO L231 Difference]: Finished difference. Result has 129 places, 129 transitions, 1732 flow [2025-01-09 16:32:07,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1732, PETRI_PLACES=129, PETRI_TRANSITIONS=129} [2025-01-09 16:32:07,932 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 76 predicate places. [2025-01-09 16:32:07,933 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 129 transitions, 1732 flow [2025-01-09 16:32:07,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:32:07,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:32:07,934 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-01-09 16:32:07,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:32:07,934 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:32:07,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:32:07,935 INFO L85 PathProgramCache]: Analyzing trace with hash 896429373, now seen corresponding path program 7 times [2025-01-09 16:32:07,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:32:07,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487884355] [2025-01-09 16:32:07,935 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:32:07,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:32:07,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:32:07,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:32:07,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:32:07,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:32:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:32:08,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:32:08,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487884355] [2025-01-09 16:32:08,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487884355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:32:08,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:32:08,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:32:08,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589984] [2025-01-09 16:32:08,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:32:08,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:32:08,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:32:08,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:32:08,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:32:08,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-01-09 16:32:08,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 129 transitions, 1732 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-01-09 16:32:08,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:32:08,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-01-09 16:32:08,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:32:09,472 INFO L124 PetriNetUnfolderBase]: 475/926 cut-off events. [2025-01-09 16:32:09,472 INFO L125 PetriNetUnfolderBase]: For 6013/6013 co-relation queries the response was YES. [2025-01-09 16:32:09,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4553 conditions, 926 events. 475/926 cut-off events. For 6013/6013 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4500 event pairs, 117 based on Foata normal form. 2/928 useless extension candidates. Maximal degree in co-relation 4458. Up to 604 conditions per place. [2025-01-09 16:32:09,478 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 88 selfloop transitions, 32 changer transitions 47/168 dead transitions. [2025-01-09 16:32:09,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 168 transitions, 2271 flow [2025-01-09 16:32:09,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:32:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:32:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 239 transitions. [2025-01-09 16:32:09,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.26555555555555554 [2025-01-09 16:32:09,480 INFO L175 Difference]: Start difference. First operand has 129 places, 129 transitions, 1732 flow. Second operand 15 states and 239 transitions. [2025-01-09 16:32:09,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 168 transitions, 2271 flow [2025-01-09 16:32:09,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 168 transitions, 2162 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-01-09 16:32:09,507 INFO L231 Difference]: Finished difference. Result has 138 places, 105 transitions, 1295 flow [2025-01-09 16:32:09,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1295, PETRI_PLACES=138, PETRI_TRANSITIONS=105} [2025-01-09 16:32:09,508 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 85 predicate places. [2025-01-09 16:32:09,508 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 105 transitions, 1295 flow [2025-01-09 16:32:09,508 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-01-09 16:32:09,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:32:09,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:32:09,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 16:32:09,509 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:32:09,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:32:09,509 INFO L85 PathProgramCache]: Analyzing trace with hash -423382227, now seen corresponding path program 8 times [2025-01-09 16:32:09,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:32:09,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800622810] [2025-01-09 16:32:09,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:32:09,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:32:09,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:32:09,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:32:09,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:32:09,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:32:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:32:09,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:32:09,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800622810] [2025-01-09 16:32:09,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800622810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:32:09,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:32:09,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:32:09,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472582937] [2025-01-09 16:32:09,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:32:09,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:32:09,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:32:09,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:32:09,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:32:09,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-01-09 16:32:09,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 105 transitions, 1295 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-01-09 16:32:09,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:32:09,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-01-09 16:32:09,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:32:10,319 INFO L124 PetriNetUnfolderBase]: 410/813 cut-off events. [2025-01-09 16:32:10,320 INFO L125 PetriNetUnfolderBase]: For 4445/4445 co-relation queries the response was YES. [2025-01-09 16:32:10,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3794 conditions, 813 events. 410/813 cut-off events. For 4445/4445 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3897 event pairs, 43 based on Foata normal form. 12/825 useless extension candidates. Maximal degree in co-relation 3740. Up to 366 conditions per place. [2025-01-09 16:32:10,326 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 82 selfloop transitions, 58 changer transitions 1/148 dead transitions. [2025-01-09 16:32:10,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 148 transitions, 1859 flow [2025-01-09 16:32:10,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:32:10,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:32:10,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 352 transitions. [2025-01-09 16:32:10,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2025-01-09 16:32:10,328 INFO L175 Difference]: Start difference. First operand has 138 places, 105 transitions, 1295 flow. Second operand 12 states and 352 transitions. [2025-01-09 16:32:10,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 148 transitions, 1859 flow [2025-01-09 16:32:10,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 148 transitions, 1659 flow, removed 34 selfloop flow, removed 22 redundant places. [2025-01-09 16:32:10,346 INFO L231 Difference]: Finished difference. Result has 112 places, 116 transitions, 1412 flow [2025-01-09 16:32:10,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1412, PETRI_PLACES=112, PETRI_TRANSITIONS=116} [2025-01-09 16:32:10,348 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 59 predicate places. [2025-01-09 16:32:10,348 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 116 transitions, 1412 flow [2025-01-09 16:32:10,349 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-01-09 16:32:10,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:32:10,349 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-01-09 16:32:10,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 16:32:10,349 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:32:10,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:32:10,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1100951771, now seen corresponding path program 9 times [2025-01-09 16:32:10,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:32:10,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427506286] [2025-01-09 16:32:10,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:32:10,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:32:10,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:32:10,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:32:10,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:32:10,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:32:10,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:32:10,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:32:10,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427506286] [2025-01-09 16:32:10,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427506286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:32:10,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:32:10,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:32:10,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480178078] [2025-01-09 16:32:10,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:32:10,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:32:10,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:32:10,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:32:10,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:32:10,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-01-09 16:32:10,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 116 transitions, 1412 flow. Second operand has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:32:10,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:32:10,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-01-09 16:32:10,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:32:10,875 INFO L124 PetriNetUnfolderBase]: 357/732 cut-off events. [2025-01-09 16:32:10,876 INFO L125 PetriNetUnfolderBase]: For 4130/4130 co-relation queries the response was YES. [2025-01-09 16:32:10,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3443 conditions, 732 events. 357/732 cut-off events. For 4130/4130 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3474 event pairs, 49 based on Foata normal form. 10/742 useless extension candidates. Maximal degree in co-relation 3246. Up to 357 conditions per place. [2025-01-09 16:32:10,880 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 76 selfloop transitions, 60 changer transitions 3/146 dead transitions. [2025-01-09 16:32:10,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 146 transitions, 1909 flow [2025-01-09 16:32:10,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:32:10,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:32:10,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 315 transitions. [2025-01-09 16:32:10,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2025-01-09 16:32:10,882 INFO L175 Difference]: Start difference. First operand has 112 places, 116 transitions, 1412 flow. Second operand 11 states and 315 transitions. [2025-01-09 16:32:10,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 146 transitions, 1909 flow [2025-01-09 16:32:10,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 146 transitions, 1814 flow, removed 18 selfloop flow, removed 6 redundant places. [2025-01-09 16:32:10,894 INFO L231 Difference]: Finished difference. Result has 120 places, 121 transitions, 1540 flow [2025-01-09 16:32:10,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1540, PETRI_PLACES=120, PETRI_TRANSITIONS=121} [2025-01-09 16:32:10,895 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 67 predicate places. [2025-01-09 16:32:10,895 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 121 transitions, 1540 flow [2025-01-09 16:32:10,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:32:10,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:32:10,895 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-01-09 16:32:10,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 16:32:10,895 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:32:10,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:32:10,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1662817645, now seen corresponding path program 10 times [2025-01-09 16:32:10,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:32:10,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310694909] [2025-01-09 16:32:10,896 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:32:10,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:32:10,910 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:32:10,920 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:32:10,920 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:32:10,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:32:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:32:11,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:32:11,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310694909] [2025-01-09 16:32:11,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310694909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:32:11,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:32:11,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:32:11,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375179745] [2025-01-09 16:32:11,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:32:11,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:32:11,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:32:11,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:32:11,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:32:11,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-01-09 16:32:11,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 121 transitions, 1540 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-01-09 16:32:11,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:32:11,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-01-09 16:32:11,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:32:12,298 INFO L124 PetriNetUnfolderBase]: 411/854 cut-off events. [2025-01-09 16:32:12,299 INFO L125 PetriNetUnfolderBase]: For 5223/5223 co-relation queries the response was YES. [2025-01-09 16:32:12,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4079 conditions, 854 events. 411/854 cut-off events. For 5223/5223 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4246 event pairs, 142 based on Foata normal form. 2/856 useless extension candidates. Maximal degree in co-relation 3870. Up to 602 conditions per place. [2025-01-09 16:32:12,307 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 87 selfloop transitions, 29 changer transitions 47/164 dead transitions. [2025-01-09 16:32:12,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 164 transitions, 2229 flow [2025-01-09 16:32:12,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:32:12,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:32:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 231 transitions. [2025-01-09 16:32:12,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25666666666666665 [2025-01-09 16:32:12,310 INFO L175 Difference]: Start difference. First operand has 120 places, 121 transitions, 1540 flow. Second operand 15 states and 231 transitions. [2025-01-09 16:32:12,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 164 transitions, 2229 flow [2025-01-09 16:32:12,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 164 transitions, 2030 flow, removed 20 selfloop flow, removed 9 redundant places. [2025-01-09 16:32:12,333 INFO L231 Difference]: Finished difference. Result has 127 places, 107 transitions, 1223 flow [2025-01-09 16:32:12,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1223, PETRI_PLACES=127, PETRI_TRANSITIONS=107} [2025-01-09 16:32:12,334 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 74 predicate places. [2025-01-09 16:32:12,334 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 107 transitions, 1223 flow [2025-01-09 16:32:12,334 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-01-09 16:32:12,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:32:12,335 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-01-09 16:32:12,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 16:32:12,335 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:32:12,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:32:12,336 INFO L85 PathProgramCache]: Analyzing trace with hash 642441795, now seen corresponding path program 11 times [2025-01-09 16:32:12,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:32:12,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200653439] [2025-01-09 16:32:12,336 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:32:12,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:32:12,356 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:32:12,363 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:32:12,363 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:32:12,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:32:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:32:12,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:32:12,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200653439] [2025-01-09 16:32:12,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200653439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:32:12,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:32:12,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:32:12,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570179394] [2025-01-09 16:32:12,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:32:12,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:32:12,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:32:12,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:32:12,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:32:12,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-01-09 16:32:12,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 107 transitions, 1223 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-01-09 16:32:12,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:32:12,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-01-09 16:32:12,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:32:12,977 INFO L124 PetriNetUnfolderBase]: 258/559 cut-off events. [2025-01-09 16:32:12,978 INFO L125 PetriNetUnfolderBase]: For 2753/2753 co-relation queries the response was YES. [2025-01-09 16:32:12,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2487 conditions, 559 events. 258/559 cut-off events. For 2753/2753 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2494 event pairs, 24 based on Foata normal form. 12/571 useless extension candidates. Maximal degree in co-relation 2440. Up to 134 conditions per place. [2025-01-09 16:32:12,981 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 76 selfloop transitions, 47 changer transitions 1/131 dead transitions. [2025-01-09 16:32:12,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 131 transitions, 1495 flow [2025-01-09 16:32:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:32:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:32:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 348 transitions. [2025-01-09 16:32:12,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-01-09 16:32:12,983 INFO L175 Difference]: Start difference. First operand has 127 places, 107 transitions, 1223 flow. Second operand 12 states and 348 transitions. [2025-01-09 16:32:12,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 131 transitions, 1495 flow [2025-01-09 16:32:12,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 131 transitions, 1397 flow, removed 19 selfloop flow, removed 12 redundant places. [2025-01-09 16:32:12,997 INFO L231 Difference]: Finished difference. Result has 123 places, 103 transitions, 1208 flow [2025-01-09 16:32:12,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1208, PETRI_PLACES=123, PETRI_TRANSITIONS=103} [2025-01-09 16:32:12,998 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 70 predicate places. [2025-01-09 16:32:12,998 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 103 transitions, 1208 flow [2025-01-09 16:32:12,999 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-01-09 16:32:12,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:32:12,999 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-01-09 16:32:12,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 16:32:12,999 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:32:13,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:32:13,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1733761377, now seen corresponding path program 12 times [2025-01-09 16:32:13,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:32:13,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193693199] [2025-01-09 16:32:13,000 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:32:13,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:32:13,017 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:32:13,026 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:32:13,027 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:32:13,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:32:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:32:13,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:32:13,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193693199] [2025-01-09 16:32:13,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193693199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:32:13,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:32:13,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:32:13,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771787623] [2025-01-09 16:32:13,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:32:13,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:32:13,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:32:13,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:32:13,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:32:13,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-01-09 16:32:13,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 103 transitions, 1208 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-01-09 16:32:13,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:32:13,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-01-09 16:32:13,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:32:14,396 INFO L124 PetriNetUnfolderBase]: 257/554 cut-off events. [2025-01-09 16:32:14,396 INFO L125 PetriNetUnfolderBase]: For 3409/3409 co-relation queries the response was YES. [2025-01-09 16:32:14,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2600 conditions, 554 events. 257/554 cut-off events. For 3409/3409 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2431 event pairs, 57 based on Foata normal form. 2/556 useless extension candidates. Maximal degree in co-relation 2503. Up to 288 conditions per place. [2025-01-09 16:32:14,399 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 63 selfloop transitions, 23 changer transitions 47/134 dead transitions. [2025-01-09 16:32:14,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 134 transitions, 1665 flow [2025-01-09 16:32:14,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:32:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 16:32:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 215 transitions. [2025-01-09 16:32:14,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25595238095238093 [2025-01-09 16:32:14,400 INFO L175 Difference]: Start difference. First operand has 123 places, 103 transitions, 1208 flow. Second operand 14 states and 215 transitions. [2025-01-09 16:32:14,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 134 transitions, 1665 flow [2025-01-09 16:32:14,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 134 transitions, 1588 flow, removed 20 selfloop flow, removed 6 redundant places. [2025-01-09 16:32:14,411 INFO L231 Difference]: Finished difference. Result has 131 places, 74 transitions, 812 flow [2025-01-09 16:32:14,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=812, PETRI_PLACES=131, PETRI_TRANSITIONS=74} [2025-01-09 16:32:14,411 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 78 predicate places. [2025-01-09 16:32:14,412 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 74 transitions, 812 flow [2025-01-09 16:32:14,412 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-01-09 16:32:14,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:32:14,412 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-01-09 16:32:14,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 16:32:14,412 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:32:14,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:32:14,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1144104591, now seen corresponding path program 13 times [2025-01-09 16:32:14,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:32:14,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025573439] [2025-01-09 16:32:14,413 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:32:14,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:32:14,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:32:14,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:32:14,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:32:14,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:32:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:32:15,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:32:15,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025573439] [2025-01-09 16:32:15,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025573439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:32:15,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:32:15,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 16:32:15,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659657093] [2025-01-09 16:32:15,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:32:15,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:32:15,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:32:15,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:32:15,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:32:15,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-01-09 16:32:15,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 74 transitions, 812 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-01-09 16:32:15,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:32:15,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-01-09 16:32:15,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:32:15,655 INFO L124 PetriNetUnfolderBase]: 173/376 cut-off events. [2025-01-09 16:32:15,656 INFO L125 PetriNetUnfolderBase]: For 2100/2100 co-relation queries the response was YES. [2025-01-09 16:32:15,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 376 events. 173/376 cut-off events. For 2100/2100 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1444 event pairs, 42 based on Foata normal form. 1/377 useless extension candidates. Maximal degree in co-relation 1709. Up to 135 conditions per place. [2025-01-09 16:32:15,658 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 37 selfloop transitions, 16 changer transitions 49/103 dead transitions. [2025-01-09 16:32:15,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 103 transitions, 1160 flow [2025-01-09 16:32:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:32:15,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 16:32:15,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 214 transitions. [2025-01-09 16:32:15,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25476190476190474 [2025-01-09 16:32:15,659 INFO L175 Difference]: Start difference. First operand has 131 places, 74 transitions, 812 flow. Second operand 14 states and 214 transitions. [2025-01-09 16:32:15,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 103 transitions, 1160 flow [2025-01-09 16:32:15,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 103 transitions, 965 flow, removed 11 selfloop flow, removed 35 redundant places. [2025-01-09 16:32:15,668 INFO L231 Difference]: Finished difference. Result has 101 places, 50 transitions, 408 flow [2025-01-09 16:32:15,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=408, PETRI_PLACES=101, PETRI_TRANSITIONS=50} [2025-01-09 16:32:15,669 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 48 predicate places. [2025-01-09 16:32:15,669 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 50 transitions, 408 flow [2025-01-09 16:32:15,669 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-01-09 16:32:15,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:32:15,669 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-01-09 16:32:15,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 16:32:15,670 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-09 16:32:15,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:32:15,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2089402495, now seen corresponding path program 14 times [2025-01-09 16:32:15,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:32:15,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241093594] [2025-01-09 16:32:15,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:32:15,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:32:15,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:32:15,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:32:15,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:32:15,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:32:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:32:16,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:32:16,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241093594] [2025-01-09 16:32:16,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241093594] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:32:16,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686190078] [2025-01-09 16:32:16,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:32:16,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:32:16,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:32:16,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:32:16,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:32:16,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:32:16,576 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:32:16,576 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:32:16,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:32:16,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-01-09 16:32:16,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:32:16,601 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-01-09 16:32:16,941 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 39 treesize of output 16 [2025-01-09 16:32:16,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2025-01-09 16:32:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:32:17,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:32:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:32:17,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686190078] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:32:17,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:32:17,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2025-01-09 16:32:17,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759596795] [2025-01-09 16:32:17,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:32:17,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 16:32:17,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:32:17,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 16:32:17,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2025-01-09 16:32:17,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-01-09 16:32:17,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 50 transitions, 408 flow. Second operand has 28 states, 28 states have (on average 12.857142857142858) internal successors, (360), 28 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:32:17,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:32:17,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-01-09 16:32:17,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:32:18,157 INFO L124 PetriNetUnfolderBase]: 72/173 cut-off events. [2025-01-09 16:32:18,158 INFO L125 PetriNetUnfolderBase]: For 578/578 co-relation queries the response was YES. [2025-01-09 16:32:18,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 173 events. 72/173 cut-off events. For 578/578 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 455 event pairs, 11 based on Foata normal form. 2/175 useless extension candidates. Maximal degree in co-relation 687. Up to 90 conditions per place. [2025-01-09 16:32:18,158 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 0 selfloop transitions, 0 changer transitions 59/59 dead transitions. [2025-01-09 16:32:18,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 59 transitions, 556 flow [2025-01-09 16:32:18,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:32:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:32:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 199 transitions. [2025-01-09 16:32:18,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22111111111111112 [2025-01-09 16:32:18,159 INFO L175 Difference]: Start difference. First operand has 101 places, 50 transitions, 408 flow. Second operand 15 states and 199 transitions. [2025-01-09 16:32:18,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 59 transitions, 556 flow [2025-01-09 16:32:18,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 59 transitions, 351 flow, removed 6 selfloop flow, removed 35 redundant places. [2025-01-09 16:32:18,162 INFO L231 Difference]: Finished difference. Result has 69 places, 0 transitions, 0 flow [2025-01-09 16:32:18,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=0, PETRI_PLACES=69, PETRI_TRANSITIONS=0} [2025-01-09 16:32:18,162 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2025-01-09 16:32:18,162 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 0 transitions, 0 flow [2025-01-09 16:32:18,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 12.857142857142858) internal successors, (360), 28 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:32:18,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-01-09 16:32:18,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-01-09 16:32:18,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-01-09 16:32:18,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-01-09 16:32:18,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-01-09 16:32:18,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-01-09 16:32:18,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-01-09 16:32:18,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-01-09 16:32:18,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:32:18,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:32:18,366 INFO L422 BasicCegarLoop]: Path program histogram: [14, 6, 1, 1, 1, 1] [2025-01-09 16:32:18,369 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:32:18,369 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:32:18,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:32:18 BasicIcfg [2025-01-09 16:32:18,373 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:32:18,374 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:32:18,374 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:32:18,374 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:32:18,375 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:31:45" (3/4) ... [2025-01-09 16:32:18,378 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 16:32:18,381 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-01-09 16:32:18,389 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 81 nodes and edges [2025-01-09 16:32:18,390 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2025-01-09 16:32:18,390 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-01-09 16:32:18,390 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 16:32:18,468 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:32:18,469 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:32:18,469 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:32:18,470 INFO L158 Benchmark]: Toolchain (without parser) took 34391.33ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 132.3MB in the beginning and 273.7MB in the end (delta: -141.4MB). Peak memory consumption was 317.1MB. Max. memory is 16.1GB. [2025-01-09 16:32:18,470 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:32:18,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.38ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 101.6MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:32:18,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.64ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 99.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:32:18,472 INFO L158 Benchmark]: Boogie Preprocessor took 82.08ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 96.0MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:32:18,472 INFO L158 Benchmark]: RCFGBuilder took 766.53ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 57.2MB in the end (delta: 38.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 16:32:18,473 INFO L158 Benchmark]: TraceAbstraction took 32806.89ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 56.4MB in the beginning and 277.8MB in the end (delta: -221.3MB). Peak memory consumption was 241.6MB. Max. memory is 16.1GB. [2025-01-09 16:32:18,473 INFO L158 Benchmark]: Witness Printer took 95.20ms. Allocated memory is still 629.1MB. Free memory was 277.8MB in the beginning and 273.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:32:18,475 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.23ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 571.38ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 101.6MB in the end (delta: 30.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.64ms. Allocated memory is still 167.8MB. Free memory was 101.6MB in the beginning and 99.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 82.08ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 96.0MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 766.53ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 57.2MB in the end (delta: 38.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 32806.89ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 56.4MB in the beginning and 277.8MB in the end (delta: -221.3MB). Peak memory consumption was 241.6MB. Max. memory is 16.1GB. * Witness Printer took 95.20ms. Allocated memory is still 629.1MB. Free memory was 277.8MB in the beginning and 273.7MB in the end (delta: 4.1MB). 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: 32.7s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.0s, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2574 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2424 mSDsluCounter, 3355 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3291 mSDsCounter, 256 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8613 IncrementalHoareTripleChecker+Invalid, 8869 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 256 mSolverCounterUnsat, 64 mSDtfsCounter, 8613 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2181occurred in iteration=13, InterpolantAutomatonStates: 276, 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.5s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 715 NumberOfCodeBlocks, 715 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 749 ConstructedInterpolants, 38 QuantifiedInterpolants, 9773 SizeOfPredicates, 58 NumberOfNonLiveVariables, 640 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 0/6 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-01-09 16:32:18,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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