./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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_17-arrayloop_nr.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 b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:54:40,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:54:40,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:54:40,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:54:40,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:54:40,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:54:40,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:54:40,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:54:40,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:54:40,980 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:54:40,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:54:40,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:54:40,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:54:40,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:54:40,981 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:54:40,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:54:40,981 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:54:40,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:54:40,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:54:40,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:54:40,982 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:54:40,982 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:54:40,982 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:54:40,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:54:40,982 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:54:40,982 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:54:40,982 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:54:40,982 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:54:40,982 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:54:40,982 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:54:40,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:54:40,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:54:40,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:54:40,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:54:40,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:54:40,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:54:40,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:54:40,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:54:40,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:54:40,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:54:40,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:54:40,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:54:40,984 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 -> b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 [2025-02-06 12:54:41,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:54:41,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:54:41,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:54:41,301 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:54:41,301 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:54:41,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2025-02-06 12:54:42,594 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02423ffef/bafbf816df7e41be9b40cc2a0fcf405a/FLAGbc67afd2b [2025-02-06 12:54:42,928 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:54:42,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2025-02-06 12:54:42,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02423ffef/bafbf816df7e41be9b40cc2a0fcf405a/FLAGbc67afd2b [2025-02-06 12:54:42,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02423ffef/bafbf816df7e41be9b40cc2a0fcf405a [2025-02-06 12:54:42,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:54:42,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:54:42,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:54:42,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:54:42,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:54:42,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:54:42" (1/1) ... [2025-02-06 12:54:42,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b08c31d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:42, skipping insertion in model container [2025-02-06 12:54:42,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:54:42" (1/1) ... [2025-02-06 12:54:42,994 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:54:43,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:54:43,340 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:54:43,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:54:43,457 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:54:43,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:43 WrapperNode [2025-02-06 12:54:43,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:54:43,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:54:43,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:54:43,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:54:43,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:43" (1/1) ... [2025-02-06 12:54:43,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:43" (1/1) ... [2025-02-06 12:54:43,514 INFO L138 Inliner]: procedures = 370, calls = 86, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 171 [2025-02-06 12:54:43,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:54:43,515 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:54:43,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:54:43,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:54:43,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:43" (1/1) ... [2025-02-06 12:54:43,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:43" (1/1) ... [2025-02-06 12:54:43,527 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:43" (1/1) ... [2025-02-06 12:54:43,549 INFO L175 MemorySlicer]: Split 78 memory accesses to 3 slices as follows [50, 14, 14]. 64 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2025-02-06 12:54:43,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:43" (1/1) ... [2025-02-06 12:54:43,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:43" (1/1) ... [2025-02-06 12:54:43,565 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:43" (1/1) ... [2025-02-06 12:54:43,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:43" (1/1) ... [2025-02-06 12:54:43,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:43" (1/1) ... [2025-02-06 12:54:43,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:43" (1/1) ... [2025-02-06 12:54:43,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:54:43,581 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:54:43,581 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:54:43,581 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:54:43,582 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:43" (1/1) ... [2025-02-06 12:54:43,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:54:43,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:43,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:54:43,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:54:43,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:54:43,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:54:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 12:54:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 12:54:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 12:54:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 12:54:43,632 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:54:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:54:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:54:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:54:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:54:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:54:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:54:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:54:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:54:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:54:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 12:54:43,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 12:54:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 12:54:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 12:54:43,634 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 12:54:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:54:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:54:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:54:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:54:43,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:54:43,635 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:54:43,758 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:54:43,760 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:54:44,103 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:54:44,104 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:54:44,348 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:54:44,348 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:54:44,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:54:44 BoogieIcfgContainer [2025-02-06 12:54:44,349 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:54:44,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:54:44,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:54:44,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:54:44,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:54:42" (1/3) ... [2025-02-06 12:54:44,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51399e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:54:44, skipping insertion in model container [2025-02-06 12:54:44,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:54:43" (2/3) ... [2025-02-06 12:54:44,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51399e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:54:44, skipping insertion in model container [2025-02-06 12:54:44,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:54:44" (3/3) ... [2025-02-06 12:54:44,355 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_17-arrayloop_nr.i [2025-02-06 12:54:44,365 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:54:44,366 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_17-arrayloop_nr.i that has 2 procedures, 73 locations, 1 initial locations, 3 loop locations, and 37 error locations. [2025-02-06 12:54:44,366 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:54:44,425 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:54:44,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 75 transitions, 154 flow [2025-02-06 12:54:44,514 INFO L124 PetriNetUnfolderBase]: 3/74 cut-off events. [2025-02-06 12:54:44,515 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:54:44,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 74 events. 3/74 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 238 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2025-02-06 12:54:44,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 75 transitions, 154 flow [2025-02-06 12:54:44,524 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 74 transitions, 151 flow [2025-02-06 12:54:44,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:54:44,564 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;@1f14a10c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:54:44,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-02-06 12:54:44,575 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:54:44,576 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 12:54:44,576 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:54:44,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:44,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:54:44,577 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:44,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:44,582 INFO L85 PathProgramCache]: Analyzing trace with hash 489896, now seen corresponding path program 1 times [2025-02-06 12:54:44,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:44,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677489672] [2025-02-06 12:54:44,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:44,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:44,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:54:44,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:54:44,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:44,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:44,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:44,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677489672] [2025-02-06 12:54:44,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677489672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:44,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:44,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:54:44,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764587296] [2025-02-06 12:54:44,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:44,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:54:44,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:44,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:54:44,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:54:44,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 75 [2025-02-06 12:54:44,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:44,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:44,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 75 [2025-02-06 12:54:44,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:45,129 INFO L124 PetriNetUnfolderBase]: 142/528 cut-off events. [2025-02-06 12:54:45,129 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:54:45,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 528 events. 142/528 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3284 event pairs, 99 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 797. Up to 246 conditions per place. [2025-02-06 12:54:45,138 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 37 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2025-02-06 12:54:45,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 80 transitions, 245 flow [2025-02-06 12:54:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-02-06 12:54:45,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-02-06 12:54:45,154 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 151 flow. Second operand 3 states and 165 transitions. [2025-02-06 12:54:45,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 80 transitions, 245 flow [2025-02-06 12:54:45,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 80 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:45,163 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 150 flow [2025-02-06 12:54:45,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2025-02-06 12:54:45,169 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2025-02-06 12:54:45,169 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 150 flow [2025-02-06 12:54:45,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:45,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:45,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:54:45,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:54:45,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:45,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash 489897, now seen corresponding path program 1 times [2025-02-06 12:54:45,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:45,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875280214] [2025-02-06 12:54:45,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:45,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:45,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:54:45,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:54:45,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:45,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:45,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:45,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875280214] [2025-02-06 12:54:45,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875280214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:45,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:45,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:54:45,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905440961] [2025-02-06 12:54:45,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:45,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:54:45,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:45,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:54:45,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:54:45,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 75 [2025-02-06 12:54:45,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:45,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:45,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 75 [2025-02-06 12:54:45,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:45,471 INFO L124 PetriNetUnfolderBase]: 132/496 cut-off events. [2025-02-06 12:54:45,471 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-06 12:54:45,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 496 events. 132/496 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3048 event pairs, 99 based on Foata normal form. 22/393 useless extension candidates. Maximal degree in co-relation 767. Up to 246 conditions per place. [2025-02-06 12:54:45,474 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 35 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2025-02-06 12:54:45,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 76 transitions, 240 flow [2025-02-06 12:54:45,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-02-06 12:54:45,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7511111111111111 [2025-02-06 12:54:45,481 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 150 flow. Second operand 3 states and 169 transitions. [2025-02-06 12:54:45,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 76 transitions, 240 flow [2025-02-06 12:54:45,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:54:45,482 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 142 flow [2025-02-06 12:54:45,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2025-02-06 12:54:45,483 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2025-02-06 12:54:45,483 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 142 flow [2025-02-06 12:54:45,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:45,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:45,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:54:45,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:54:45,483 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:45,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:45,484 INFO L85 PathProgramCache]: Analyzing trace with hash 470804215, now seen corresponding path program 1 times [2025-02-06 12:54:45,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:45,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867785903] [2025-02-06 12:54:45,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:45,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:45,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:54:45,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:54:45,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:45,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:45,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:45,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867785903] [2025-02-06 12:54:45,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867785903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:45,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:45,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:54:45,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061585322] [2025-02-06 12:54:45,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:45,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:54:45,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:45,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:54:45,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:54:45,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-02-06 12:54:45,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:45,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:45,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-02-06 12:54:45,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:46,024 INFO L124 PetriNetUnfolderBase]: 189/617 cut-off events. [2025-02-06 12:54:46,026 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-06 12:54:46,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 617 events. 189/617 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3775 event pairs, 160 based on Foata normal form. 1/445 useless extension candidates. Maximal degree in co-relation 1000. Up to 383 conditions per place. [2025-02-06 12:54:46,033 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 35 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2025-02-06 12:54:46,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 230 flow [2025-02-06 12:54:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:54:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:54:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2025-02-06 12:54:46,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6066666666666667 [2025-02-06 12:54:46,038 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 142 flow. Second operand 4 states and 182 transitions. [2025-02-06 12:54:46,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 230 flow [2025-02-06 12:54:46,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:54:46,043 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 166 flow [2025-02-06 12:54:46,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2025-02-06 12:54:46,044 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -4 predicate places. [2025-02-06 12:54:46,044 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 166 flow [2025-02-06 12:54:46,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:46,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:46,045 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1] [2025-02-06 12:54:46,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:54:46,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:46,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:46,045 INFO L85 PathProgramCache]: Analyzing trace with hash 875706113, now seen corresponding path program 1 times [2025-02-06 12:54:46,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:46,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787172941] [2025-02-06 12:54:46,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:46,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:46,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:54:46,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:54:46,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:46,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:46,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:46,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787172941] [2025-02-06 12:54:46,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787172941] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:54:46,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794278593] [2025-02-06 12:54:46,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:46,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:46,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:46,390 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:54:46,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:54:46,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:54:46,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:54:46,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:46,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:46,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 12:54:46,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:46,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:54:46,558 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 14 treesize of output 9 [2025-02-06 12:54:46,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:54:46,657 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 14 treesize of output 9 [2025-02-06 12:54:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:46,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:54:46,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:54:46,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 61 [2025-02-06 12:54:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:46,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794278593] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:54:46,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:54:46,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-02-06 12:54:46,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265065622] [2025-02-06 12:54:46,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:54:46,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 12:54:46,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:46,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 12:54:46,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:54:48,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-02-06 12:54:48,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 166 flow. Second operand has 15 states, 15 states have (on average 35.4) internal successors, (531), 15 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:48,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:48,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-02-06 12:54:48,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:48,683 INFO L124 PetriNetUnfolderBase]: 213/645 cut-off events. [2025-02-06 12:54:48,683 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 12:54:48,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1126 conditions, 645 events. 213/645 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3791 event pairs, 0 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 1105. Up to 229 conditions per place. [2025-02-06 12:54:48,686 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 67 selfloop transitions, 11 changer transitions 0/107 dead transitions. [2025-02-06 12:54:48,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 107 transitions, 428 flow [2025-02-06 12:54:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:54:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:54:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 322 transitions. [2025-02-06 12:54:48,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2025-02-06 12:54:48,689 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 166 flow. Second operand 7 states and 322 transitions. [2025-02-06 12:54:48,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 107 transitions, 428 flow [2025-02-06 12:54:48,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 107 transitions, 426 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:48,692 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 240 flow [2025-02-06 12:54:48,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2025-02-06 12:54:48,693 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 4 predicate places. [2025-02-06 12:54:48,694 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 240 flow [2025-02-06 12:54:48,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 35.4) internal successors, (531), 15 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:48,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:48,694 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1] [2025-02-06 12:54:48,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:54:48,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:48,897 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:48,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:48,899 INFO L85 PathProgramCache]: Analyzing trace with hash -751209974, now seen corresponding path program 1 times [2025-02-06 12:54:48,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:48,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523155394] [2025-02-06 12:54:48,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:48,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:48,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:54:48,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:54:48,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:48,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:49,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 12:54:49,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:49,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523155394] [2025-02-06 12:54:49,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523155394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:49,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:49,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:54:49,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487119672] [2025-02-06 12:54:49,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:49,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:54:49,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:49,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:54:49,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:54:49,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 75 [2025-02-06 12:54:49,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:49,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:49,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 75 [2025-02-06 12:54:49,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:49,152 INFO L124 PetriNetUnfolderBase]: 174/600 cut-off events. [2025-02-06 12:54:49,152 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-02-06 12:54:49,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 600 events. 174/600 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3592 event pairs, 126 based on Foata normal form. 13/488 useless extension candidates. Maximal degree in co-relation 873. Up to 367 conditions per place. [2025-02-06 12:54:49,156 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 41 selfloop transitions, 1 changer transitions 0/71 dead transitions. [2025-02-06 12:54:49,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 71 transitions, 312 flow [2025-02-06 12:54:49,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-02-06 12:54:49,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2025-02-06 12:54:49,158 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 240 flow. Second operand 3 states and 153 transitions. [2025-02-06 12:54:49,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 71 transitions, 312 flow [2025-02-06 12:54:49,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 71 transitions, 304 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:49,160 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 222 flow [2025-02-06 12:54:49,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2025-02-06 12:54:49,160 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2025-02-06 12:54:49,160 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 222 flow [2025-02-06 12:54:49,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:49,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:49,162 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:49,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:54:49,162 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:49,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:49,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1809694353, now seen corresponding path program 1 times [2025-02-06 12:54:49,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:49,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900063896] [2025-02-06 12:54:49,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:49,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:49,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 12:54:49,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 12:54:49,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:49,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 12:54:49,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:49,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900063896] [2025-02-06 12:54:49,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900063896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:49,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:49,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:54:49,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025151675] [2025-02-06 12:54:49,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:49,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:54:49,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:49,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:54:49,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:54:49,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 75 [2025-02-06 12:54:49,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:49,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:49,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 75 [2025-02-06 12:54:49,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:49,381 INFO L124 PetriNetUnfolderBase]: 254/916 cut-off events. [2025-02-06 12:54:49,381 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-02-06 12:54:49,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1608 conditions, 916 events. 254/916 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5551 event pairs, 153 based on Foata normal form. 10/742 useless extension candidates. Maximal degree in co-relation 1594. Up to 300 conditions per place. [2025-02-06 12:54:49,385 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 53 selfloop transitions, 6 changer transitions 0/91 dead transitions. [2025-02-06 12:54:49,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 91 transitions, 386 flow [2025-02-06 12:54:49,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:49,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2025-02-06 12:54:49,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8488888888888889 [2025-02-06 12:54:49,386 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 222 flow. Second operand 3 states and 191 transitions. [2025-02-06 12:54:49,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 91 transitions, 386 flow [2025-02-06 12:54:49,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 91 transitions, 385 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:49,388 INFO L231 Difference]: Finished difference. Result has 78 places, 72 transitions, 248 flow [2025-02-06 12:54:49,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=78, PETRI_TRANSITIONS=72} [2025-02-06 12:54:49,389 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2025-02-06 12:54:49,389 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 72 transitions, 248 flow [2025-02-06 12:54:49,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:49,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:49,389 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:49,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:54:49,390 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:49,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:49,390 INFO L85 PathProgramCache]: Analyzing trace with hash 382510052, now seen corresponding path program 1 times [2025-02-06 12:54:49,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:49,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400796394] [2025-02-06 12:54:49,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:49,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:49,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:54:49,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:54:49,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:49,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 12:54:49,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:49,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400796394] [2025-02-06 12:54:49,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400796394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:54:49,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:54:49,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:54:49,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133868323] [2025-02-06 12:54:49,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:54:49,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:54:49,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:49,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:54:49,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:54:49,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 75 [2025-02-06 12:54:49,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 72 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:49,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:49,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 75 [2025-02-06 12:54:49,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:49,608 INFO L124 PetriNetUnfolderBase]: 279/939 cut-off events. [2025-02-06 12:54:49,608 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2025-02-06 12:54:49,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1773 conditions, 939 events. 279/939 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5565 event pairs, 176 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 1757. Up to 473 conditions per place. [2025-02-06 12:54:49,612 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 55 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2025-02-06 12:54:49,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 86 transitions, 423 flow [2025-02-06 12:54:49,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:54:49,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:54:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2025-02-06 12:54:49,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2025-02-06 12:54:49,613 INFO L175 Difference]: Start difference. First operand has 78 places, 72 transitions, 248 flow. Second operand 3 states and 174 transitions. [2025-02-06 12:54:49,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 86 transitions, 423 flow [2025-02-06 12:54:49,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 86 transitions, 413 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:54:49,615 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 242 flow [2025-02-06 12:54:49,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2025-02-06 12:54:49,616 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 2 predicate places. [2025-02-06 12:54:49,616 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 242 flow [2025-02-06 12:54:49,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:49,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:49,616 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:54:49,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:54:49,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:49,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:49,617 INFO L85 PathProgramCache]: Analyzing trace with hash 382510053, now seen corresponding path program 1 times [2025-02-06 12:54:49,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:49,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122787975] [2025-02-06 12:54:49,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:49,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:49,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:54:49,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:54:49,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:49,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:49,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:49,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122787975] [2025-02-06 12:54:49,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122787975] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:54:49,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270025788] [2025-02-06 12:54:49,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:54:49,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:49,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:49,678 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:54:49,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:54:49,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:54:49,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:54:49,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:54:49,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:49,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:54:49,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:49,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:54:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:49,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270025788] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:54:49,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:54:49,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-06 12:54:49,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294971944] [2025-02-06 12:54:49,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:54:49,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:54:49,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:49,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:54:49,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:54:49,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2025-02-06 12:54:49,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 242 flow. Second operand has 9 states, 9 states have (on average 47.666666666666664) internal successors, (429), 9 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:49,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:49,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2025-02-06 12:54:49,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:54:50,372 INFO L124 PetriNetUnfolderBase]: 702/2330 cut-off events. [2025-02-06 12:54:50,372 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-02-06 12:54:50,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4229 conditions, 2330 events. 702/2330 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 13325 event pairs, 88 based on Foata normal form. 50/1987 useless extension candidates. Maximal degree in co-relation 4213. Up to 234 conditions per place. [2025-02-06 12:54:50,381 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 146 selfloop transitions, 16 changer transitions 0/191 dead transitions. [2025-02-06 12:54:50,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 191 transitions, 889 flow [2025-02-06 12:54:50,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:54:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:54:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 531 transitions. [2025-02-06 12:54:50,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.885 [2025-02-06 12:54:50,383 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 242 flow. Second operand 8 states and 531 transitions. [2025-02-06 12:54:50,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 191 transitions, 889 flow [2025-02-06 12:54:50,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 191 transitions, 859 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:54:50,386 INFO L231 Difference]: Finished difference. Result has 88 places, 75 transitions, 346 flow [2025-02-06 12:54:50,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=346, PETRI_PLACES=88, PETRI_TRANSITIONS=75} [2025-02-06 12:54:50,386 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 13 predicate places. [2025-02-06 12:54:50,387 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 75 transitions, 346 flow [2025-02-06 12:54:50,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 47.666666666666664) internal successors, (429), 9 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:50,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:54:50,387 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 1, 1] [2025-02-06 12:54:50,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 12:54:50,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:50,591 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:54:50,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:54:50,592 INFO L85 PathProgramCache]: Analyzing trace with hash 251701535, now seen corresponding path program 2 times [2025-02-06 12:54:50,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:54:50,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741903823] [2025-02-06 12:54:50,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:54:50,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:54:50,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-06 12:54:50,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:54:50,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:54:50,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:51,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:54:51,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741903823] [2025-02-06 12:54:51,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741903823] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:54:51,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160687539] [2025-02-06 12:54:51,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:54:51,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:54:51,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:54:51,432 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:54:51,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:54:51,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-06 12:54:51,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:54:51,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:54:51,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:54:51,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 12:54:51,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:54:51,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:54:51,678 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 14 treesize of output 9 [2025-02-06 12:54:51,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:54:51,801 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 14 treesize of output 9 [2025-02-06 12:54:51,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:54:51,931 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 14 treesize of output 9 [2025-02-06 12:54:52,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:54:52,097 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 14 treesize of output 9 [2025-02-06 12:54:52,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:54:52,255 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 14 treesize of output 9 [2025-02-06 12:54:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:52,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:54:52,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:54:52,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 61 [2025-02-06 12:54:52,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:54:52,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 61 [2025-02-06 12:54:52,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:54:52,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 61 [2025-02-06 12:54:52,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:54:52,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 61 [2025-02-06 12:54:53,094 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:54:53,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160687539] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:54:53,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:54:53,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 32 [2025-02-06 12:54:53,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448552265] [2025-02-06 12:54:53,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:54:53,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 12:54:53,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:54:53,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 12:54:53,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 12:54:59,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-02-06 12:54:59,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 75 transitions, 346 flow. Second operand has 34 states, 34 states have (on average 35.411764705882355) internal successors, (1204), 34 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:54:59,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:54:59,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-02-06 12:54:59,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:55:00,756 INFO L124 PetriNetUnfolderBase]: 806/2506 cut-off events. [2025-02-06 12:55:00,757 INFO L125 PetriNetUnfolderBase]: For 796/796 co-relation queries the response was YES. [2025-02-06 12:55:00,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4950 conditions, 2506 events. 806/2506 cut-off events. For 796/796 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 14511 event pairs, 0 based on Foata normal form. 6/2127 useless extension candidates. Maximal degree in co-relation 4927. Up to 855 conditions per place. [2025-02-06 12:55:00,768 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 91 selfloop transitions, 28 changer transitions 0/147 dead transitions. [2025-02-06 12:55:00,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 147 transitions, 926 flow [2025-02-06 12:55:00,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 12:55:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 12:55:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 630 transitions. [2025-02-06 12:55:00,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.56 [2025-02-06 12:55:00,773 INFO L175 Difference]: Start difference. First operand has 88 places, 75 transitions, 346 flow. Second operand 15 states and 630 transitions. [2025-02-06 12:55:00,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 147 transitions, 926 flow [2025-02-06 12:55:00,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 147 transitions, 908 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-06 12:55:00,780 INFO L231 Difference]: Finished difference. Result has 110 places, 88 transitions, 547 flow [2025-02-06 12:55:00,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=547, PETRI_PLACES=110, PETRI_TRANSITIONS=88} [2025-02-06 12:55:00,782 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 35 predicate places. [2025-02-06 12:55:00,782 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 88 transitions, 547 flow [2025-02-06 12:55:00,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 35.411764705882355) internal successors, (1204), 34 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:55:00,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:55:00,784 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:55:00,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 12:55:00,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:55:00,985 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:55:00,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:55:00,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1057982275, now seen corresponding path program 2 times [2025-02-06 12:55:00,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:55:00,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896661995] [2025-02-06 12:55:00,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:55:00,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:55:01,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-06 12:55:01,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 32 statements. [2025-02-06 12:55:01,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:55:01,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:55:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-06 12:55:01,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:55:01,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896661995] [2025-02-06 12:55:01,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896661995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:55:01,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:55:01,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:55:01,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209571283] [2025-02-06 12:55:01,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:55:01,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:55:01,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:55:01,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:55:01,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:55:01,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 75 [2025-02-06 12:55:01,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 88 transitions, 547 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:55:01,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:55:01,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 75 [2025-02-06 12:55:01,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:55:01,365 INFO L124 PetriNetUnfolderBase]: 685/2347 cut-off events. [2025-02-06 12:55:01,365 INFO L125 PetriNetUnfolderBase]: For 1503/1503 co-relation queries the response was YES. [2025-02-06 12:55:01,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4766 conditions, 2347 events. 685/2347 cut-off events. For 1503/1503 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 13852 event pairs, 504 based on Foata normal form. 68/2058 useless extension candidates. Maximal degree in co-relation 4733. Up to 1260 conditions per place. [2025-02-06 12:55:01,376 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 77 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2025-02-06 12:55:01,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 108 transitions, 857 flow [2025-02-06 12:55:01,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:55:01,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:55:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2025-02-06 12:55:01,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7822222222222223 [2025-02-06 12:55:01,378 INFO L175 Difference]: Start difference. First operand has 110 places, 88 transitions, 547 flow. Second operand 3 states and 176 transitions. [2025-02-06 12:55:01,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 108 transitions, 857 flow [2025-02-06 12:55:01,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 108 transitions, 795 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-02-06 12:55:01,385 INFO L231 Difference]: Finished difference. Result has 105 places, 86 transitions, 492 flow [2025-02-06 12:55:01,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=105, PETRI_TRANSITIONS=86} [2025-02-06 12:55:01,386 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 30 predicate places. [2025-02-06 12:55:01,386 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 86 transitions, 492 flow [2025-02-06 12:55:01,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:55:01,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:55:01,386 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:55:01,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:55:01,386 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:55:01,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:55:01,387 INFO L85 PathProgramCache]: Analyzing trace with hash -76366143, now seen corresponding path program 1 times [2025-02-06 12:55:01,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:55:01,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539632673] [2025-02-06 12:55:01,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:55:01,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:55:01,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:55:01,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:55:01,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:55:01,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:55:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:55:01,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:55:01,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539632673] [2025-02-06 12:55:01,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539632673] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:55:01,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175556431] [2025-02-06 12:55:01,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:55:01,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:55:01,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:55:01,574 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:55:01,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:55:01,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 12:55:01,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 12:55:01,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:55:01,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:55:01,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 12:55:01,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:55:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:55:01,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:55:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:55:01,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175556431] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:55:01,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:55:01,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-02-06 12:55:01,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024760732] [2025-02-06 12:55:01,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:55:01,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:55:01,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:55:01,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:55:01,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:55:01,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2025-02-06 12:55:01,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 86 transitions, 492 flow. Second operand has 13 states, 13 states have (on average 48.15384615384615) internal successors, (626), 13 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:55:01,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:55:01,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2025-02-06 12:55:01,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:55:02,507 INFO L124 PetriNetUnfolderBase]: 1142/3757 cut-off events. [2025-02-06 12:55:02,507 INFO L125 PetriNetUnfolderBase]: For 2034/2034 co-relation queries the response was YES. [2025-02-06 12:55:02,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7427 conditions, 3757 events. 1142/3757 cut-off events. For 2034/2034 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 21455 event pairs, 27 based on Foata normal form. 44/3193 useless extension candidates. Maximal degree in co-relation 7394. Up to 235 conditions per place. [2025-02-06 12:55:02,527 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 234 selfloop transitions, 25 changer transitions 0/286 dead transitions. [2025-02-06 12:55:02,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 286 transitions, 1611 flow [2025-02-06 12:55:02,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:55:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 12:55:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 806 transitions. [2025-02-06 12:55:02,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8955555555555555 [2025-02-06 12:55:02,529 INFO L175 Difference]: Start difference. First operand has 105 places, 86 transitions, 492 flow. Second operand 12 states and 806 transitions. [2025-02-06 12:55:02,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 286 transitions, 1611 flow [2025-02-06 12:55:02,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 286 transitions, 1565 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:55:02,597 INFO L231 Difference]: Finished difference. Result has 119 places, 88 transitions, 606 flow [2025-02-06 12:55:02,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=606, PETRI_PLACES=119, PETRI_TRANSITIONS=88} [2025-02-06 12:55:02,598 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 44 predicate places. [2025-02-06 12:55:02,598 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 88 transitions, 606 flow [2025-02-06 12:55:02,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.15384615384615) internal successors, (626), 13 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:55:02,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:55:02,598 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 1, 1] [2025-02-06 12:55:02,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:55:02,799 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,SelfDestructingSolverStorable10 [2025-02-06 12:55:02,799 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:55:02,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:55:02,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1104172635, now seen corresponding path program 3 times [2025-02-06 12:55:02,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:55:02,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710586142] [2025-02-06 12:55:02,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:55:02,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:55:02,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-02-06 12:55:02,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 12:55:02,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 12:55:02,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:55:03,229 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 183 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:55:03,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:55:03,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710586142] [2025-02-06 12:55:03,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710586142] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:55:03,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525331999] [2025-02-06 12:55:03,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:55:03,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:55:03,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:55:03,235 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:55:03,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:55:03,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-02-06 12:55:39,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 12:55:39,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 12:55:39,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:55:39,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 12:55:39,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:55:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:55:39,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:55:39,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525331999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:55:39,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 12:55:39,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2025-02-06 12:55:39,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305024880] [2025-02-06 12:55:39,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:55:39,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:55:39,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:55:39,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:55:39,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:55:39,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 75 [2025-02-06 12:55:39,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 88 transitions, 606 flow. Second operand has 13 states, 13 states have (on average 47.53846153846154) internal successors, (618), 13 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:55:39,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:55:39,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 75 [2025-02-06 12:55:39,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:55:40,657 INFO L124 PetriNetUnfolderBase]: 1131/3760 cut-off events. [2025-02-06 12:55:40,658 INFO L125 PetriNetUnfolderBase]: For 2323/2323 co-relation queries the response was YES. [2025-02-06 12:55:40,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7405 conditions, 3760 events. 1131/3760 cut-off events. For 2323/2323 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 21753 event pairs, 80 based on Foata normal form. 11/3146 useless extension candidates. Maximal degree in co-relation 7366. Up to 228 conditions per place. [2025-02-06 12:55:40,670 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 242 selfloop transitions, 23 changer transitions 1/292 dead transitions. [2025-02-06 12:55:40,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 292 transitions, 1647 flow [2025-02-06 12:55:40,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:55:40,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 12:55:40,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 853 transitions. [2025-02-06 12:55:40,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8748717948717949 [2025-02-06 12:55:40,674 INFO L175 Difference]: Start difference. First operand has 119 places, 88 transitions, 606 flow. Second operand 13 states and 853 transitions. [2025-02-06 12:55:40,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 292 transitions, 1647 flow [2025-02-06 12:55:40,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 292 transitions, 1547 flow, removed 0 selfloop flow, removed 14 redundant places. [2025-02-06 12:55:40,688 INFO L231 Difference]: Finished difference. Result has 116 places, 84 transitions, 519 flow [2025-02-06 12:55:40,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=519, PETRI_PLACES=116, PETRI_TRANSITIONS=84} [2025-02-06 12:55:40,690 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 41 predicate places. [2025-02-06 12:55:40,691 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 84 transitions, 519 flow [2025-02-06 12:55:40,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 47.53846153846154) internal successors, (618), 13 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:55:40,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:55:40,691 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:55:40,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 12:55:40,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 12:55:40,892 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:55:40,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:55:40,893 INFO L85 PathProgramCache]: Analyzing trace with hash 596381081, now seen corresponding path program 2 times [2025-02-06 12:55:40,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:55:40,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785007121] [2025-02-06 12:55:40,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:55:40,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:55:40,939 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-02-06 12:55:40,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:55:40,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:55:40,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:55:41,686 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 144 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:55:41,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:55:41,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785007121] [2025-02-06 12:55:41,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785007121] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:55:41,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145056405] [2025-02-06 12:55:41,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:55:41,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:55:41,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:55:41,689 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:55:41,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:55:41,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-02-06 12:55:42,037 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:55:42,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:55:42,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:55:42,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 12:55:42,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:55:42,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:55:42,269 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 16 treesize of output 11 [2025-02-06 12:55:42,280 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:55:42,282 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 11 treesize of output 11 [2025-02-06 12:55:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:55:42,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:55:42,531 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 52 treesize of output 48 [2025-02-06 12:55:42,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:55:42,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 46 treesize of output 64 [2025-02-06 12:55:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:55:42,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145056405] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:55:42,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:55:42,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 29 [2025-02-06 12:55:42,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212727267] [2025-02-06 12:55:42,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:55:42,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 12:55:42,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:55:42,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 12:55:42,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2025-02-06 12:55:44,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-02-06 12:55:44,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 84 transitions, 519 flow. Second operand has 31 states, 31 states have (on average 36.67741935483871) internal successors, (1137), 31 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:55:44,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:55:44,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-02-06 12:55:44,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:55:46,213 INFO L124 PetriNetUnfolderBase]: 1211/3867 cut-off events. [2025-02-06 12:55:46,214 INFO L125 PetriNetUnfolderBase]: For 1641/1641 co-relation queries the response was YES. [2025-02-06 12:55:46,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7400 conditions, 3867 events. 1211/3867 cut-off events. For 1641/1641 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 22252 event pairs, 126 based on Foata normal form. 20/3245 useless extension candidates. Maximal degree in co-relation 7369. Up to 294 conditions per place. [2025-02-06 12:55:46,232 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 303 selfloop transitions, 50 changer transitions 1/380 dead transitions. [2025-02-06 12:55:46,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 380 transitions, 1917 flow [2025-02-06 12:55:46,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 12:55:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 12:55:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1104 transitions. [2025-02-06 12:55:46,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6690909090909091 [2025-02-06 12:55:46,236 INFO L175 Difference]: Start difference. First operand has 116 places, 84 transitions, 519 flow. Second operand 22 states and 1104 transitions. [2025-02-06 12:55:46,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 380 transitions, 1917 flow [2025-02-06 12:55:46,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 380 transitions, 1871 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-02-06 12:55:46,245 INFO L231 Difference]: Finished difference. Result has 127 places, 106 transitions, 697 flow [2025-02-06 12:55:46,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=697, PETRI_PLACES=127, PETRI_TRANSITIONS=106} [2025-02-06 12:55:46,247 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 52 predicate places. [2025-02-06 12:55:46,247 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 106 transitions, 697 flow [2025-02-06 12:55:46,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 36.67741935483871) internal successors, (1137), 31 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:55:46,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:55:46,248 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:55:46,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 12:55:46,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 12:55:46,452 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:55:46,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:55:46,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1859043861, now seen corresponding path program 1 times [2025-02-06 12:55:46,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:55:46,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355329551] [2025-02-06 12:55:46,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:55:46,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:55:46,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:55:46,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:55:46,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:55:46,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:55:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 144 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:55:46,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:55:46,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355329551] [2025-02-06 12:55:46,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355329551] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:55:46,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994881140] [2025-02-06 12:55:46,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:55:46,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:55:46,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:55:46,923 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:55:46,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:55:47,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:55:47,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:55:47,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:55:47,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:55:47,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 12:55:47,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:55:47,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:55:47,288 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 16 treesize of output 11 [2025-02-06 12:55:47,295 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:55:47,295 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 11 treesize of output 11 [2025-02-06 12:55:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:55:47,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:55:47,423 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 52 treesize of output 48 [2025-02-06 12:55:47,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:55:47,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 46 treesize of output 64 [2025-02-06 12:55:47,652 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 180 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:55:47,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994881140] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:55:47,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:55:47,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 27 [2025-02-06 12:55:47,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904921210] [2025-02-06 12:55:47,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:55:47,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 12:55:47,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:55:47,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 12:55:47,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=567, Unknown=0, NotChecked=0, Total=812 [2025-02-06 12:55:48,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 75 [2025-02-06 12:55:48,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 106 transitions, 697 flow. Second operand has 29 states, 29 states have (on average 40.758620689655174) internal successors, (1182), 29 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:55:48,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:55:48,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 75 [2025-02-06 12:55:48,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:55:51,773 INFO L124 PetriNetUnfolderBase]: 2713/8815 cut-off events. [2025-02-06 12:55:51,773 INFO L125 PetriNetUnfolderBase]: For 4715/4723 co-relation queries the response was YES. [2025-02-06 12:55:51,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17578 conditions, 8815 events. 2713/8815 cut-off events. For 4715/4723 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 65788 event pairs, 181 based on Foata normal form. 114/7375 useless extension candidates. Maximal degree in co-relation 17545. Up to 342 conditions per place. [2025-02-06 12:55:51,810 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 627 selfloop transitions, 120 changer transitions 2/782 dead transitions. [2025-02-06 12:55:51,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 782 transitions, 4261 flow [2025-02-06 12:55:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-06 12:55:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-02-06 12:55:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 2530 transitions. [2025-02-06 12:55:51,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-02-06 12:55:51,814 INFO L175 Difference]: Start difference. First operand has 127 places, 106 transitions, 697 flow. Second operand 46 states and 2530 transitions. [2025-02-06 12:55:51,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 782 transitions, 4261 flow [2025-02-06 12:55:51,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 782 transitions, 3995 flow, removed 20 selfloop flow, removed 15 redundant places. [2025-02-06 12:55:51,831 INFO L231 Difference]: Finished difference. Result has 201 places, 203 transitions, 1572 flow [2025-02-06 12:55:51,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=1572, PETRI_PLACES=201, PETRI_TRANSITIONS=203} [2025-02-06 12:55:51,832 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 126 predicate places. [2025-02-06 12:55:51,832 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 203 transitions, 1572 flow [2025-02-06 12:55:51,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 40.758620689655174) internal successors, (1182), 29 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:55:51,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:55:51,832 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:55:51,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 12:55:52,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:55:52,033 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-02-06 12:55:52,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:55:52,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1307944786, now seen corresponding path program 1 times [2025-02-06 12:55:52,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:55:52,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059538762] [2025-02-06 12:55:52,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:55:52,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:55:52,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 12:55:52,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 12:55:52,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:55:52,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:55:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 108 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:55:54,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:55:54,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059538762] [2025-02-06 12:55:54,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059538762] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:55:54,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287263804] [2025-02-06 12:55:54,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:55:54,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:55:54,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:55:54,803 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:55:54,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:55:54,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 12:55:55,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 12:55:55,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:55:55,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:55:55,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-02-06 12:55:55,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:55:55,107 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-02-06 12:55:55,120 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 1 [2025-02-06 12:55:55,138 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-02-06 12:55:55,138 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 23 treesize of output 24 [2025-02-06 12:55:55,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:55:55,162 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 29 treesize of output 13 [2025-02-06 12:55:55,184 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-02-06 12:55:55,184 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 16 treesize of output 18 [2025-02-06 12:55:55,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:55:55,211 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 29 treesize of output 13 [2025-02-06 12:55:55,226 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-02-06 12:55:55,226 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 16 treesize of output 18 [2025-02-06 12:55:55,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:55:55,247 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 29 treesize of output 13 [2025-02-06 12:55:55,258 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-02-06 12:55:55,259 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 16 treesize of output 18 [2025-02-06 12:55:55,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:55:55,282 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 29 treesize of output 13 [2025-02-06 12:55:55,296 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2025-02-06 12:55:55,297 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 21 treesize of output 29 [2025-02-06 12:55:55,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:55:55,344 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 37 treesize of output 17 [2025-02-06 12:55:55,384 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-02-06 12:55:55,384 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 21 treesize of output 26 [2025-02-06 12:55:55,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:55:55,430 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 37 treesize of output 17 [2025-02-06 12:55:55,472 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-02-06 12:55:55,472 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 21 treesize of output 26 [2025-02-06 12:55:55,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:55:55,517 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 37 treesize of output 17 [2025-02-06 12:55:55,586 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-02-06 12:55:55,586 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 21 treesize of output 26 [2025-02-06 12:55:55,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:55:55,631 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 37 treesize of output 17 [2025-02-06 12:55:55,675 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-02-06 12:55:55,676 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 21 treesize of output 26 [2025-02-06 12:55:55,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:55:55,722 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 37 treesize of output 17 [2025-02-06 12:55:55,812 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-02-06 12:55:55,812 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 21 treesize of output 26 [2025-02-06 12:55:55,856 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 25 treesize of output 13 [2025-02-06 12:55:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 144 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:55:55,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:55:59,943 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_2915) |c_~#slot~0.offset|)) 1)) is different from false [2025-02-06 12:56:15,949 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_230| Int) (v_ArrVal_2915 Int) (|v_ULTIMATE.start_new_~p~0#1.base_118| Int) (|v_ULTIMATE.start_new_~p~0#1.base_117| Int) (v_ArrVal_2909 Int) (|v_ULTIMATE.start_main_~j~0#1_229| Int) (v_ArrVal_2912 Int)) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_new_~p~0#1.base_118| 1) |v_ULTIMATE.start_new_~p~0#1.base_117| 1) (select (store (store (store (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_2909) (+ (* |v_ULTIMATE.start_main_~j~0#1_230| 4) |c_~#slot~0.offset|) v_ArrVal_2912) (+ (* |v_ULTIMATE.start_main_~j~0#1_229| 4) |c_~#slot~0.offset|) v_ArrVal_2915) |c_~#slot~0.offset|)) 1) (< |v_ULTIMATE.start_main_~j~0#1_230| (+ |c_ULTIMATE.start_main_~j~0#1| 1)) (< |v_ULTIMATE.start_main_~j~0#1_229| (+ |v_ULTIMATE.start_main_~j~0#1_230| 1)))) is different from false