./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e8cd6f4fedd4ae62debc23b5e2621fa19163a924ac1cc7b32aeb6e38c2fa5ce1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:55:34,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:55:34,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:55:34,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:55:34,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:55:34,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:55:34,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:55:34,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:55:34,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:55:34,739 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:55:34,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:55:34,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:55:34,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:55:34,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:55:34,739 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:55:34,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:55:34,740 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:55:34,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:55:34,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:55:34,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:55:34,740 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:55:34,740 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:55:34,740 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:55:34,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:55:34,740 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:55:34,740 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:55:34,740 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:55:34,740 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:55:34,740 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:55:34,741 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:55:34,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:34,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:34,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:34,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:34,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:55:34,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:55:34,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:55:34,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:55:34,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:34,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:55:34,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:55:34,742 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:55:34,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:55:34,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:55:34,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:55:34,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:55:34,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:55:34,742 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> e8cd6f4fedd4ae62debc23b5e2621fa19163a924ac1cc7b32aeb6e38c2fa5ce1 [2025-01-10 00:55:34,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:55:34,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:55:34,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:55:34,958 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:55:34,959 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:55:34,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2025-01-10 00:55:36,115 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57dce1f44/f870e72cac374a0e9ea4a9182dc98a5c/FLAG27c5ced72 [2025-01-10 00:55:36,435 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:55:36,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr-deref.i [2025-01-10 00:55:36,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57dce1f44/f870e72cac374a0e9ea4a9182dc98a5c/FLAG27c5ced72 [2025-01-10 00:55:36,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57dce1f44/f870e72cac374a0e9ea4a9182dc98a5c [2025-01-10 00:55:36,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:55:36,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:55:36,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:36,704 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:55:36,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:55:36,709 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:36" (1/1) ... [2025-01-10 00:55:36,710 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f322d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:36, skipping insertion in model container [2025-01-10 00:55:36,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:36" (1/1) ... [2025-01-10 00:55:36,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:55:37,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:37,073 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:55:37,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:55:37,201 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:55:37,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:37 WrapperNode [2025-01-10 00:55:37,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:55:37,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:37,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:55:37,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:55:37,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:37" (1/1) ... [2025-01-10 00:55:37,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:37" (1/1) ... [2025-01-10 00:55:37,260 INFO L138 Inliner]: procedures = 372, calls = 100, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 257 [2025-01-10 00:55:37,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:55:37,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:55:37,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:55:37,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:55:37,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:37" (1/1) ... [2025-01-10 00:55:37,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:37" (1/1) ... [2025-01-10 00:55:37,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:37" (1/1) ... [2025-01-10 00:55:37,310 INFO L175 MemorySlicer]: Split 99 memory accesses to 3 slices as follows [50, 31, 18]. 51 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 0, 10]. The 26 writes are split as follows [0, 24, 2]. [2025-01-10 00:55:37,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:37" (1/1) ... [2025-01-10 00:55:37,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:37" (1/1) ... [2025-01-10 00:55:37,330 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:37" (1/1) ... [2025-01-10 00:55:37,333 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:37" (1/1) ... [2025-01-10 00:55:37,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:37" (1/1) ... [2025-01-10 00:55:37,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:37" (1/1) ... [2025-01-10 00:55:37,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:37" (1/1) ... [2025-01-10 00:55:37,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:55:37,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:55:37,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:55:37,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:55:37,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:37" (1/1) ... [2025-01-10 00:55:37,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:55:37,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:37,392 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-10 00:55:37,399 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-10 00:55:37,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:55:37,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:55:37,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:55:37,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 00:55:37,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 00:55:37,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 00:55:37,415 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:55:37,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:55:37,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:55:37,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:55:37,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:55:37,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:55:37,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:55:37,415 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:55:37,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:55:37,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:55:37,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:55:37,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:55:37,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:55:37,416 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:55:37,416 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:55:37,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:55:37,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:55:37,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:55:37,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:55:37,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:55:37,418 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:55:37,570 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:55:37,572 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:55:38,115 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:55:38,116 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:55:38,380 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:55:38,380 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:55:38,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:38 BoogieIcfgContainer [2025-01-10 00:55:38,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:55:38,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:55:38,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:55:38,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:55:38,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:55:36" (1/3) ... [2025-01-10 00:55:38,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15cfa748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:38, skipping insertion in model container [2025-01-10 00:55:38,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:37" (2/3) ... [2025-01-10 00:55:38,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15cfa748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:38, skipping insertion in model container [2025-01-10 00:55:38,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:38" (3/3) ... [2025-01-10 00:55:38,387 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr-deref.i [2025-01-10 00:55:38,397 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:55:38,398 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_13-arraycollapse_nr-deref.i that has 2 procedures, 134 locations, 1 initial locations, 1 loop locations, and 79 error locations. [2025-01-10 00:55:38,399 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:55:38,465 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:55:38,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 134 transitions, 272 flow [2025-01-10 00:55:38,517 INFO L124 PetriNetUnfolderBase]: 1/133 cut-off events. [2025-01-10 00:55:38,518 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:38,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 133 events. 1/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 269 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2025-01-10 00:55:38,520 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 134 transitions, 272 flow [2025-01-10 00:55:38,523 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 133 transitions, 269 flow [2025-01-10 00:55:38,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:55:38,536 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=None, 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;@2277ff4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:55:38,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2025-01-10 00:55:38,539 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:55:38,539 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 00:55:38,539 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:38,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:38,540 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:55:38,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:55:38,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:38,544 INFO L85 PathProgramCache]: Analyzing trace with hash 751061, now seen corresponding path program 1 times [2025-01-10 00:55:38,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:38,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739232428] [2025-01-10 00:55:38,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:38,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:38,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:55:38,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:55:38,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:38,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:38,771 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-10 00:55:38,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:38,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739232428] [2025-01-10 00:55:38,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739232428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:38,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:38,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:38,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994882870] [2025-01-10 00:55:38,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:38,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:38,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:38,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:38,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:38,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2025-01-10 00:55:38,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 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-10 00:55:38,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:38,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2025-01-10 00:55:38,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:38,947 INFO L124 PetriNetUnfolderBase]: 64/329 cut-off events. [2025-01-10 00:55:38,947 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:38,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 329 events. 64/329 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1306 event pairs, 63 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 376. Up to 167 conditions per place. [2025-01-10 00:55:38,951 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2025-01-10 00:55:38,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 134 transitions, 353 flow [2025-01-10 00:55:38,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2025-01-10 00:55:38,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8059701492537313 [2025-01-10 00:55:38,963 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 269 flow. Second operand 3 states and 324 transitions. [2025-01-10 00:55:38,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 134 transitions, 353 flow [2025-01-10 00:55:38,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 134 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:38,971 INFO L231 Difference]: Finished difference. Result has 138 places, 134 transitions, 280 flow [2025-01-10 00:55:38,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=138, PETRI_TRANSITIONS=134} [2025-01-10 00:55:38,975 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 2 predicate places. [2025-01-10 00:55:38,976 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 134 transitions, 280 flow [2025-01-10 00:55:38,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 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-10 00:55:38,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:38,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:55:38,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:55:38,977 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:55:38,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:38,977 INFO L85 PathProgramCache]: Analyzing trace with hash 23279784, now seen corresponding path program 1 times [2025-01-10 00:55:38,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:38,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368933102] [2025-01-10 00:55:38,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:38,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:38,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:55:39,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:55:39,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:39,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:39,148 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-10 00:55:39,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:39,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368933102] [2025-01-10 00:55:39,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368933102] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:39,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939611383] [2025-01-10 00:55:39,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:39,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:39,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:39,155 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-10 00:55:39,156 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-10 00:55:39,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:55:39,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:55:39,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:39,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:39,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:55:39,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:39,279 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-10 00:55:39,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:39,325 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-10 00:55:39,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939611383] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:55:39,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:55:39,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 00:55:39,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343569362] [2025-01-10 00:55:39,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:55:39,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:39,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:39,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:39,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:39,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2025-01-10 00:55:39,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 134 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 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-10 00:55:39,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:39,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2025-01-10 00:55:39,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:39,578 INFO L124 PetriNetUnfolderBase]: 64/332 cut-off events. [2025-01-10 00:55:39,578 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:55:39,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 332 events. 64/332 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1303 event pairs, 63 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 505. Up to 167 conditions per place. [2025-01-10 00:55:39,580 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-01-10 00:55:39,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 380 flow [2025-01-10 00:55:39,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:55:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:55:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2025-01-10 00:55:39,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7599502487562189 [2025-01-10 00:55:39,586 INFO L175 Difference]: Start difference. First operand has 138 places, 134 transitions, 280 flow. Second operand 6 states and 611 transitions. [2025-01-10 00:55:39,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 380 flow [2025-01-10 00:55:39,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 137 transitions, 376 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:39,589 INFO L231 Difference]: Finished difference. Result has 145 places, 137 transitions, 312 flow [2025-01-10 00:55:39,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=145, PETRI_TRANSITIONS=137} [2025-01-10 00:55:39,590 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 9 predicate places. [2025-01-10 00:55:39,590 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 137 transitions, 312 flow [2025-01-10 00:55:39,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 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-10 00:55:39,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:39,591 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-01-10 00:55:39,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:55:39,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:39,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:55:39,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:39,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2035225237, now seen corresponding path program 2 times [2025-01-10 00:55:39,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:39,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996944820] [2025-01-10 00:55:39,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:55:39,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:39,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-01-10 00:55:39,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 7 statements. [2025-01-10 00:55:39,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:55:39,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 00:55:39,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:39,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996944820] [2025-01-10 00:55:39,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996944820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:39,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:39,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:39,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720554822] [2025-01-10 00:55:39,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:39,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:39,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:39,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:39,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:40,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 134 [2025-01-10 00:55:40,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 137 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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-10 00:55:40,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:40,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 134 [2025-01-10 00:55:40,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:40,220 INFO L124 PetriNetUnfolderBase]: 64/320 cut-off events. [2025-01-10 00:55:40,220 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:55:40,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 320 events. 64/320 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1245 event pairs, 63 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 490. Up to 165 conditions per place. [2025-01-10 00:55:40,222 INFO L140 encePairwiseOnDemand]: 110/134 looper letters, 38 selfloop transitions, 12 changer transitions 0/125 dead transitions. [2025-01-10 00:55:40,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 125 transitions, 388 flow [2025-01-10 00:55:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-01-10 00:55:40,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7114427860696517 [2025-01-10 00:55:40,226 INFO L175 Difference]: Start difference. First operand has 145 places, 137 transitions, 312 flow. Second operand 3 states and 286 transitions. [2025-01-10 00:55:40,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 125 transitions, 388 flow [2025-01-10 00:55:40,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 125 transitions, 374 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:40,230 INFO L231 Difference]: Finished difference. Result has 134 places, 125 transitions, 298 flow [2025-01-10 00:55:40,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=134, PETRI_TRANSITIONS=125} [2025-01-10 00:55:40,231 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2025-01-10 00:55:40,232 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 125 transitions, 298 flow [2025-01-10 00:55:40,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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-10 00:55:40,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:40,232 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2025-01-10 00:55:40,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:55:40,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:55:40,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:40,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2035225238, now seen corresponding path program 1 times [2025-01-10 00:55:40,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:40,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318134009] [2025-01-10 00:55:40,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:40,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:40,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:55:40,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:55:40,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:40,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:40,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:40,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:40,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318134009] [2025-01-10 00:55:40,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318134009] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:40,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932971499] [2025-01-10 00:55:40,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:40,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:40,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:40,337 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-10 00:55:40,342 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-10 00:55:40,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:55:40,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:55:40,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:40,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:40,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:55:40,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:40,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:55:40,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932971499] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:55:40,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:55:40,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 00:55:40,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906818990] [2025-01-10 00:55:40,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:55:40,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:55:40,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:40,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:55:40,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:55:40,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2025-01-10 00:55:40,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 125 transitions, 298 flow. Second operand has 13 states, 13 states have (on average 95.07692307692308) internal successors, (1236), 13 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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-10 00:55:40,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:40,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2025-01-10 00:55:40,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:40,882 INFO L124 PetriNetUnfolderBase]: 64/326 cut-off events. [2025-01-10 00:55:40,883 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-01-10 00:55:40,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 326 events. 64/326 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1246 event pairs, 63 based on Foata normal form. 6/254 useless extension candidates. Maximal degree in co-relation 496. Up to 167 conditions per place. [2025-01-10 00:55:40,887 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 39 selfloop transitions, 11 changer transitions 0/131 dead transitions. [2025-01-10 00:55:40,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 131 transitions, 434 flow [2025-01-10 00:55:40,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:55:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:55:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1184 transitions. [2025-01-10 00:55:40,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2025-01-10 00:55:40,891 INFO L175 Difference]: Start difference. First operand has 134 places, 125 transitions, 298 flow. Second operand 12 states and 1184 transitions. [2025-01-10 00:55:40,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 131 transitions, 434 flow [2025-01-10 00:55:40,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 131 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:40,894 INFO L231 Difference]: Finished difference. Result has 149 places, 131 transitions, 358 flow [2025-01-10 00:55:40,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=358, PETRI_PLACES=149, PETRI_TRANSITIONS=131} [2025-01-10 00:55:40,895 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 13 predicate places. [2025-01-10 00:55:40,895 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 131 transitions, 358 flow [2025-01-10 00:55:40,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 95.07692307692308) internal successors, (1236), 13 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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-10 00:55:40,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:40,896 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2025-01-10 00:55:40,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 00:55:41,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:41,100 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:55:41,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:41,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1784788554, now seen corresponding path program 2 times [2025-01-10 00:55:41,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:41,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169057072] [2025-01-10 00:55:41,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:55:41,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:41,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-10 00:55:41,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 13 statements. [2025-01-10 00:55:41,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:55:41,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:41,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:41,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169057072] [2025-01-10 00:55:41,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169057072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:41,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:41,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:55:41,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590541075] [2025-01-10 00:55:41,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:41,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:55:41,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:41,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:55:41,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:55:41,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 134 [2025-01-10 00:55:41,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 131 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 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-10 00:55:41,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:41,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 134 [2025-01-10 00:55:41,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:41,379 INFO L124 PetriNetUnfolderBase]: 64/314 cut-off events. [2025-01-10 00:55:41,379 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-10 00:55:41,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 314 events. 64/314 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1211 event pairs, 63 based on Foata normal form. 6/248 useless extension candidates. Maximal degree in co-relation 478. Up to 171 conditions per place. [2025-01-10 00:55:41,381 INFO L140 encePairwiseOnDemand]: 110/134 looper letters, 38 selfloop transitions, 12 changer transitions 0/119 dead transitions. [2025-01-10 00:55:41,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 119 transitions, 434 flow [2025-01-10 00:55:41,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:41,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:41,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2025-01-10 00:55:41,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2025-01-10 00:55:41,384 INFO L175 Difference]: Start difference. First operand has 149 places, 131 transitions, 358 flow. Second operand 3 states and 298 transitions. [2025-01-10 00:55:41,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 119 transitions, 434 flow [2025-01-10 00:55:41,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 119 transitions, 386 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-01-10 00:55:41,389 INFO L231 Difference]: Finished difference. Result has 134 places, 119 transitions, 310 flow [2025-01-10 00:55:41,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=134, PETRI_TRANSITIONS=119} [2025-01-10 00:55:41,390 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2025-01-10 00:55:41,392 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 119 transitions, 310 flow [2025-01-10 00:55:41,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 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-10 00:55:41,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:41,392 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-01-10 00:55:41,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:55:41,392 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:55:41,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:41,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1489825840, now seen corresponding path program 1 times [2025-01-10 00:55:41,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:41,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919065955] [2025-01-10 00:55:41,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:41,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:41,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:55:41,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:55:41,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:41,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:41,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:41,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919065955] [2025-01-10 00:55:41,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919065955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:41,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:41,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:41,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209299330] [2025-01-10 00:55:41,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:41,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:55:41,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:41,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:55:41,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:55:41,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 134 [2025-01-10 00:55:41,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 119 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 0 states have call successors, (0), 0 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-10 00:55:41,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:41,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 134 [2025-01-10 00:55:41,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:41,961 INFO L124 PetriNetUnfolderBase]: 73/332 cut-off events. [2025-01-10 00:55:41,964 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-01-10 00:55:41,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 332 events. 73/332 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1334 event pairs, 72 based on Foata normal form. 2/270 useless extension candidates. Maximal degree in co-relation 533. Up to 201 conditions per place. [2025-01-10 00:55:41,966 INFO L140 encePairwiseOnDemand]: 125/134 looper letters, 56 selfloop transitions, 1 changer transitions 0/111 dead transitions. [2025-01-10 00:55:41,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 111 transitions, 408 flow [2025-01-10 00:55:41,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:55:41,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:55:41,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2025-01-10 00:55:41,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2025-01-10 00:55:41,967 INFO L175 Difference]: Start difference. First operand has 134 places, 119 transitions, 310 flow. Second operand 3 states and 292 transitions. [2025-01-10 00:55:41,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 111 transitions, 408 flow [2025-01-10 00:55:41,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 111 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:55:41,974 INFO L231 Difference]: Finished difference. Result has 126 places, 111 transitions, 272 flow [2025-01-10 00:55:41,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=126, PETRI_TRANSITIONS=111} [2025-01-10 00:55:41,974 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -10 predicate places. [2025-01-10 00:55:41,975 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 111 transitions, 272 flow [2025-01-10 00:55:41,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 0 states have call successors, (0), 0 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-10 00:55:41,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:41,975 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-01-10 00:55:41,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:55:41,975 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:55:41,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:41,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1489825839, now seen corresponding path program 1 times [2025-01-10 00:55:41,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:41,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632276612] [2025-01-10 00:55:41,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:41,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:41,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:55:42,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:55:42,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:42,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:42,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:42,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632276612] [2025-01-10 00:55:42,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632276612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:42,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:42,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:55:42,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518351897] [2025-01-10 00:55:42,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:42,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:42,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:42,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:42,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:42,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 134 [2025-01-10 00:55:42,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 111 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 0 states have call successors, (0), 0 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-10 00:55:42,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:42,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 134 [2025-01-10 00:55:42,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:42,740 INFO L124 PetriNetUnfolderBase]: 73/327 cut-off events. [2025-01-10 00:55:42,741 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-01-10 00:55:42,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 327 events. 73/327 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1319 event pairs, 63 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 544. Up to 158 conditions per place. [2025-01-10 00:55:42,742 INFO L140 encePairwiseOnDemand]: 116/134 looper letters, 43 selfloop transitions, 14 changer transitions 3/116 dead transitions. [2025-01-10 00:55:42,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 116 transitions, 402 flow [2025-01-10 00:55:42,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 459 transitions. [2025-01-10 00:55:42,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6850746268656717 [2025-01-10 00:55:42,744 INFO L175 Difference]: Start difference. First operand has 126 places, 111 transitions, 272 flow. Second operand 5 states and 459 transitions. [2025-01-10 00:55:42,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 116 transitions, 402 flow [2025-01-10 00:55:42,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 116 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:55:42,750 INFO L231 Difference]: Finished difference. Result has 125 places, 107 transitions, 291 flow [2025-01-10 00:55:42,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=125, PETRI_TRANSITIONS=107} [2025-01-10 00:55:42,751 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -11 predicate places. [2025-01-10 00:55:42,751 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 107 transitions, 291 flow [2025-01-10 00:55:42,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 0 states have call successors, (0), 0 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-10 00:55:42,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:42,751 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:42,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:55:42,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:55:42,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:42,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1242142843, now seen corresponding path program 1 times [2025-01-10 00:55:42,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:42,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067076840] [2025-01-10 00:55:42,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:42,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:42,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:55:42,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:55:42,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:42,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:43,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:43,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067076840] [2025-01-10 00:55:43,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067076840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:43,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:43,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:55:43,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785879878] [2025-01-10 00:55:43,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:43,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:43,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:43,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:43,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:43,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 134 [2025-01-10 00:55:43,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 107 transitions, 291 flow. Second operand has 7 states, 7 states have (on average 65.42857142857143) internal successors, (458), 7 states have internal predecessors, (458), 0 states have call successors, (0), 0 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-10 00:55:43,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:43,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 134 [2025-01-10 00:55:43,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:43,804 INFO L124 PetriNetUnfolderBase]: 64/292 cut-off events. [2025-01-10 00:55:43,804 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-01-10 00:55:43,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 292 events. 64/292 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1115 event pairs, 63 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 525. Up to 166 conditions per place. [2025-01-10 00:55:43,805 INFO L140 encePairwiseOnDemand]: 112/134 looper letters, 46 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2025-01-10 00:55:43,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 102 transitions, 407 flow [2025-01-10 00:55:43,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:55:43,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:55:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 570 transitions. [2025-01-10 00:55:43,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5317164179104478 [2025-01-10 00:55:43,807 INFO L175 Difference]: Start difference. First operand has 125 places, 107 transitions, 291 flow. Second operand 8 states and 570 transitions. [2025-01-10 00:55:43,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 102 transitions, 407 flow [2025-01-10 00:55:43,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 102 transitions, 379 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:43,809 INFO L231 Difference]: Finished difference. Result has 123 places, 102 transitions, 287 flow [2025-01-10 00:55:43,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=287, PETRI_PLACES=123, PETRI_TRANSITIONS=102} [2025-01-10 00:55:43,810 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -13 predicate places. [2025-01-10 00:55:43,810 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 102 transitions, 287 flow [2025-01-10 00:55:43,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 65.42857142857143) internal successors, (458), 7 states have internal predecessors, (458), 0 states have call successors, (0), 0 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-10 00:55:43,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:43,810 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:43,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:55:43,810 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:55:43,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:43,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1242142842, now seen corresponding path program 1 times [2025-01-10 00:55:43,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:43,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989943683] [2025-01-10 00:55:43,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:43,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:43,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:55:43,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:55:43,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:43,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:44,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:44,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989943683] [2025-01-10 00:55:44,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989943683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:44,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:44,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:55:44,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339287388] [2025-01-10 00:55:44,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:44,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:44,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:44,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:44,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:44,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 134 [2025-01-10 00:55:44,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 102 transitions, 287 flow. Second operand has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 0 states have call successors, (0), 0 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-10 00:55:44,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:44,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 134 [2025-01-10 00:55:44,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:44,868 INFO L124 PetriNetUnfolderBase]: 64/290 cut-off events. [2025-01-10 00:55:44,868 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-01-10 00:55:44,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 290 events. 64/290 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1130 event pairs, 63 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 517. Up to 172 conditions per place. [2025-01-10 00:55:44,870 INFO L140 encePairwiseOnDemand]: 119/134 looper letters, 49 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2025-01-10 00:55:44,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 100 transitions, 407 flow [2025-01-10 00:55:44,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:55:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:55:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 446 transitions. [2025-01-10 00:55:44,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47547974413646055 [2025-01-10 00:55:44,872 INFO L175 Difference]: Start difference. First operand has 123 places, 102 transitions, 287 flow. Second operand 7 states and 446 transitions. [2025-01-10 00:55:44,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 100 transitions, 407 flow [2025-01-10 00:55:44,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 100 transitions, 373 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 00:55:44,874 INFO L231 Difference]: Finished difference. Result has 120 places, 100 transitions, 275 flow [2025-01-10 00:55:44,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=120, PETRI_TRANSITIONS=100} [2025-01-10 00:55:44,876 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -16 predicate places. [2025-01-10 00:55:44,876 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 100 transitions, 275 flow [2025-01-10 00:55:44,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 0 states have call successors, (0), 0 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-10 00:55:44,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:44,877 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:44,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:55:44,877 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:55:44,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:44,878 INFO L85 PathProgramCache]: Analyzing trace with hash 301661875, now seen corresponding path program 1 times [2025-01-10 00:55:44,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:44,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344041380] [2025-01-10 00:55:44,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:44,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:44,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:55:44,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:55:44,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:44,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:45,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:45,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344041380] [2025-01-10 00:55:45,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344041380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:45,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:45,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:45,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748670242] [2025-01-10 00:55:45,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:45,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:45,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:45,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:45,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:45,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 134 [2025-01-10 00:55:45,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 100 transitions, 275 flow. Second operand has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 0 states have call successors, (0), 0 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-10 00:55:45,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:45,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 134 [2025-01-10 00:55:45,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:45,509 INFO L124 PetriNetUnfolderBase]: 64/289 cut-off events. [2025-01-10 00:55:45,509 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-01-10 00:55:45,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 289 events. 64/289 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1117 event pairs, 63 based on Foata normal form. 1/241 useless extension candidates. Maximal degree in co-relation 503. Up to 171 conditions per place. [2025-01-10 00:55:45,511 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 40 selfloop transitions, 13 changer transitions 0/99 dead transitions. [2025-01-10 00:55:45,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 99 transitions, 379 flow [2025-01-10 00:55:45,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:45,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:45,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2025-01-10 00:55:45,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6477611940298508 [2025-01-10 00:55:45,513 INFO L175 Difference]: Start difference. First operand has 120 places, 100 transitions, 275 flow. Second operand 5 states and 434 transitions. [2025-01-10 00:55:45,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 99 transitions, 379 flow [2025-01-10 00:55:45,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 99 transitions, 353 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 00:55:45,516 INFO L231 Difference]: Finished difference. Result has 117 places, 99 transitions, 273 flow [2025-01-10 00:55:45,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=117, PETRI_TRANSITIONS=99} [2025-01-10 00:55:45,517 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -19 predicate places. [2025-01-10 00:55:45,517 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 99 transitions, 273 flow [2025-01-10 00:55:45,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 0 states have call successors, (0), 0 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-10 00:55:45,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:45,518 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:45,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:55:45,518 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:55:45,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:45,519 INFO L85 PathProgramCache]: Analyzing trace with hash 301661874, now seen corresponding path program 1 times [2025-01-10 00:55:45,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:45,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580035262] [2025-01-10 00:55:45,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:45,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:45,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:55:45,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:55:45,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:45,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-10 00:55:45,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:45,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580035262] [2025-01-10 00:55:45,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580035262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:45,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:45,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:45,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234178023] [2025-01-10 00:55:45,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:45,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:45,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:45,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:45,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:45,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2025-01-10 00:55:45,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 99 transitions, 273 flow. Second operand has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 0 states have call successors, (0), 0 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-10 00:55:45,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:45,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2025-01-10 00:55:45,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:45,956 INFO L124 PetriNetUnfolderBase]: 64/288 cut-off events. [2025-01-10 00:55:45,957 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-01-10 00:55:45,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 288 events. 64/288 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1119 event pairs, 63 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 508. Up to 171 conditions per place. [2025-01-10 00:55:45,958 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 46 selfloop transitions, 13 changer transitions 0/98 dead transitions. [2025-01-10 00:55:45,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 98 transitions, 389 flow [2025-01-10 00:55:45,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 410 transitions. [2025-01-10 00:55:45,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6119402985074627 [2025-01-10 00:55:45,960 INFO L175 Difference]: Start difference. First operand has 117 places, 99 transitions, 273 flow. Second operand 5 states and 410 transitions. [2025-01-10 00:55:45,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 98 transitions, 389 flow [2025-01-10 00:55:45,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 98 transitions, 363 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:45,962 INFO L231 Difference]: Finished difference. Result has 116 places, 98 transitions, 271 flow [2025-01-10 00:55:45,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=116, PETRI_TRANSITIONS=98} [2025-01-10 00:55:45,962 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -20 predicate places. [2025-01-10 00:55:45,962 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 98 transitions, 271 flow [2025-01-10 00:55:45,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.2) internal successors, (371), 5 states have internal predecessors, (371), 0 states have call successors, (0), 0 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-10 00:55:45,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:45,963 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:45,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:55:45,964 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:55:45,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:45,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1738127333, now seen corresponding path program 1 times [2025-01-10 00:55:45,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:45,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875283336] [2025-01-10 00:55:45,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:45,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:45,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:55:46,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:55:46,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:46,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:46,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:46,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875283336] [2025-01-10 00:55:46,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875283336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:46,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:46,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:46,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181416472] [2025-01-10 00:55:46,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:46,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:55:46,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:46,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:55:46,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:55:46,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 134 [2025-01-10 00:55:46,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 98 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 0 states have call successors, (0), 0 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-10 00:55:46,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:46,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 134 [2025-01-10 00:55:46,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:46,661 INFO L124 PetriNetUnfolderBase]: 73/315 cut-off events. [2025-01-10 00:55:46,661 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-01-10 00:55:46,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 315 events. 73/315 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1307 event pairs, 63 based on Foata normal form. 1/259 useless extension candidates. Maximal degree in co-relation 545. Up to 164 conditions per place. [2025-01-10 00:55:46,663 INFO L140 encePairwiseOnDemand]: 128/134 looper letters, 54 selfloop transitions, 3 changer transitions 3/104 dead transitions. [2025-01-10 00:55:46,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 104 transitions, 403 flow [2025-01-10 00:55:46,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:55:46,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:55:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 381 transitions. [2025-01-10 00:55:46,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.710820895522388 [2025-01-10 00:55:46,664 INFO L175 Difference]: Start difference. First operand has 116 places, 98 transitions, 271 flow. Second operand 4 states and 381 transitions. [2025-01-10 00:55:46,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 104 transitions, 403 flow [2025-01-10 00:55:46,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 104 transitions, 377 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:46,666 INFO L231 Difference]: Finished difference. Result has 112 places, 95 transitions, 245 flow [2025-01-10 00:55:46,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=245, PETRI_PLACES=112, PETRI_TRANSITIONS=95} [2025-01-10 00:55:46,666 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -24 predicate places. [2025-01-10 00:55:46,666 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 95 transitions, 245 flow [2025-01-10 00:55:46,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 0 states have call successors, (0), 0 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-10 00:55:46,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:46,667 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:46,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:55:46,667 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:55:46,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:46,667 INFO L85 PathProgramCache]: Analyzing trace with hash 334476519, now seen corresponding path program 1 times [2025-01-10 00:55:46,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:46,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331843111] [2025-01-10 00:55:46,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:46,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:46,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:55:46,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:55:46,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:46,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-10 00:55:47,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:47,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331843111] [2025-01-10 00:55:47,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331843111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:47,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:47,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:55:47,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592953335] [2025-01-10 00:55:47,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:47,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:47,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:47,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:47,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:47,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 134 [2025-01-10 00:55:47,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 95 transitions, 245 flow. Second operand has 7 states, 7 states have (on average 58.57142857142857) internal successors, (410), 7 states have internal predecessors, (410), 0 states have call successors, (0), 0 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-10 00:55:47,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:47,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 134 [2025-01-10 00:55:47,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:48,113 INFO L124 PetriNetUnfolderBase]: 64/281 cut-off events. [2025-01-10 00:55:48,113 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-01-10 00:55:48,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 281 events. 64/281 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1105 event pairs, 54 based on Foata normal form. 2/237 useless extension candidates. Maximal degree in co-relation 498. Up to 132 conditions per place. [2025-01-10 00:55:48,114 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 48 selfloop transitions, 16 changer transitions 3/100 dead transitions. [2025-01-10 00:55:48,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 100 transitions, 389 flow [2025-01-10 00:55:48,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:55:48,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:55:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 453 transitions. [2025-01-10 00:55:48,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48294243070362475 [2025-01-10 00:55:48,116 INFO L175 Difference]: Start difference. First operand has 112 places, 95 transitions, 245 flow. Second operand 7 states and 453 transitions. [2025-01-10 00:55:48,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 100 transitions, 389 flow [2025-01-10 00:55:48,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 100 transitions, 383 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:55:48,118 INFO L231 Difference]: Finished difference. Result has 111 places, 91 transitions, 263 flow [2025-01-10 00:55:48,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=263, PETRI_PLACES=111, PETRI_TRANSITIONS=91} [2025-01-10 00:55:48,119 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -25 predicate places. [2025-01-10 00:55:48,119 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 91 transitions, 263 flow [2025-01-10 00:55:48,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 58.57142857142857) internal successors, (410), 7 states have internal predecessors, (410), 0 states have call successors, (0), 0 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-10 00:55:48,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:48,119 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:48,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:55:48,120 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:55:48,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:48,121 INFO L85 PathProgramCache]: Analyzing trace with hash 334476518, now seen corresponding path program 1 times [2025-01-10 00:55:48,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:48,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117861237] [2025-01-10 00:55:48,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:48,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:48,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:55:48,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:55:48,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:48,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-10 00:55:48,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:48,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117861237] [2025-01-10 00:55:48,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117861237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:48,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:48,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:55:48,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607343275] [2025-01-10 00:55:48,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:48,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:55:48,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:48,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:55:48,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:55:48,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 134 [2025-01-10 00:55:48,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 91 transitions, 263 flow. Second operand has 7 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 0 states have call successors, (0), 0 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-10 00:55:48,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:48,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 134 [2025-01-10 00:55:48,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:48,876 INFO L124 PetriNetUnfolderBase]: 64/279 cut-off events. [2025-01-10 00:55:48,876 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-01-10 00:55:48,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 279 events. 64/279 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1090 event pairs, 54 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 513. Up to 130 conditions per place. [2025-01-10 00:55:48,877 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 49 selfloop transitions, 18 changer transitions 3/98 dead transitions. [2025-01-10 00:55:48,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 98 transitions, 417 flow [2025-01-10 00:55:48,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:55:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:55:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 574 transitions. [2025-01-10 00:55:48,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5354477611940298 [2025-01-10 00:55:48,879 INFO L175 Difference]: Start difference. First operand has 111 places, 91 transitions, 263 flow. Second operand 8 states and 574 transitions. [2025-01-10 00:55:48,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 98 transitions, 417 flow [2025-01-10 00:55:48,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 98 transitions, 385 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 00:55:48,881 INFO L231 Difference]: Finished difference. Result has 110 places, 89 transitions, 263 flow [2025-01-10 00:55:48,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=263, PETRI_PLACES=110, PETRI_TRANSITIONS=89} [2025-01-10 00:55:48,881 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -26 predicate places. [2025-01-10 00:55:48,881 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 89 transitions, 263 flow [2025-01-10 00:55:48,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 0 states have call successors, (0), 0 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-10 00:55:48,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:48,881 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:48,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:55:48,882 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:55:48,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:48,882 INFO L85 PathProgramCache]: Analyzing trace with hash -690587040, now seen corresponding path program 1 times [2025-01-10 00:55:48,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:48,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391745654] [2025-01-10 00:55:48,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:48,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:48,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:55:48,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:55:48,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:48,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-10 00:55:48,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:48,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391745654] [2025-01-10 00:55:48,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391745654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:48,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:48,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:48,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315620452] [2025-01-10 00:55:48,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:48,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:48,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:48,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:48,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:49,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2025-01-10 00:55:49,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 89 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 0 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-10 00:55:49,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:49,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2025-01-10 00:55:49,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:49,273 INFO L124 PetriNetUnfolderBase]: 64/278 cut-off events. [2025-01-10 00:55:49,273 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-01-10 00:55:49,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 278 events. 64/278 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1096 event pairs, 63 based on Foata normal form. 1/235 useless extension candidates. Maximal degree in co-relation 511. Up to 170 conditions per place. [2025-01-10 00:55:49,275 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 45 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2025-01-10 00:55:49,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 88 transitions, 377 flow [2025-01-10 00:55:49,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 409 transitions. [2025-01-10 00:55:49,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6104477611940299 [2025-01-10 00:55:49,276 INFO L175 Difference]: Start difference. First operand has 110 places, 89 transitions, 263 flow. Second operand 5 states and 409 transitions. [2025-01-10 00:55:49,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 88 transitions, 377 flow [2025-01-10 00:55:49,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 88 transitions, 341 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 00:55:49,278 INFO L231 Difference]: Finished difference. Result has 106 places, 88 transitions, 251 flow [2025-01-10 00:55:49,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=106, PETRI_TRANSITIONS=88} [2025-01-10 00:55:49,279 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -30 predicate places. [2025-01-10 00:55:49,279 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 88 transitions, 251 flow [2025-01-10 00:55:49,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 0 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-10 00:55:49,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:49,280 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:55:49,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:55:49,280 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:55:49,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:49,280 INFO L85 PathProgramCache]: Analyzing trace with hash -690587039, now seen corresponding path program 1 times [2025-01-10 00:55:49,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:49,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607219171] [2025-01-10 00:55:49,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:49,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:49,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:55:49,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:55:49,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:49,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-10 00:55:49,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:49,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607219171] [2025-01-10 00:55:49,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607219171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:55:49,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:55:49,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:55:49,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970898724] [2025-01-10 00:55:49,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:55:49,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:55:49,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:49,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:55:49,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:55:49,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 134 [2025-01-10 00:55:49,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 88 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 0 states have call successors, (0), 0 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-10 00:55:49,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:55:49,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 134 [2025-01-10 00:55:49,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:55:49,767 INFO L124 PetriNetUnfolderBase]: 64/277 cut-off events. [2025-01-10 00:55:49,767 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-01-10 00:55:49,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 277 events. 64/277 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1088 event pairs, 63 based on Foata normal form. 1/233 useless extension candidates. Maximal degree in co-relation 490. Up to 170 conditions per place. [2025-01-10 00:55:49,768 INFO L140 encePairwiseOnDemand]: 120/134 looper letters, 39 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2025-01-10 00:55:49,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 87 transitions, 353 flow [2025-01-10 00:55:49,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:55:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:55:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 433 transitions. [2025-01-10 00:55:49,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6462686567164179 [2025-01-10 00:55:49,770 INFO L175 Difference]: Start difference. First operand has 106 places, 88 transitions, 251 flow. Second operand 5 states and 433 transitions. [2025-01-10 00:55:49,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 87 transitions, 353 flow [2025-01-10 00:55:49,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 87 transitions, 327 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:55:49,771 INFO L231 Difference]: Finished difference. Result has 105 places, 87 transitions, 249 flow [2025-01-10 00:55:49,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=105, PETRI_TRANSITIONS=87} [2025-01-10 00:55:49,772 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -31 predicate places. [2025-01-10 00:55:49,773 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 249 flow [2025-01-10 00:55:49,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 0 states have call successors, (0), 0 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-10 00:55:49,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:55:49,773 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 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-10 00:55:49,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:55:49,773 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:55:49,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:55:49,774 INFO L85 PathProgramCache]: Analyzing trace with hash 969285793, now seen corresponding path program 1 times [2025-01-10 00:55:49,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:55:49,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313128752] [2025-01-10 00:55:49,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:55:49,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 00:55:49,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 00:55:49,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:49,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:51,260 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:51,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:55:51,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313128752] [2025-01-10 00:55:51,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313128752] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:55:51,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677128952] [2025-01-10 00:55:51,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:55:51,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:55:51,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:55:51,265 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:55:51,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:55:51,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 00:55:51,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 00:55:51,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:55:51,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:55:51,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-10 00:55:51,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:55:51,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:55:51,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:55:51,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 00:55:51,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-10 00:55:51,621 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-01-10 00:55:51,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2025-01-10 00:55:51,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 17 [2025-01-10 00:55:51,735 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2025-01-10 00:55:51,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2025-01-10 00:55:51,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:55:51,838 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-01-10 00:55:51,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2025-01-10 00:55:51,850 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-01-10 00:55:51,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2025-01-10 00:55:51,868 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-01-10 00:55:51,868 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 1 case distinctions, treesize of input 37 treesize of output 21 [2025-01-10 00:55:51,882 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2025-01-10 00:55:51,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 25 treesize of output 30 [2025-01-10 00:55:54,665 INFO L349 Elim1Store]: treesize reduction 130, result has 19.8 percent of original size [2025-01-10 00:55:54,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 46 [2025-01-10 00:55:56,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:55:56,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 26 [2025-01-10 00:55:56,593 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-10 00:55:56,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 7 [2025-01-10 00:55:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:56,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:55:56,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-01-10 00:55:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:55:57,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677128952] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:55:57,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:55:57,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 8] total 34 [2025-01-10 00:55:57,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95241997] [2025-01-10 00:55:57,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:55:57,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-10 00:55:57,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:55:57,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-10 00:55:57,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1029, Unknown=3, NotChecked=0, Total=1190 [2025-01-10 00:56:28,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 134 [2025-01-10 00:56:28,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 87 transitions, 249 flow. Second operand has 35 states, 35 states have (on average 37.02857142857143) internal successors, (1296), 35 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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-10 00:56:28,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:28,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 134 [2025-01-10 00:56:28,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:29,135 INFO L124 PetriNetUnfolderBase]: 89/326 cut-off events. [2025-01-10 00:56:29,135 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-01-10 00:56:29,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 326 events. 89/326 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1389 event pairs, 77 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 602. Up to 177 conditions per place. [2025-01-10 00:56:29,137 INFO L140 encePairwiseOnDemand]: 113/134 looper letters, 55 selfloop transitions, 18 changer transitions 3/95 dead transitions. [2025-01-10 00:56:29,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 95 transitions, 417 flow [2025-01-10 00:56:29,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 00:56:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 00:56:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 559 transitions. [2025-01-10 00:56:29,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2979744136460554 [2025-01-10 00:56:29,139 INFO L175 Difference]: Start difference. First operand has 105 places, 87 transitions, 249 flow. Second operand 14 states and 559 transitions. [2025-01-10 00:56:29,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 95 transitions, 417 flow [2025-01-10 00:56:29,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 95 transitions, 391 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:56:29,142 INFO L231 Difference]: Finished difference. Result has 111 places, 84 transitions, 253 flow [2025-01-10 00:56:29,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=253, PETRI_PLACES=111, PETRI_TRANSITIONS=84} [2025-01-10 00:56:29,142 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -25 predicate places. [2025-01-10 00:56:29,142 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 84 transitions, 253 flow [2025-01-10 00:56:29,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 37.02857142857143) internal successors, (1296), 35 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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-10 00:56:29,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:29,144 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 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-10 00:56:29,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 00:56:29,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:29,345 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:56:29,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:29,345 INFO L85 PathProgramCache]: Analyzing trace with hash -524229501, now seen corresponding path program 1 times [2025-01-10 00:56:29,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:29,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592023510] [2025-01-10 00:56:29,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:29,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:29,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 00:56:29,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 00:56:29,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:29,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-10 00:56:29,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:29,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592023510] [2025-01-10 00:56:29,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592023510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:29,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:29,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:56:29,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313427677] [2025-01-10 00:56:29,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:29,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:56:29,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:29,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:56:29,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:56:29,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 134 [2025-01-10 00:56:29,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 84 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 0 states have call successors, (0), 0 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-10 00:56:29,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:29,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 134 [2025-01-10 00:56:29,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:29,830 INFO L124 PetriNetUnfolderBase]: 73/274 cut-off events. [2025-01-10 00:56:29,831 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-01-10 00:56:29,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 274 events. 73/274 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1056 event pairs, 18 based on Foata normal form. 2/241 useless extension candidates. Maximal degree in co-relation 518. Up to 135 conditions per place. [2025-01-10 00:56:29,832 INFO L140 encePairwiseOnDemand]: 116/134 looper letters, 44 selfloop transitions, 16 changer transitions 0/91 dead transitions. [2025-01-10 00:56:29,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 91 transitions, 387 flow [2025-01-10 00:56:29,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:56:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:56:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2025-01-10 00:56:29,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6393034825870647 [2025-01-10 00:56:29,834 INFO L175 Difference]: Start difference. First operand has 111 places, 84 transitions, 253 flow. Second operand 6 states and 514 transitions. [2025-01-10 00:56:29,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 91 transitions, 387 flow [2025-01-10 00:56:29,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 91 transitions, 351 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-01-10 00:56:29,836 INFO L231 Difference]: Finished difference. Result has 101 places, 82 transitions, 245 flow [2025-01-10 00:56:29,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=245, PETRI_PLACES=101, PETRI_TRANSITIONS=82} [2025-01-10 00:56:29,836 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -35 predicate places. [2025-01-10 00:56:29,836 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 82 transitions, 245 flow [2025-01-10 00:56:29,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 0 states have call successors, (0), 0 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-10 00:56:29,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:29,837 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 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-10 00:56:29,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:56:29,837 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:56:29,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:29,837 INFO L85 PathProgramCache]: Analyzing trace with hash -524229502, now seen corresponding path program 1 times [2025-01-10 00:56:29,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:29,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953290752] [2025-01-10 00:56:29,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:29,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:29,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 00:56:29,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 00:56:29,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:29,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-10 00:56:29,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:29,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953290752] [2025-01-10 00:56:29,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953290752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:29,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:29,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:56:29,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125088301] [2025-01-10 00:56:29,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:29,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:56:29,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:29,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:56:29,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:56:30,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 134 [2025-01-10 00:56:30,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 82 transitions, 245 flow. Second operand has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 0 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-10 00:56:30,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:30,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 134 [2025-01-10 00:56:30,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:30,264 INFO L124 PetriNetUnfolderBase]: 73/288 cut-off events. [2025-01-10 00:56:30,264 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-01-10 00:56:30,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 288 events. 73/288 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1161 event pairs, 45 based on Foata normal form. 2/244 useless extension candidates. Maximal degree in co-relation 536. Up to 108 conditions per place. [2025-01-10 00:56:30,266 INFO L140 encePairwiseOnDemand]: 114/134 looper letters, 48 selfloop transitions, 18 changer transitions 0/89 dead transitions. [2025-01-10 00:56:30,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 89 transitions, 391 flow [2025-01-10 00:56:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:56:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:56:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 484 transitions. [2025-01-10 00:56:30,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6019900497512438 [2025-01-10 00:56:30,269 INFO L175 Difference]: Start difference. First operand has 101 places, 82 transitions, 245 flow. Second operand 6 states and 484 transitions. [2025-01-10 00:56:30,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 89 transitions, 391 flow [2025-01-10 00:56:30,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 89 transitions, 359 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 00:56:30,271 INFO L231 Difference]: Finished difference. Result has 99 places, 80 transitions, 245 flow [2025-01-10 00:56:30,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=245, PETRI_PLACES=99, PETRI_TRANSITIONS=80} [2025-01-10 00:56:30,272 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -37 predicate places. [2025-01-10 00:56:30,272 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 80 transitions, 245 flow [2025-01-10 00:56:30,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 0 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-10 00:56:30,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:30,273 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:56:30,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:56:30,273 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:56:30,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:30,274 INFO L85 PathProgramCache]: Analyzing trace with hash -849325532, now seen corresponding path program 1 times [2025-01-10 00:56:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:30,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623706015] [2025-01-10 00:56:30,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:30,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:30,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:56:30,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:56:30,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:30,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-10 00:56:30,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:30,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623706015] [2025-01-10 00:56:30,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623706015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:30,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:30,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:56:30,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821965225] [2025-01-10 00:56:30,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:30,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:56:30,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:30,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:56:30,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:56:30,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 134 [2025-01-10 00:56:30,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 80 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 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-10 00:56:30,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:30,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 134 [2025-01-10 00:56:30,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:30,602 INFO L124 PetriNetUnfolderBase]: 64/273 cut-off events. [2025-01-10 00:56:30,602 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-01-10 00:56:30,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 273 events. 64/273 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1104 event pairs, 56 based on Foata normal form. 8/244 useless extension candidates. Maximal degree in co-relation 516. Up to 162 conditions per place. [2025-01-10 00:56:30,604 INFO L140 encePairwiseOnDemand]: 130/134 looper letters, 55 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-01-10 00:56:30,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 85 transitions, 375 flow [2025-01-10 00:56:30,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:56:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:56:30,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2025-01-10 00:56:30,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8084577114427861 [2025-01-10 00:56:30,605 INFO L175 Difference]: Start difference. First operand has 99 places, 80 transitions, 245 flow. Second operand 3 states and 325 transitions. [2025-01-10 00:56:30,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 85 transitions, 375 flow [2025-01-10 00:56:30,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 85 transitions, 333 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 00:56:30,606 INFO L231 Difference]: Finished difference. Result has 94 places, 78 transitions, 209 flow [2025-01-10 00:56:30,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=94, PETRI_TRANSITIONS=78} [2025-01-10 00:56:30,607 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -42 predicate places. [2025-01-10 00:56:30,607 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 78 transitions, 209 flow [2025-01-10 00:56:30,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 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-10 00:56:30,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:30,607 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:56:30,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 00:56:30,607 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:56:30,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:30,608 INFO L85 PathProgramCache]: Analyzing trace with hash -849325533, now seen corresponding path program 1 times [2025-01-10 00:56:30,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:30,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133025862] [2025-01-10 00:56:30,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:30,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:30,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 00:56:30,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 00:56:30,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:30,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-10 00:56:30,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:30,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133025862] [2025-01-10 00:56:30,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133025862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:30,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:30,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:56:30,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286706961] [2025-01-10 00:56:30,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:30,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:56:30,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:30,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:56:30,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:56:30,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 134 [2025-01-10 00:56:30,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 78 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 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-10 00:56:30,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:30,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 134 [2025-01-10 00:56:30,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:30,863 INFO L124 PetriNetUnfolderBase]: 71/264 cut-off events. [2025-01-10 00:56:30,863 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-01-10 00:56:30,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 264 events. 71/264 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 973 event pairs, 56 based on Foata normal form. 8/243 useless extension candidates. Maximal degree in co-relation 493. Up to 162 conditions per place. [2025-01-10 00:56:30,865 INFO L140 encePairwiseOnDemand]: 130/134 looper letters, 56 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2025-01-10 00:56:30,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 83 transitions, 335 flow [2025-01-10 00:56:30,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:56:30,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:56:30,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2025-01-10 00:56:30,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8034825870646766 [2025-01-10 00:56:30,867 INFO L175 Difference]: Start difference. First operand has 94 places, 78 transitions, 209 flow. Second operand 3 states and 323 transitions. [2025-01-10 00:56:30,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 83 transitions, 335 flow [2025-01-10 00:56:30,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 83 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:56:30,869 INFO L231 Difference]: Finished difference. Result has 92 places, 76 transitions, 205 flow [2025-01-10 00:56:30,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=92, PETRI_TRANSITIONS=76} [2025-01-10 00:56:30,870 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -44 predicate places. [2025-01-10 00:56:30,870 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 76 transitions, 205 flow [2025-01-10 00:56:30,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 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-10 00:56:30,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:30,870 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:56:30,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 00:56:30,871 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:56:30,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:30,871 INFO L85 PathProgramCache]: Analyzing trace with hash -682436334, now seen corresponding path program 1 times [2025-01-10 00:56:30,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:30,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575701616] [2025-01-10 00:56:30,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:30,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:30,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 00:56:30,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 00:56:30,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:30,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-10 00:56:31,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:31,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575701616] [2025-01-10 00:56:31,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575701616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:31,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:31,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:56:31,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733569837] [2025-01-10 00:56:31,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:31,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:56:31,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:31,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:56:31,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:56:31,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 134 [2025-01-10 00:56:31,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 76 transitions, 205 flow. Second operand has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 0 states have call successors, (0), 0 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-10 00:56:31,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:31,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 134 [2025-01-10 00:56:31,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:32,033 INFO L124 PetriNetUnfolderBase]: 85/312 cut-off events. [2025-01-10 00:56:32,033 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-01-10 00:56:32,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 312 events. 85/312 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1290 event pairs, 60 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 579. Up to 157 conditions per place. [2025-01-10 00:56:32,034 INFO L140 encePairwiseOnDemand]: 118/134 looper letters, 57 selfloop transitions, 15 changer transitions 3/95 dead transitions. [2025-01-10 00:56:32,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 95 transitions, 401 flow [2025-01-10 00:56:32,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:56:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:56:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 642 transitions. [2025-01-10 00:56:32,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5988805970149254 [2025-01-10 00:56:32,035 INFO L175 Difference]: Start difference. First operand has 92 places, 76 transitions, 205 flow. Second operand 8 states and 642 transitions. [2025-01-10 00:56:32,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 95 transitions, 401 flow [2025-01-10 00:56:32,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 95 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:56:32,037 INFO L231 Difference]: Finished difference. Result has 98 places, 78 transitions, 244 flow [2025-01-10 00:56:32,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=244, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2025-01-10 00:56:32,038 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -38 predicate places. [2025-01-10 00:56:32,038 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 78 transitions, 244 flow [2025-01-10 00:56:32,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 0 states have call successors, (0), 0 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-10 00:56:32,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:32,038 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:56:32,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 00:56:32,038 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:56:32,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:32,039 INFO L85 PathProgramCache]: Analyzing trace with hash -682436335, now seen corresponding path program 1 times [2025-01-10 00:56:32,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:32,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331494406] [2025-01-10 00:56:32,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:32,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:32,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 00:56:32,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 00:56:32,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:32,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-10 00:56:32,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:32,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331494406] [2025-01-10 00:56:32,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331494406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:32,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:56:32,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:56:32,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679391410] [2025-01-10 00:56:32,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:32,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:56:32,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:32,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:56:32,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:56:32,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 134 [2025-01-10 00:56:32,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 78 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 0 states have call successors, (0), 0 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-10 00:56:32,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:32,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 134 [2025-01-10 00:56:32,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:32,601 INFO L124 PetriNetUnfolderBase]: 79/290 cut-off events. [2025-01-10 00:56:32,601 INFO L125 PetriNetUnfolderBase]: For 86/92 co-relation queries the response was YES. [2025-01-10 00:56:32,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 290 events. 79/290 cut-off events. For 86/92 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1140 event pairs, 54 based on Foata normal form. 17/276 useless extension candidates. Maximal degree in co-relation 593. Up to 139 conditions per place. [2025-01-10 00:56:32,602 INFO L140 encePairwiseOnDemand]: 123/134 looper letters, 60 selfloop transitions, 11 changer transitions 3/94 dead transitions. [2025-01-10 00:56:32,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 94 transitions, 426 flow [2025-01-10 00:56:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:56:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:56:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions. [2025-01-10 00:56:32,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6766169154228856 [2025-01-10 00:56:32,604 INFO L175 Difference]: Start difference. First operand has 98 places, 78 transitions, 244 flow. Second operand 6 states and 544 transitions. [2025-01-10 00:56:32,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 94 transitions, 426 flow [2025-01-10 00:56:32,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 94 transitions, 399 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 00:56:32,606 INFO L231 Difference]: Finished difference. Result has 96 places, 77 transitions, 237 flow [2025-01-10 00:56:32,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=96, PETRI_TRANSITIONS=77} [2025-01-10 00:56:32,606 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -40 predicate places. [2025-01-10 00:56:32,606 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 77 transitions, 237 flow [2025-01-10 00:56:32,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 0 states have call successors, (0), 0 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-10 00:56:32,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:32,606 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:56:32,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 00:56:32,607 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:56:32,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:32,607 INFO L85 PathProgramCache]: Analyzing trace with hash 319310914, now seen corresponding path program 1 times [2025-01-10 00:56:32,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:32,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325522558] [2025-01-10 00:56:32,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:32,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:32,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 00:56:32,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 00:56:32,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:32,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:56:35,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:35,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325522558] [2025-01-10 00:56:35,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325522558] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:56:35,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395742310] [2025-01-10 00:56:35,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:35,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:35,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:56:35,282 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:56:35,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:56:35,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 00:56:35,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 00:56:35,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:35,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:35,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 131 conjuncts are in the unsatisfiable core [2025-01-10 00:56:35,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:56:35,618 INFO L349 Elim1Store]: treesize reduction 44, result has 37.1 percent of original size [2025-01-10 00:56:35,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2025-01-10 00:56:35,683 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-01-10 00:56:35,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 33 [2025-01-10 00:56:35,694 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 00:56:35,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-10 00:56:36,047 INFO L349 Elim1Store]: treesize reduction 65, result has 55.2 percent of original size [2025-01-10 00:56:36,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 159 [2025-01-10 00:56:36,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 00:56:36,319 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 37 treesize of output 25 [2025-01-10 00:56:36,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-01-10 00:56:36,403 INFO L349 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2025-01-10 00:56:36,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 145 [2025-01-10 00:56:36,416 INFO L349 Elim1Store]: treesize reduction 81, result has 25.0 percent of original size [2025-01-10 00:56:36,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2025-01-10 00:56:36,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 29 [2025-01-10 00:56:36,446 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-01-10 00:56:36,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2025-01-10 00:56:36,514 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 104 treesize of output 79 [2025-01-10 00:56:36,529 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 34 treesize of output 29 [2025-01-10 00:56:36,554 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 104 treesize of output 79 [2025-01-10 00:56:36,568 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 34 treesize of output 29 [2025-01-10 00:56:36,794 INFO L349 Elim1Store]: treesize reduction 51, result has 49.0 percent of original size [2025-01-10 00:56:36,794 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 1 case distinctions, treesize of input 133 treesize of output 112 [2025-01-10 00:56:36,810 INFO L349 Elim1Store]: treesize reduction 75, result has 25.0 percent of original size [2025-01-10 00:56:36,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2025-01-10 00:56:37,035 INFO L349 Elim1Store]: treesize reduction 53, result has 32.1 percent of original size [2025-01-10 00:56:37,035 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 2 case distinctions, treesize of input 279 treesize of output 229 [2025-01-10 00:56:37,058 INFO L349 Elim1Store]: treesize reduction 53, result has 32.1 percent of original size [2025-01-10 00:56:37,058 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 2 case distinctions, treesize of input 294 treesize of output 294 [2025-01-10 00:56:37,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-10 00:56:37,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:56:37,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 363 treesize of output 364 [2025-01-10 00:56:38,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:56:38,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 955 treesize of output 635 [2025-01-10 00:56:38,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 523 treesize of output 363 [2025-01-10 00:56:38,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:56:38,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 342 treesize of output 288 [2025-01-10 00:56:38,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:56:38,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 186 treesize of output 222 [2025-01-10 00:56:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-10 00:56:43,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:56:43,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395742310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:43,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 00:56:43,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [27] total 47 [2025-01-10 00:56:43,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757198181] [2025-01-10 00:56:43,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:43,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 00:56:43,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:43,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 00:56:43,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2070, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 00:56:52,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 134 [2025-01-10 00:56:52,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 77 transitions, 237 flow. Second operand has 22 states, 22 states have (on average 45.77272727272727) internal successors, (1007), 22 states have internal predecessors, (1007), 0 states have call successors, (0), 0 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-10 00:56:52,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:56:52,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 134 [2025-01-10 00:56:52,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:56:54,481 INFO L124 PetriNetUnfolderBase]: 132/421 cut-off events. [2025-01-10 00:56:54,481 INFO L125 PetriNetUnfolderBase]: For 148/155 co-relation queries the response was YES. [2025-01-10 00:56:54,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 421 events. 132/421 cut-off events. For 148/155 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1935 event pairs, 6 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 877. Up to 83 conditions per place. [2025-01-10 00:56:54,483 INFO L140 encePairwiseOnDemand]: 113/134 looper letters, 81 selfloop transitions, 27 changer transitions 3/122 dead transitions. [2025-01-10 00:56:54,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 122 transitions, 569 flow [2025-01-10 00:56:54,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 00:56:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 00:56:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1025 transitions. [2025-01-10 00:56:54,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3642501776830135 [2025-01-10 00:56:54,485 INFO L175 Difference]: Start difference. First operand has 96 places, 77 transitions, 237 flow. Second operand 21 states and 1025 transitions. [2025-01-10 00:56:54,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 122 transitions, 569 flow [2025-01-10 00:56:54,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 122 transitions, 537 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 00:56:54,487 INFO L231 Difference]: Finished difference. Result has 114 places, 85 transitions, 310 flow [2025-01-10 00:56:54,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=310, PETRI_PLACES=114, PETRI_TRANSITIONS=85} [2025-01-10 00:56:54,488 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -22 predicate places. [2025-01-10 00:56:54,488 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 85 transitions, 310 flow [2025-01-10 00:56:54,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 45.77272727272727) internal successors, (1007), 22 states have internal predecessors, (1007), 0 states have call successors, (0), 0 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-10 00:56:54,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:56:54,488 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:56:54,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:56:54,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 00:56:54,689 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2025-01-10 00:56:54,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:56:54,693 INFO L85 PathProgramCache]: Analyzing trace with hash 319310913, now seen corresponding path program 1 times [2025-01-10 00:56:54,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:56:54,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423666854] [2025-01-10 00:56:54,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:54,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:56:54,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 00:56:54,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 00:56:54,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:54,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:56:56,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:56:56,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423666854] [2025-01-10 00:56:56,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423666854] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:56:56,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158344931] [2025-01-10 00:56:56,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:56:56,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:56:56,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:56:57,000 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:56:57,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 00:56:57,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 00:56:57,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 00:56:57,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:56:57,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:56:57,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 109 conjuncts are in the unsatisfiable core [2025-01-10 00:56:57,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:56:57,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 00:56:57,311 INFO L349 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2025-01-10 00:56:57,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 37 [2025-01-10 00:56:57,382 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-01-10 00:56:57,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 33 [2025-01-10 00:56:57,406 INFO L349 Elim1Store]: treesize reduction 64, result has 35.4 percent of original size [2025-01-10 00:56:57,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 44 [2025-01-10 00:56:57,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-01-10 00:56:57,559 INFO L349 Elim1Store]: treesize reduction 150, result has 31.2 percent of original size [2025-01-10 00:56:57,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 123 [2025-01-10 00:56:57,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-01-10 00:56:57,961 INFO L349 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2025-01-10 00:56:57,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 185 [2025-01-10 00:56:58,014 INFO L349 Elim1Store]: treesize reduction 272, result has 30.8 percent of original size [2025-01-10 00:56:58,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 136 treesize of output 200 [2025-01-10 00:56:58,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 171 [2025-01-10 00:56:58,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 171 [2025-01-10 00:56:58,450 INFO L349 Elim1Store]: treesize reduction 63, result has 37.0 percent of original size [2025-01-10 00:56:58,451 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 1 case distinctions, treesize of input 300 treesize of output 223 [2025-01-10 00:56:58,700 INFO L349 Elim1Store]: treesize reduction 53, result has 32.1 percent of original size [2025-01-10 00:56:58,700 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 2 case distinctions, treesize of input 300 treesize of output 270 [2025-01-10 00:56:59,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:56:59,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 661 treesize of output 405 [2025-01-10 00:56:59,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:56:59,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 389 treesize of output 253 [2025-01-10 00:56:59,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 00:56:59,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 152 [2025-01-10 00:56:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-10 00:56:59,662 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:56:59,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158344931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:56:59,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 00:56:59,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [27] total 44 [2025-01-10 00:56:59,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83989328] [2025-01-10 00:56:59,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:56:59,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 00:56:59,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:56:59,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 00:56:59,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1796, Unknown=0, NotChecked=0, Total=1980 [2025-01-10 00:57:05,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 134 [2025-01-10 00:57:05,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 85 transitions, 310 flow. Second operand has 18 states, 18 states have (on average 57.166666666666664) internal successors, (1029), 18 states have internal predecessors, (1029), 0 states have call successors, (0), 0 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-10 00:57:05,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:05,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 134 [2025-01-10 00:57:05,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand