./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:34:45,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:34:45,341 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:34:45,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:34:45,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:34:45,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:34:45,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:34:45,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:34:45,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:34:45,376 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:34:45,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:34:45,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:34:45,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:34:45,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:34:45,377 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:34:45,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:34:45,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:34:45,378 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:34:45,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:34:45,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:34:45,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:34:45,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:34:45,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:34:45,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:34:45,379 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:34:45,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:34:45,379 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:34:45,379 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:34:45,379 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:34:45,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:34:45,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:34:45,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:34:45,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:34:45,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:34:45,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:34:45,380 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:34:45,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:34:45,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:34:45,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:34:45,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:34:45,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:34:45,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:34:45,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:34:45,381 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2025-02-05 14:34:45,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:34:45,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:34:45,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:34:45,699 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:34:45,699 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:34:45,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-sorted-2.i [2025-02-05 14:34:47,005 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f724b3b85/8b56dce4e79543f7898faff2536c8130/FLAGfb1b18ffc [2025-02-05 14:34:47,365 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:34:47,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2025-02-05 14:34:47,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f724b3b85/8b56dce4e79543f7898faff2536c8130/FLAGfb1b18ffc [2025-02-05 14:34:47,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f724b3b85/8b56dce4e79543f7898faff2536c8130 [2025-02-05 14:34:47,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:34:47,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:34:47,409 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:34:47,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:34:47,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:34:47,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:34:47" (1/1) ... [2025-02-05 14:34:47,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bc74ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:47, skipping insertion in model container [2025-02-05 14:34:47,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:34:47" (1/1) ... [2025-02-05 14:34:47,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:34:47,693 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2025-02-05 14:34:47,699 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2025-02-05 14:34:47,704 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2025-02-05 14:34:47,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2025-02-05 14:34:47,709 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2025-02-05 14:34:47,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2025-02-05 14:34:47,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:34:47,723 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:34:47,776 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2025-02-05 14:34:47,783 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2025-02-05 14:34:47,786 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2025-02-05 14:34:47,786 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2025-02-05 14:34:47,787 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2025-02-05 14:34:47,788 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2025-02-05 14:34:47,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:34:47,808 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:34:47,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:47 WrapperNode [2025-02-05 14:34:47,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:34:47,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:34:47,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:34:47,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:34:47,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:47" (1/1) ... [2025-02-05 14:34:47,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:47" (1/1) ... [2025-02-05 14:34:47,845 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 180 [2025-02-05 14:34:47,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:34:47,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:34:47,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:34:47,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:34:47,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:47" (1/1) ... [2025-02-05 14:34:47,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:47" (1/1) ... [2025-02-05 14:34:47,857 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:47" (1/1) ... [2025-02-05 14:34:47,881 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2025-02-05 14:34:47,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:47" (1/1) ... [2025-02-05 14:34:47,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:47" (1/1) ... [2025-02-05 14:34:47,894 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:47" (1/1) ... [2025-02-05 14:34:47,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:47" (1/1) ... [2025-02-05 14:34:47,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:47" (1/1) ... [2025-02-05 14:34:47,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:47" (1/1) ... [2025-02-05 14:34:47,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:34:47,907 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:34:47,908 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:34:47,908 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:34:47,908 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:47" (1/1) ... [2025-02-05 14:34:47,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:34:47,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:34:47,936 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-05 14:34:47,938 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-05 14:34:47,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:34:47,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:34:47,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:34:47,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:34:47,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:34:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:34:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:34:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:34:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:34:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:34:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:34:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:34:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:34:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:34:47,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:34:48,059 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:34:48,061 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:34:48,310 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-02-05 14:34:48,313 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:34:48,321 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:34:48,321 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:34:48,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:34:48 BoogieIcfgContainer [2025-02-05 14:34:48,322 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:34:48,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:34:48,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:34:48,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:34:48,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:34:47" (1/3) ... [2025-02-05 14:34:48,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226a6a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:34:48, skipping insertion in model container [2025-02-05 14:34:48,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:47" (2/3) ... [2025-02-05 14:34:48,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226a6a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:34:48, skipping insertion in model container [2025-02-05 14:34:48,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:34:48" (3/3) ... [2025-02-05 14:34:48,329 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2025-02-05 14:34:48,342 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:34:48,344 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-sorted-2.i that has 1 procedures, 57 locations, 1 initial locations, 12 loop locations, and 6 error locations. [2025-02-05 14:34:48,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:34:48,399 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@29af8b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:34:48,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-05 14:34:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 50 states have (on average 1.8) internal successors, (90), 56 states have internal predecessors, (90), 0 states have call successors, (0), 0 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-05 14:34:48,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-05 14:34:48,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:48,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:48,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:34:48,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:48,410 INFO L85 PathProgramCache]: Analyzing trace with hash 475101756, now seen corresponding path program 1 times [2025-02-05 14:34:48,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:48,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198419118] [2025-02-05 14:34:48,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:48,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:48,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-05 14:34:48,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-05 14:34:48,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:48,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:48,578 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-05 14:34:48,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:34:48,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198419118] [2025-02-05 14:34:48,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198419118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:34:48,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:34:48,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 14:34:48,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105733590] [2025-02-05 14:34:48,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:34:48,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 14:34:48,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:34:48,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 14:34:48,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 14:34:48,608 INFO L87 Difference]: Start difference. First operand has 57 states, 50 states have (on average 1.8) internal successors, (90), 56 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 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-05 14:34:48,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:34:48,631 INFO L93 Difference]: Finished difference Result 108 states and 170 transitions. [2025-02-05 14:34:48,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 14:34:48,633 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-05 14:34:48,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:34:48,639 INFO L225 Difference]: With dead ends: 108 [2025-02-05 14:34:48,639 INFO L226 Difference]: Without dead ends: 53 [2025-02-05 14:34:48,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 14:34:48,644 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:34:48,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:34:48,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-05 14:34:48,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-05 14:34:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-05 14:34:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-02-05 14:34:48,679 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 7 [2025-02-05 14:34:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:34:48,680 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-02-05 14:34:48,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 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-05 14:34:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2025-02-05 14:34:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 14:34:48,681 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:48,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:48,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:34:48,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:34:48,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:48,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1821149659, now seen corresponding path program 1 times [2025-02-05 14:34:48,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:48,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626046372] [2025-02-05 14:34:48,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:48,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:48,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 14:34:48,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 14:34:48,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:48,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:48,792 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-05 14:34:48,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:34:48,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626046372] [2025-02-05 14:34:48,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626046372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:34:48,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:34:48,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:34:48,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523519172] [2025-02-05 14:34:48,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:34:48,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:34:48,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:34:48,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:34:48,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:34:48,797 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 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-05 14:34:48,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:34:48,845 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2025-02-05 14:34:48,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:34:48,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 14:34:48,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:34:48,846 INFO L225 Difference]: With dead ends: 112 [2025-02-05 14:34:48,846 INFO L226 Difference]: Without dead ends: 61 [2025-02-05 14:34:48,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:34:48,847 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 8 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:34:48,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 117 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:34:48,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-05 14:34:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2025-02-05 14:34:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 56 states have internal predecessors, (68), 0 states have call successors, (0), 0 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-05 14:34:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2025-02-05 14:34:48,855 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 8 [2025-02-05 14:34:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:34:48,855 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2025-02-05 14:34:48,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 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-05 14:34:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2025-02-05 14:34:48,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 14:34:48,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:48,855 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:48,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:34:48,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:34:48,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:48,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1590217496, now seen corresponding path program 1 times [2025-02-05 14:34:48,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:48,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335518289] [2025-02-05 14:34:48,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:48,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:48,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 14:34:48,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 14:34:48,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:48,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 14:34:49,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:34:49,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335518289] [2025-02-05 14:34:49,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335518289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:34:49,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:34:49,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:34:49,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972549273] [2025-02-05 14:34:49,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:34:49,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:34:49,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:34:49,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:34:49,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:34:49,091 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-05 14:34:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:34:49,226 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2025-02-05 14:34:49,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:34:49,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-05 14:34:49,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:34:49,231 INFO L225 Difference]: With dead ends: 91 [2025-02-05 14:34:49,231 INFO L226 Difference]: Without dead ends: 89 [2025-02-05 14:34:49,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:34:49,232 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 139 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:34:49,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 70 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:34:49,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-05 14:34:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 55. [2025-02-05 14:34:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.32) internal successors, (66), 54 states have internal predecessors, (66), 0 states have call successors, (0), 0 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-05 14:34:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-02-05 14:34:49,240 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 12 [2025-02-05 14:34:49,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:34:49,240 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-02-05 14:34:49,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-05 14:34:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-02-05 14:34:49,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 14:34:49,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:49,241 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:49,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:34:49,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:34:49,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:49,242 INFO L85 PathProgramCache]: Analyzing trace with hash 906086473, now seen corresponding path program 1 times [2025-02-05 14:34:49,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:49,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648024153] [2025-02-05 14:34:49,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:49,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:49,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 14:34:49,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 14:34:49,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:49,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:50,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:34:50,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648024153] [2025-02-05 14:34:50,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648024153] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:34:50,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13057389] [2025-02-05 14:34:50,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:50,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:34:50,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:34:50,236 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-05 14:34:50,237 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-05 14:34:50,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 14:34:50,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 14:34:50,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:50,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:50,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-05 14:34:50,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:34:50,403 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-05 14:34:50,457 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:34:50,462 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-02-05 14:34:50,483 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:34:50,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2025-02-05 14:34:50,492 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 5 treesize of output 3 [2025-02-05 14:34:50,516 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-02-05 14:34:50,536 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:34:50,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-05 14:34:50,549 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 5 treesize of output 3 [2025-02-05 14:34:50,568 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-05 14:34:50,569 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-05 14:34:50,624 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-05 14:34:50,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2025-02-05 14:34:50,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 14:34:50,640 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 24 treesize of output 11 [2025-02-05 14:34:50,894 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 27 treesize of output 15 [2025-02-05 14:34:50,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-02-05 14:34:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:50,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:34:51,009 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 69 treesize of output 49 [2025-02-05 14:34:51,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:51,103 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 148 [2025-02-05 14:34:51,145 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-02-05 14:34:51,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 232 treesize of output 227 [2025-02-05 14:34:51,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:51,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 246 treesize of output 232 [2025-02-05 14:34:51,213 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 177 treesize of output 171 [2025-02-05 14:34:51,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:51,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 547 treesize of output 509 [2025-02-05 14:34:51,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:51,353 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 252 treesize of output 263 [2025-02-05 14:34:51,373 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 238 treesize of output 230 [2025-02-05 14:34:51,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-05 14:34:51,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:51,886 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 29 treesize of output 29 [2025-02-05 14:34:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:51,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13057389] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:34:51,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:34:51,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2025-02-05 14:34:51,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746872765] [2025-02-05 14:34:51,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:34:51,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 14:34:51,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:34:51,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 14:34:51,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=196, Unknown=5, NotChecked=0, Total=240 [2025-02-05 14:34:51,954 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-05 14:34:52,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:34:52,559 INFO L93 Difference]: Finished difference Result 101 states and 128 transitions. [2025-02-05 14:34:52,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 14:34:52,559 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-05 14:34:52,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:34:52,560 INFO L225 Difference]: With dead ends: 101 [2025-02-05 14:34:52,560 INFO L226 Difference]: Without dead ends: 99 [2025-02-05 14:34:52,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=336, Unknown=5, NotChecked=0, Total=420 [2025-02-05 14:34:52,561 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 127 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 14:34:52,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 497 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 14:34:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-05 14:34:52,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 74. [2025-02-05 14:34:52,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 73 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-05 14:34:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2025-02-05 14:34:52,577 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 22 [2025-02-05 14:34:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:34:52,577 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2025-02-05 14:34:52,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-05 14:34:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2025-02-05 14:34:52,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 14:34:52,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:52,579 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:52,588 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-05 14:34:52,780 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-05 14:34:52,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:34:52,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash 793270958, now seen corresponding path program 1 times [2025-02-05 14:34:52,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:52,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155967070] [2025-02-05 14:34:52,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:52,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:52,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 14:34:52,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 14:34:52,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:52,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:53,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:34:53,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155967070] [2025-02-05 14:34:53,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155967070] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:34:53,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743855520] [2025-02-05 14:34:53,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:53,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:34:53,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:34:53,379 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-05 14:34:53,382 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-05 14:34:53,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 14:34:53,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 14:34:53,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:53,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:53,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-05 14:34:53,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:34:53,496 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-05 14:34:53,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:34:53,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:34:53,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2025-02-05 14:34:53,549 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-02-05 14:34:53,561 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:34:53,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-05 14:34:53,573 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 5 treesize of output 3 [2025-02-05 14:34:53,577 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-02-05 14:34:53,593 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:34:53,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2025-02-05 14:34:53,604 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 5 treesize of output 3 [2025-02-05 14:34:53,620 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-05 14:34:53,620 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-05 14:34:53,675 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-05 14:34:53,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 53 [2025-02-05 14:34:53,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 14:34:53,687 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 24 treesize of output 11 [2025-02-05 14:34:53,830 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 7 treesize of output 3 [2025-02-05 14:34:53,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 11 treesize of output 3 [2025-02-05 14:34:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:53,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:34:53,918 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 46 treesize of output 26 [2025-02-05 14:34:53,925 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_263 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.offset|))) is different from false [2025-02-05 14:34:53,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:53,946 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 148 [2025-02-05 14:34:53,987 INFO L349 Elim1Store]: treesize reduction 15, result has 70.0 percent of original size [2025-02-05 14:34:53,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 143 [2025-02-05 14:34:54,028 INFO L349 Elim1Store]: treesize reduction 54, result has 30.8 percent of original size [2025-02-05 14:34:54,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 237 treesize of output 206 [2025-02-05 14:34:54,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:54,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 552 treesize of output 514 [2025-02-05 14:34:54,083 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 233 treesize of output 225 [2025-02-05 14:34:54,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:54,113 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 225 treesize of output 236 [2025-02-05 14:34:54,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:54,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 275 treesize of output 273 [2025-02-05 14:34:54,160 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 209 treesize of output 205 [2025-02-05 14:34:54,230 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 8 treesize of output 6 [2025-02-05 14:34:55,203 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 8 treesize of output 6 [2025-02-05 14:34:55,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:55,229 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 53 treesize of output 57 [2025-02-05 14:34:55,281 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 22 treesize of output 18 [2025-02-05 14:34:55,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:55,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743855520] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:34:55,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:34:55,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2025-02-05 14:34:55,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464259418] [2025-02-05 14:34:55,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:34:55,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 14:34:55,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:34:55,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 14:34:55,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=233, Unknown=1, NotChecked=30, Total=306 [2025-02-05 14:34:55,333 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-05 14:34:55,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:34:55,975 INFO L93 Difference]: Finished difference Result 133 states and 163 transitions. [2025-02-05 14:34:55,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 14:34:55,976 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 14:34:55,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:34:55,977 INFO L225 Difference]: With dead ends: 133 [2025-02-05 14:34:55,977 INFO L226 Difference]: Without dead ends: 93 [2025-02-05 14:34:55,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=494, Unknown=1, NotChecked=46, Total=650 [2025-02-05 14:34:55,978 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 108 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 14:34:55,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 540 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 303 Invalid, 0 Unknown, 76 Unchecked, 0.4s Time] [2025-02-05 14:34:55,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-05 14:34:55,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2025-02-05 14:34:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 74 states have internal predecessors, (92), 0 states have call successors, (0), 0 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-05 14:34:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2025-02-05 14:34:55,987 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 25 [2025-02-05 14:34:55,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:34:55,988 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2025-02-05 14:34:55,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-05 14:34:55,988 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2025-02-05 14:34:55,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 14:34:55,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:55,989 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:55,997 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-05 14:34:56,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:34:56,190 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:34:56,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:56,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1367303482, now seen corresponding path program 2 times [2025-02-05 14:34:56,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:56,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815356948] [2025-02-05 14:34:56,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:34:56,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:56,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-05 14:34:56,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:34:56,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:34:56,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:57,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:34:57,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815356948] [2025-02-05 14:34:57,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815356948] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:34:57,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820146353] [2025-02-05 14:34:57,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:34:57,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:34:57,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:34:57,204 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-05 14:34:57,207 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-05 14:34:57,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-05 14:34:57,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:34:57,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:34:57,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:57,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-02-05 14:34:57,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:34:57,342 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-05 14:34:57,374 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:34:57,375 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 17 treesize of output 21 [2025-02-05 14:34:57,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-02-05 14:34:57,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:34:57,407 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 16 treesize of output 11 [2025-02-05 14:34:57,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-02-05 14:34:57,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:34:57,419 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 23 treesize of output 16 [2025-02-05 14:34:57,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2025-02-05 14:34:57,441 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2025-02-05 14:34:57,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 104 [2025-02-05 14:34:57,447 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:34:57,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:34:57,482 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 16 treesize of output 11 [2025-02-05 14:34:57,495 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 16 treesize of output 11 [2025-02-05 14:34:57,573 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-05 14:34:57,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 75 [2025-02-05 14:34:57,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:34:57,590 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-02-05 14:34:57,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 86 [2025-02-05 14:34:57,604 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-05 14:34:57,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2025-02-05 14:34:57,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-02-05 14:34:57,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-05 14:34:57,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2025-02-05 14:34:57,635 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-02-05 14:34:57,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 54 [2025-02-05 14:34:57,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:34:57,650 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-02-05 14:34:57,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 92 [2025-02-05 14:34:57,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:34:57,661 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-02-05 14:34:57,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 69 [2025-02-05 14:34:57,717 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-02-05 14:34:57,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 77 [2025-02-05 14:34:57,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-05 14:34:57,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-05 14:34:57,917 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-05 14:34:57,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2025-02-05 14:34:57,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-02-05 14:34:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:57,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:34:58,000 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_423 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_423) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_424) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 1)) is different from false [2025-02-05 14:34:58,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:58,090 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 146 [2025-02-05 14:34:58,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:58,099 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 110 [2025-02-05 14:34:58,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:58,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 639 treesize of output 638 [2025-02-05 14:34:58,139 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 539 treesize of output 457 [2025-02-05 14:34:58,146 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 248 treesize of output 207 [2025-02-05 14:34:58,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:58,408 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1018 treesize of output 739 [2025-02-05 14:34:58,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:58,419 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 974 treesize of output 807 [2025-02-05 14:34:58,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:58,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 213944 treesize of output 191304 [2025-02-05 14:34:59,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:59,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15446 treesize of output 13421 [2025-02-05 14:34:59,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:59,484 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 4562 treesize of output 4035 [2025-02-05 14:34:59,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:59,546 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 4611 treesize of output 4295 [2025-02-05 14:34:59,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:59,669 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 3742 treesize of output 3392 [2025-02-05 14:34:59,750 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 3168 treesize of output 3120 [2025-02-05 14:34:59,825 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 3120 treesize of output 3112 [2025-02-05 14:34:59,886 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 3112 treesize of output 3092 [2025-02-05 14:34:59,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:34:59,984 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 3301 treesize of output 3193 [2025-02-05 14:35:00,081 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 3024 treesize of output 2968 [2025-02-05 14:35:00,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:00,183 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 3833 treesize of output 3561 [2025-02-05 14:35:00,323 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 2768 treesize of output 2704 [2025-02-05 14:35:08,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2025-02-05 14:35:08,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2025-02-05 14:35:08,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-05 14:35:08,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-05 14:35:08,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2025-02-05 14:35:08,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2025-02-05 14:35:08,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 5 [2025-02-05 14:35:08,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2025-02-05 14:35:08,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2025-02-05 14:35:08,242 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 6 treesize of output 4 [2025-02-05 14:35:08,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-05 14:35:08,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:08,317 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 1070 treesize of output 850 [2025-02-05 14:35:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-05 14:35:12,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820146353] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:35:12,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:35:12,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2025-02-05 14:35:12,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801978861] [2025-02-05 14:35:12,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:35:12,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 14:35:12,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:35:12,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 14:35:12,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=351, Unknown=3, NotChecked=38, Total=462 [2025-02-05 14:35:12,293 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-05 14:35:13,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:35:13,967 INFO L93 Difference]: Finished difference Result 143 states and 183 transitions. [2025-02-05 14:35:13,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 14:35:13,967 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 14:35:13,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:35:13,968 INFO L225 Difference]: With dead ends: 143 [2025-02-05 14:35:13,968 INFO L226 Difference]: Without dead ends: 141 [2025-02-05 14:35:13,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=177, Invalid=942, Unknown=7, NotChecked=64, Total=1190 [2025-02-05 14:35:13,969 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 165 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 26 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:35:13,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 889 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 695 Invalid, 8 Unknown, 137 Unchecked, 1.3s Time] [2025-02-05 14:35:13,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-02-05 14:35:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 87. [2025-02-05 14:35:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.329268292682927) internal successors, (109), 86 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-05 14:35:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2025-02-05 14:35:13,980 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 26 [2025-02-05 14:35:13,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:35:13,980 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2025-02-05 14:35:13,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-05 14:35:13,980 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2025-02-05 14:35:13,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 14:35:13,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:35:13,981 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:35:13,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 14:35:14,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:14,182 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:35:14,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:35:14,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1155952569, now seen corresponding path program 1 times [2025-02-05 14:35:14,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:35:14,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68596903] [2025-02-05 14:35:14,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:35:14,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:35:14,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:35:14,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:35:14,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:35:14,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:35:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 14:35:14,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:35:14,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68596903] [2025-02-05 14:35:14,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68596903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:35:14,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:35:14,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:35:14,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177246470] [2025-02-05 14:35:14,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:35:14,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:35:14,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:35:14,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:35:14,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:35:14,234 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 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-05 14:35:14,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:35:14,261 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2025-02-05 14:35:14,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:35:14,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 14:35:14,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:35:14,262 INFO L225 Difference]: With dead ends: 142 [2025-02-05 14:35:14,263 INFO L226 Difference]: Without dead ends: 88 [2025-02-05 14:35:14,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:35:14,264 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:35:14,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 110 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:35:14,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-05 14:35:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2025-02-05 14:35:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 86 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-05 14:35:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2025-02-05 14:35:14,271 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 26 [2025-02-05 14:35:14,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:35:14,272 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2025-02-05 14:35:14,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 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-05 14:35:14,272 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2025-02-05 14:35:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 14:35:14,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:35:14,273 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:35:14,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 14:35:14,273 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:35:14,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:35:14,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1100958438, now seen corresponding path program 1 times [2025-02-05 14:35:14,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:35:14,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165680854] [2025-02-05 14:35:14,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:35:14,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:35:14,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:35:14,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:35:14,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:35:14,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:35:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:35:15,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:35:15,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165680854] [2025-02-05 14:35:15,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165680854] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:35:15,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757931163] [2025-02-05 14:35:15,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:35:15,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:35:15,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:35:15,170 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-05 14:35:15,171 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-05 14:35:15,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:35:15,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:35:15,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:35:15,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:35:15,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-02-05 14:35:15,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:35:15,317 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-05 14:35:15,335 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-02-05 14:35:15,346 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-05 14:35:15,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-05 14:35:15,352 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 5 treesize of output 3 [2025-02-05 14:35:15,366 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-05 14:35:15,366 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 17 treesize of output 21 [2025-02-05 14:35:15,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2025-02-05 14:35:15,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:15,378 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 23 treesize of output 16 [2025-02-05 14:35:15,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:15,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:15,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2025-02-05 14:35:15,431 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 16 treesize of output 11 [2025-02-05 14:35:15,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 14:35:15,445 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 16 treesize of output 11 [2025-02-05 14:35:15,491 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2025-02-05 14:35:15,492 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 94 [2025-02-05 14:35:15,495 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-05 14:35:15,504 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-05 14:35:15,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 84 [2025-02-05 14:35:15,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:15,515 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-02-05 14:35:15,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 107 [2025-02-05 14:35:15,520 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 5 treesize of output 3 [2025-02-05 14:35:15,522 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2025-02-05 14:35:15,540 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2025-02-05 14:35:15,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2025-02-05 14:35:15,558 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-05 14:35:15,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-02-05 14:35:15,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-02-05 14:35:15,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-05 14:35:15,614 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-02-05 14:35:15,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 86 [2025-02-05 14:35:15,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 14:35:15,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2025-02-05 14:35:15,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-02-05 14:35:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:35:15,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:35:15,941 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (v_ArrVal_654 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_655) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_656) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8)))) (or (= .cse0 1) (= .cse0 0)))) is different from false [2025-02-05 14:35:15,967 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_655 (Array Int Int)) (v_ArrVal_646 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_33| Int) (v_ArrVal_649 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (v_ArrVal_654 (Array Int Int))) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc3#1.base_33|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_33| v_ArrVal_651))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_642)) |v_ULTIMATE.start_main_#t~malloc3#1.base_33| v_ArrVal_649) .cse1 v_ArrVal_655) (select (select (store .cse2 .cse1 v_ArrVal_656) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc3#1.base_33| v_ArrVal_646) .cse1 v_ArrVal_654) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8)))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_33|) 0)) (= .cse0 1) (= .cse0 0)))) is different from false [2025-02-05 14:35:16,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:16,000 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 199 treesize of output 191 [2025-02-05 14:35:16,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:16,009 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 155 [2025-02-05 14:35:16,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:16,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1789 treesize of output 1599 [2025-02-05 14:35:16,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:16,035 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 743 treesize of output 728 [2025-02-05 14:35:16,045 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 299 treesize of output 237 [2025-02-05 14:35:16,054 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 359 treesize of output 235 [2025-02-05 14:35:16,077 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 6 treesize of output 4 [2025-02-05 14:35:16,084 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 6 treesize of output 4 [2025-02-05 14:35:16,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:16,289 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 772 treesize of output 653 [2025-02-05 14:35:16,355 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-02-05 14:35:16,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95267 treesize of output 93622 [2025-02-05 14:35:17,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:17,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 9100 treesize of output 7972 [2025-02-05 14:35:17,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:17,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85666 treesize of output 75752 [2025-02-05 14:35:17,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:17,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7210 treesize of output 7031 [2025-02-05 14:35:17,846 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 6970 treesize of output 6902 [2025-02-05 14:35:17,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:17,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6902 treesize of output 6803 [2025-02-05 14:35:18,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:18,067 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 6742 treesize of output 6749 [2025-02-05 14:35:18,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:18,165 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 6845 treesize of output 6165 [2025-02-05 14:35:18,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:18,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6044 treesize of output 5557 [2025-02-05 14:35:18,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:18,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5508 treesize of output 5361 [2025-02-05 14:35:18,520 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 5312 treesize of output 5208 [2025-02-05 14:35:18,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:18,641 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 5208 treesize of output 5173 [2025-02-05 14:35:18,750 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 5148 treesize of output 5132 [2025-02-05 14:35:18,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:35:18,885 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 5132 treesize of output 5133 [2025-02-05 14:35:19,000 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 5108 treesize of output 5060