./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/heap-manipulation/merge_sort-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 e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:05:29,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:05:29,381 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:05:29,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:05:29,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:05:29,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:05:29,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:05:29,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:05:29,403 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:05:29,403 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:05:29,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:05:29,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:05:29,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:05:29,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:05:29,404 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:05:29,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:05:29,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:05:29,405 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:05:29,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:05:29,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:05:29,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:05:29,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:05:29,406 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:05:29,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:05:29,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:05:29,406 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 -> e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c [2025-02-07 20:05:29,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:05:29,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:05:29,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:05:29,629 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:05:29,629 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:05:29,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2025-02-07 20:05:30,782 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2334a76ce/33abac16e2b44d1f843d01f8b3ce13c8/FLAG2970b94ba [2025-02-07 20:05:31,056 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:05:31,057 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2025-02-07 20:05:31,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2334a76ce/33abac16e2b44d1f843d01f8b3ce13c8/FLAG2970b94ba [2025-02-07 20:05:31,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2334a76ce/33abac16e2b44d1f843d01f8b3ce13c8 [2025-02-07 20:05:31,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:05:31,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:05:31,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:05:31,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:05:31,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:05:31,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:05:31" (1/1) ... [2025-02-07 20:05:31,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b5e4a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:31, skipping insertion in model container [2025-02-07 20:05:31,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:05:31" (1/1) ... [2025-02-07 20:05:31,383 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:05:31,617 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/heap-manipulation/merge_sort-2.i[22632,22645] [2025-02-07 20:05:31,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:05:31,654 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:05:31,680 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/heap-manipulation/merge_sort-2.i[22632,22645] [2025-02-07 20:05:31,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:05:31,717 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:05:31,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:31 WrapperNode [2025-02-07 20:05:31,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:05:31,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:05:31,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:05:31,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:05:31,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:31" (1/1) ... [2025-02-07 20:05:31,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:31" (1/1) ... [2025-02-07 20:05:31,757 INFO L138 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 264 [2025-02-07 20:05:31,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:05:31,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:05:31,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:05:31,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:05:31,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:31" (1/1) ... [2025-02-07 20:05:31,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:31" (1/1) ... [2025-02-07 20:05:31,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:31" (1/1) ... [2025-02-07 20:05:31,810 INFO L175 MemorySlicer]: Split 49 memory accesses to 4 slices as follows [2, 34, 10, 3]. 69 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 13 writes are split as follows [0, 8, 3, 2]. [2025-02-07 20:05:31,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:31" (1/1) ... [2025-02-07 20:05:31,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:31" (1/1) ... [2025-02-07 20:05:31,823 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:31" (1/1) ... [2025-02-07 20:05:31,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:31" (1/1) ... [2025-02-07 20:05:31,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:31" (1/1) ... [2025-02-07 20:05:31,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:31" (1/1) ... [2025-02-07 20:05:31,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:05:31,831 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:05:31,831 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:05:31,831 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:05:31,832 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:31" (1/1) ... [2025-02-07 20:05:31,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:05:31,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:31,855 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-07 20:05:31,857 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-07 20:05:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 20:05:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 20:05:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 20:05:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 20:05:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2025-02-07 20:05:31,874 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2025-02-07 20:05:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-02-07 20:05:31,874 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-02-07 20:05:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 20:05:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 20:05:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 20:05:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 20:05:31,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 20:05:31,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:05:31,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 20:05:31,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:05:31,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:05:31,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-07 20:05:31,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-07 20:05:31,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:05:31,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:05:31,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-07 20:05:31,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-07 20:05:31,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 20:05:31,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:05:31,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 20:05:31,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 20:05:31,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 20:05:31,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:05:31,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:05:31,994 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:05:31,995 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:05:32,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L656: main_#t~ret42#1.base, main_#t~ret42#1.offset := seq_sort_core_#res#1.base, seq_sort_core_#res#1.offset;havoc seq_sort_core_#t~mem17#1.base, seq_sort_core_#t~mem17#1.offset, seq_sort_core_#t~mem18#1.base, seq_sort_core_#t~mem18#1.offset, seq_sort_core_#t~mem19#1.base, seq_sort_core_#t~mem19#1.offset, seq_sort_core_#t~mem20#1.base, seq_sort_core_#t~mem20#1.offset, seq_sort_core_~next~0#1.base, seq_sort_core_~next~0#1.offset, seq_sort_core_~data#1.base, seq_sort_core_~data#1.offset, seq_sort_core_~dst~0#1.base, seq_sort_core_~dst~0#1.offset;havoc seq_sort_core_#in~data#1.base, seq_sort_core_#in~data#1.offset;assume { :end_inline_seq_sort_core } true;main_~data~0#1.base, main_~data~0#1.offset := main_#t~ret42#1.base, main_#t~ret42#1.offset; [2025-02-07 20:05:32,321 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-02-07 20:05:32,322 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:05:32,334 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:05:32,334 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:05:32,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:05:32 BoogieIcfgContainer [2025-02-07 20:05:32,334 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:05:32,336 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:05:32,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:05:32,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:05:32,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:05:31" (1/3) ... [2025-02-07 20:05:32,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed42ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:05:32, skipping insertion in model container [2025-02-07 20:05:32,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:31" (2/3) ... [2025-02-07 20:05:32,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed42ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:05:32, skipping insertion in model container [2025-02-07 20:05:32,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:05:32" (3/3) ... [2025-02-07 20:05:32,342 INFO L128 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2025-02-07 20:05:32,353 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:05:32,354 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG merge_sort-2.i that has 3 procedures, 96 locations, 1 initial locations, 20 loop locations, and 1 error locations. [2025-02-07 20:05:32,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:05:32,394 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;@5ba7d8c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:05:32,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:05:32,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 75 states have (on average 1.8) internal successors, (135), 93 states have internal predecessors, (135), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-07 20:05:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 20:05:32,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:32,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:32,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:32,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:32,405 INFO L85 PathProgramCache]: Analyzing trace with hash 862937942, now seen corresponding path program 1 times [2025-02-07 20:05:32,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:32,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498246861] [2025-02-07 20:05:32,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:32,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:32,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:05:32,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:05:32,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:32,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:32,498 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-07 20:05:32,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:32,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498246861] [2025-02-07 20:05:32,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498246861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:32,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:32,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:05:32,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589198661] [2025-02-07 20:05:32,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:32,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:05:32,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:32,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:05:32,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:05:32,518 INFO L87 Difference]: Start difference. First operand has 96 states, 75 states have (on average 1.8) internal successors, (135), 93 states have internal predecessors, (135), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:32,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:32,535 INFO L93 Difference]: Finished difference Result 189 states and 328 transitions. [2025-02-07 20:05:32,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:05:32,537 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 20:05:32,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:32,544 INFO L225 Difference]: With dead ends: 189 [2025-02-07 20:05:32,544 INFO L226 Difference]: Without dead ends: 71 [2025-02-07 20:05:32,549 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-07 20:05:32,551 INFO L435 NwaCegarLoop]: 117 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, 117 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-07 20:05:32,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:05:32,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-07 20:05:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-02-07 20:05:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.263157894736842) internal successors, (72), 69 states have internal predecessors, (72), 13 states have call successors, (13), 1 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2025-02-07 20:05:32,609 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 7 [2025-02-07 20:05:32,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:32,609 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2025-02-07 20:05:32,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:32,610 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2025-02-07 20:05:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 20:05:32,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:32,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:32,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:05:32,610 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:32,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:32,611 INFO L85 PathProgramCache]: Analyzing trace with hash 356988694, now seen corresponding path program 1 times [2025-02-07 20:05:32,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:32,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501867818] [2025-02-07 20:05:32,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:32,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:32,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 20:05:32,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 20:05:32,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:32,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:32,664 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-07 20:05:32,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:32,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501867818] [2025-02-07 20:05:32,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501867818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:32,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:32,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:05:32,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093342954] [2025-02-07 20:05:32,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:32,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:05:32,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:32,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:05:32,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:05:32,665 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:32,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:32,681 INFO L93 Difference]: Finished difference Result 141 states and 169 transitions. [2025-02-07 20:05:32,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:05:32,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-07 20:05:32,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:32,682 INFO L225 Difference]: With dead ends: 141 [2025-02-07 20:05:32,682 INFO L226 Difference]: Without dead ends: 77 [2025-02-07 20:05:32,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07 20:05:32,683 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:32,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 164 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:05:32,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-07 20:05:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2025-02-07 20:05:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 71 states have internal predecessors, (74), 13 states have call successors, (13), 1 states have call predecessors, (13), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2025-02-07 20:05:32,687 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 8 [2025-02-07 20:05:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:32,688 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2025-02-07 20:05:32,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2025-02-07 20:05:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 20:05:32,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:32,688 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:32,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:05:32,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:32,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:32,689 INFO L85 PathProgramCache]: Analyzing trace with hash -395887493, now seen corresponding path program 1 times [2025-02-07 20:05:32,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:32,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029030750] [2025-02-07 20:05:32,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:32,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:32,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:05:32,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:05:32,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:32,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:32,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:32,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029030750] [2025-02-07 20:05:32,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029030750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:32,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:32,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:05:32,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513734338] [2025-02-07 20:05:32,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:32,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:05:32,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:32,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:05:32,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:05:32,824 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:32,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:32,913 INFO L93 Difference]: Finished difference Result 111 states and 133 transitions. [2025-02-07 20:05:32,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:05:32,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-07 20:05:32,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:32,914 INFO L225 Difference]: With dead ends: 111 [2025-02-07 20:05:32,914 INFO L226 Difference]: Without dead ends: 106 [2025-02-07 20:05:32,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:05:32,915 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 136 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:32,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 207 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:05:32,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-07 20:05:32,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 78. [2025-02-07 20:05:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 76 states have internal predecessors, (80), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2025-02-07 20:05:32,922 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 14 [2025-02-07 20:05:32,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:32,922 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2025-02-07 20:05:32,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:32,922 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2025-02-07 20:05:32,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 20:05:32,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:32,923 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-07 20:05:32,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:05:32,923 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:32,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:32,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1581310250, now seen corresponding path program 1 times [2025-02-07 20:05:32,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:32,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420609469] [2025-02-07 20:05:32,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:32,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:32,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 20:05:32,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:05:32,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:32,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:33,031 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-07 20:05:33,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:33,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420609469] [2025-02-07 20:05:33,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420609469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:33,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:33,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:05:33,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798031864] [2025-02-07 20:05:33,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:33,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:05:33,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:33,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:05:33,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:05:33,033 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:33,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:33,120 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2025-02-07 20:05:33,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:05:33,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-07 20:05:33,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:33,121 INFO L225 Difference]: With dead ends: 80 [2025-02-07 20:05:33,122 INFO L226 Difference]: Without dead ends: 77 [2025-02-07 20:05:33,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:05:33,123 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 12 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:33,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 235 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:05:33,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-07 20:05:33,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-07 20:05:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 75 states have internal predecessors, (79), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2025-02-07 20:05:33,137 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 22 [2025-02-07 20:05:33,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:33,137 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2025-02-07 20:05:33,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:33,137 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2025-02-07 20:05:33,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 20:05:33,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:33,138 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-07 20:05:33,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:05:33,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:33,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:33,139 INFO L85 PathProgramCache]: Analyzing trace with hash -664222432, now seen corresponding path program 1 times [2025-02-07 20:05:33,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:33,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465792369] [2025-02-07 20:05:33,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:33,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:33,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 20:05:33,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 20:05:33,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:33,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:33,270 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-07 20:05:33,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:33,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465792369] [2025-02-07 20:05:33,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465792369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:33,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:33,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:05:33,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863770215] [2025-02-07 20:05:33,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:33,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:05:33,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:33,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:05:33,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:05:33,272 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:33,348 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2025-02-07 20:05:33,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:05:33,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-07 20:05:33,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:33,350 INFO L225 Difference]: With dead ends: 79 [2025-02-07 20:05:33,350 INFO L226 Difference]: Without dead ends: 76 [2025-02-07 20:05:33,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:05:33,351 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 12 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:33,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 229 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:05:33,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-07 20:05:33,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-07 20:05:33,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2) internal successors, (78), 74 states have internal predecessors, (78), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:33,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2025-02-07 20:05:33,363 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 22 [2025-02-07 20:05:33,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:33,364 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2025-02-07 20:05:33,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:33,364 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2025-02-07 20:05:33,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 20:05:33,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:33,367 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, 1, 1, 1] [2025-02-07 20:05:33,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 20:05:33,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:33,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:33,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1642027985, now seen corresponding path program 1 times [2025-02-07 20:05:33,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:33,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385297079] [2025-02-07 20:05:33,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:33,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:33,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 20:05:33,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 20:05:33,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:33,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:33,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:33,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385297079] [2025-02-07 20:05:33,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385297079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:33,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:33,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:05:33,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014511946] [2025-02-07 20:05:33,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:33,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:05:33,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:33,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:05:33,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:05:33,533 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:33,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:33,641 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2025-02-07 20:05:33,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:05:33,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-07 20:05:33,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:33,643 INFO L225 Difference]: With dead ends: 106 [2025-02-07 20:05:33,643 INFO L226 Difference]: Without dead ends: 103 [2025-02-07 20:05:33,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 20:05:33,644 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 116 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:33,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 212 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:05:33,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-07 20:05:33,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2025-02-07 20:05:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 80 states have internal predecessors, (84), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2025-02-07 20:05:33,652 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 25 [2025-02-07 20:05:33,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:33,652 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2025-02-07 20:05:33,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:33,652 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2025-02-07 20:05:33,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 20:05:33,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:33,653 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, 1, 1, 1] [2025-02-07 20:05:33,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 20:05:33,653 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:33,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:33,653 INFO L85 PathProgramCache]: Analyzing trace with hash -986097800, now seen corresponding path program 1 times [2025-02-07 20:05:33,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:33,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376963475] [2025-02-07 20:05:33,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:33,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:33,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 20:05:33,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 20:05:33,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:33,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:33,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:33,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376963475] [2025-02-07 20:05:33,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376963475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:33,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:33,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:05:33,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664505307] [2025-02-07 20:05:33,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:33,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:05:33,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:33,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:05:33,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:05:33,773 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:33,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:33,913 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2025-02-07 20:05:33,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:05:33,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-07 20:05:33,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:33,914 INFO L225 Difference]: With dead ends: 105 [2025-02-07 20:05:33,914 INFO L226 Difference]: Without dead ends: 102 [2025-02-07 20:05:33,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 20:05:33,914 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 114 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:33,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 212 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:05:33,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-07 20:05:33,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88. [2025-02-07 20:05:33,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 86 states have internal predecessors, (90), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2025-02-07 20:05:33,927 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 25 [2025-02-07 20:05:33,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:33,927 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2025-02-07 20:05:33,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:33,927 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2025-02-07 20:05:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-07 20:05:33,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:33,928 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, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:33,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 20:05:33,928 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:33,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:33,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1987294611, now seen corresponding path program 1 times [2025-02-07 20:05:33,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:33,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812355538] [2025-02-07 20:05:33,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:33,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:33,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-07 20:05:33,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 20:05:33,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:33,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:34,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:34,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812355538] [2025-02-07 20:05:34,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812355538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:34,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:34,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 20:05:34,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81994339] [2025-02-07 20:05:34,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:34,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:05:34,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:34,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:05:34,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:05:34,276 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:34,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:34,457 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2025-02-07 20:05:34,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:05:34,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-07 20:05:34,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:34,460 INFO L225 Difference]: With dead ends: 104 [2025-02-07 20:05:34,460 INFO L226 Difference]: Without dead ends: 101 [2025-02-07 20:05:34,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:05:34,461 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 110 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:34,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 251 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:05:34,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-07 20:05:34,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2025-02-07 20:05:34,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.1625) internal successors, (93), 89 states have internal predecessors, (93), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:34,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2025-02-07 20:05:34,475 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 28 [2025-02-07 20:05:34,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:34,476 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2025-02-07 20:05:34,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:34,477 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2025-02-07 20:05:34,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-07 20:05:34,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:34,478 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, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:34,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 20:05:34,478 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:34,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:34,478 INFO L85 PathProgramCache]: Analyzing trace with hash 681953149, now seen corresponding path program 1 times [2025-02-07 20:05:34,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:34,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678374842] [2025-02-07 20:05:34,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:34,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:34,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-07 20:05:34,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 20:05:34,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:34,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:34,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:34,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678374842] [2025-02-07 20:05:34,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678374842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:34,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:34,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 20:05:34,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006614204] [2025-02-07 20:05:34,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:34,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:05:34,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:34,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:05:34,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:05:34,735 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:34,902 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2025-02-07 20:05:34,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:05:34,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-07 20:05:34,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:34,903 INFO L225 Difference]: With dead ends: 103 [2025-02-07 20:05:34,903 INFO L226 Difference]: Without dead ends: 100 [2025-02-07 20:05:34,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:05:34,904 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 108 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:34,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 251 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:05:34,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-07 20:05:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2025-02-07 20:05:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.1566265060240963) internal successors, (96), 92 states have internal predecessors, (96), 10 states have call successors, (10), 1 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2025-02-07 20:05:34,919 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 28 [2025-02-07 20:05:34,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:34,920 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2025-02-07 20:05:34,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2025-02-07 20:05:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-07 20:05:34,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:34,921 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:34,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 20:05:34,921 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:34,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:34,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1273793736, now seen corresponding path program 1 times [2025-02-07 20:05:34,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:34,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50889656] [2025-02-07 20:05:34,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:34,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:34,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 20:05:34,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 20:05:34,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:34,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:05:35,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:35,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50889656] [2025-02-07 20:05:35,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50889656] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:35,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502448352] [2025-02-07 20:05:35,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:35,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:35,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:35,034 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-07 20:05:35,035 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-07 20:05:35,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 20:05:35,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 20:05:35,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:35,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:35,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-07 20:05:35,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:05:35,241 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 31 treesize of output 19 [2025-02-07 20:05:35,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-07 20:05:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:05:35,259 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:05:35,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502448352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:35,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 20:05:35,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-02-07 20:05:35,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104004672] [2025-02-07 20:05:35,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:35,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:05:35,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:35,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:05:35,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:05:35,260 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:35,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:35,331 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2025-02-07 20:05:35,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:05:35,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-07 20:05:35,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:35,332 INFO L225 Difference]: With dead ends: 96 [2025-02-07 20:05:35,332 INFO L226 Difference]: Without dead ends: 92 [2025-02-07 20:05:35,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:05:35,333 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 33 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:35,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 194 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:05:35,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-07 20:05:35,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-07 20:05:35,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.1325301204819278) internal successors, (94), 90 states have internal predecessors, (94), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:35,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2025-02-07 20:05:35,343 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 34 [2025-02-07 20:05:35,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:35,343 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2025-02-07 20:05:35,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2025-02-07 20:05:35,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 20:05:35,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:35,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:35,351 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-07 20:05:35,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-07 20:05:35,549 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:35,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:35,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1103918215, now seen corresponding path program 1 times [2025-02-07 20:05:35,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:35,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557702906] [2025-02-07 20:05:35,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:35,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:35,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 20:05:35,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 20:05:35,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:35,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:35,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:35,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557702906] [2025-02-07 20:05:35,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557702906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:35,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:35,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:05:35,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80961908] [2025-02-07 20:05:35,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:35,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:05:35,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:35,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:05:35,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:05:35,629 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:35,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:35,682 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2025-02-07 20:05:35,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:05:35,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-07 20:05:35,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:35,684 INFO L225 Difference]: With dead ends: 94 [2025-02-07 20:05:35,684 INFO L226 Difference]: Without dead ends: 91 [2025-02-07 20:05:35,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 20:05:35,685 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 107 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:35,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 203 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:05:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-07 20:05:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-07 20:05:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 89 states have internal predecessors, (93), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2025-02-07 20:05:35,697 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 35 [2025-02-07 20:05:35,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:35,697 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2025-02-07 20:05:35,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:35,698 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2025-02-07 20:05:35,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-07 20:05:35,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:35,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:35,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 20:05:35,699 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:35,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:35,699 INFO L85 PathProgramCache]: Analyzing trace with hash -357120741, now seen corresponding path program 1 times [2025-02-07 20:05:35,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:35,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260309965] [2025-02-07 20:05:35,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:35,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:35,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-07 20:05:35,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-07 20:05:35,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:35,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:35,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:35,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260309965] [2025-02-07 20:05:35,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260309965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:35,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:35,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 20:05:35,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417065504] [2025-02-07 20:05:35,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:35,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 20:05:35,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:35,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 20:05:35,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:05:35,999 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:36,173 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2025-02-07 20:05:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 20:05:36,174 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-07 20:05:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:36,174 INFO L225 Difference]: With dead ends: 117 [2025-02-07 20:05:36,174 INFO L226 Difference]: Without dead ends: 114 [2025-02-07 20:05:36,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-02-07 20:05:36,175 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 118 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:36,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 338 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:05:36,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-07 20:05:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2025-02-07 20:05:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 93 states have (on average 1.10752688172043) internal successors, (103), 99 states have internal predecessors, (103), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2025-02-07 20:05:36,185 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 38 [2025-02-07 20:05:36,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:36,185 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2025-02-07 20:05:36,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:36,185 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2025-02-07 20:05:36,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-07 20:05:36,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:36,185 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:36,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 20:05:36,185 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:36,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:36,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1714897115, now seen corresponding path program 1 times [2025-02-07 20:05:36,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:36,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781043235] [2025-02-07 20:05:36,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:36,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:36,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 20:05:36,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 20:05:36,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:36,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 20:05:36,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:36,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781043235] [2025-02-07 20:05:36,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781043235] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:36,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513765250] [2025-02-07 20:05:36,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:36,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:36,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:36,416 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-07 20:05:36,418 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-07 20:05:36,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 20:05:36,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 20:05:36,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:36,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:36,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-07 20:05:36,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:05:36,555 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 18 treesize of output 7 [2025-02-07 20:05:36,562 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 18 treesize of output 7 [2025-02-07 20:05:36,643 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-07 20:05:36,657 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 20:05:36,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:05:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 20:05:36,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513765250] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:05:36,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:05:36,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2025-02-07 20:05:36,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503652738] [2025-02-07 20:05:36,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:05:36,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 20:05:36,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:36,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 20:05:36,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-07 20:05:36,783 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:36,959 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2025-02-07 20:05:36,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:05:36,960 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-02-07 20:05:36,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:36,960 INFO L225 Difference]: With dead ends: 212 [2025-02-07 20:05:36,960 INFO L226 Difference]: Without dead ends: 147 [2025-02-07 20:05:36,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-02-07 20:05:36,961 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:36,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 461 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:05:36,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-07 20:05:36,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 113. [2025-02-07 20:05:36,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 105 states have (on average 1.1047619047619048) internal successors, (116), 111 states have internal predecessors, (116), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:36,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2025-02-07 20:05:36,972 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 40 [2025-02-07 20:05:36,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:36,972 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2025-02-07 20:05:36,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:36,972 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2025-02-07 20:05:36,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-07 20:05:36,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:36,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:36,979 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-07 20:05:37,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:37,177 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:37,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:37,178 INFO L85 PathProgramCache]: Analyzing trace with hash -448999018, now seen corresponding path program 1 times [2025-02-07 20:05:37,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:37,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290714676] [2025-02-07 20:05:37,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:37,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:37,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-07 20:05:37,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 20:05:37,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:37,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:37,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:37,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290714676] [2025-02-07 20:05:37,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290714676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:37,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:37,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 20:05:37,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884030990] [2025-02-07 20:05:37,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:37,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:05:37,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:37,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:05:37,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:05:37,285 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:37,430 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2025-02-07 20:05:37,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:05:37,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-02-07 20:05:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:37,431 INFO L225 Difference]: With dead ends: 117 [2025-02-07 20:05:37,431 INFO L226 Difference]: Without dead ends: 114 [2025-02-07 20:05:37,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:05:37,432 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 70 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:37,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 218 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:05:37,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-07 20:05:37,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2025-02-07 20:05:37,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 105 states have (on average 1.0952380952380953) internal successors, (115), 110 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2025-02-07 20:05:37,442 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 41 [2025-02-07 20:05:37,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:37,442 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2025-02-07 20:05:37,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:37,442 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2025-02-07 20:05:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-07 20:05:37,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:37,443 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:37,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 20:05:37,443 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:37,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:37,444 INFO L85 PathProgramCache]: Analyzing trace with hash -911085430, now seen corresponding path program 2 times [2025-02-07 20:05:37,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:37,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136905313] [2025-02-07 20:05:37,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:05:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:37,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-07 20:05:37,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-07 20:05:37,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:05:37,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:38,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:38,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136905313] [2025-02-07 20:05:38,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136905313] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:38,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382223185] [2025-02-07 20:05:38,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:05:38,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:38,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:38,011 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-07 20:05:38,013 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-07 20:05:38,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-07 20:05:38,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-07 20:05:38,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:05:38,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:38,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-02-07 20:05:38,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:05:38,163 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-07 20:05:38,198 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 18 treesize of output 7 [2025-02-07 20:05:38,203 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 18 treesize of output 7 [2025-02-07 20:05:38,254 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-07 20:05:38,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-07 20:05:38,293 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 16 treesize of output 11 [2025-02-07 20:05:38,303 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 16 treesize of output 11 [2025-02-07 20:05:38,375 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-02-07 20:05:38,375 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 1 case distinctions, treesize of input 34 treesize of output 23 [2025-02-07 20:05:38,391 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2025-02-07 20:05:38,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 22 [2025-02-07 20:05:39,075 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-07 20:05:39,162 INFO L349 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2025-02-07 20:05:39,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 28 [2025-02-07 20:05:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:39,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:05:39,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_445 (Array Int Int))) (let ((.cse0 (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_445))) (store .cse2 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse2 |ULTIMATE.start_main_~item~0#1.base|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select .cse0 .cse1) 0) (not (= (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) 0))))) (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (or (not (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_445))) (store .cse3 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse3 |ULTIMATE.start_main_~item~0#1.base|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0)) (forall ((|ULTIMATE.start_main_~node~1#1.offset| Int)) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_444))) (store .cse4 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse4 |ULTIMATE.start_main_~item~0#1.base|) 0 |ULTIMATE.start_main_~node~1#1.offset|) 4 |c_ULTIMATE.start_main_~data~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1.base|) .cse1) 0)))))) is different from false [2025-02-07 20:05:39,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:39,763 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 104 treesize of output 70 [2025-02-07 20:05:39,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:39,774 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 478 treesize of output 464 [2025-02-07 20:05:39,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 438 treesize of output 414 [2025-02-07 20:05:39,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:39,976 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 132 treesize of output 116 [2025-02-07 20:05:40,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:40,019 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 2 case distinctions, treesize of input 52 treesize of output 45 [2025-02-07 20:05:40,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:40,032 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 2 case distinctions, treesize of input 51 treesize of output 44 [2025-02-07 20:05:40,036 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:05:40,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:40,050 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 86 treesize of output 86 [2025-02-07 20:05:40,060 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 63 treesize of output 59 [2025-02-07 20:05:40,068 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:05:40,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:40,077 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 83 treesize of output 83 [2025-02-07 20:05:40,087 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 102 treesize of output 100 [2025-02-07 20:05:40,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 121 [2025-02-07 20:05:40,212 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 78 treesize of output 62 [2025-02-07 20:05:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-07 20:05:40,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382223185] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:05:40,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:05:40,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 32 [2025-02-07 20:05:40,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59165965] [2025-02-07 20:05:40,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:05:40,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-07 20:05:40,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:40,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-07 20:05:40,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=836, Unknown=1, NotChecked=58, Total=992 [2025-02-07 20:05:40,353 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 32 states, 32 states have (on average 3.75) internal successors, (120), 32 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:42,285 INFO L93 Difference]: Finished difference Result 313 states and 341 transitions. [2025-02-07 20:05:42,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-07 20:05:42,285 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.75) internal successors, (120), 32 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-07 20:05:42,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:42,286 INFO L225 Difference]: With dead ends: 313 [2025-02-07 20:05:42,286 INFO L226 Difference]: Without dead ends: 276 [2025-02-07 20:05:42,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=456, Invalid=2627, Unknown=1, NotChecked=108, Total=3192 [2025-02-07 20:05:42,288 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 874 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 275 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:42,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 1521 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1364 Invalid, 0 Unknown, 275 Unchecked, 0.9s Time] [2025-02-07 20:05:42,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-02-07 20:05:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 166. [2025-02-07 20:05:42,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 159 states have (on average 1.0943396226415094) internal successors, (174), 164 states have internal predecessors, (174), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 180 transitions. [2025-02-07 20:05:42,304 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 180 transitions. Word has length 46 [2025-02-07 20:05:42,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:42,305 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 180 transitions. [2025-02-07 20:05:42,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.75) internal successors, (120), 32 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:42,305 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2025-02-07 20:05:42,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-07 20:05:42,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:42,306 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:42,315 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-07 20:05:42,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:42,506 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:42,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:42,507 INFO L85 PathProgramCache]: Analyzing trace with hash -255155245, now seen corresponding path program 1 times [2025-02-07 20:05:42,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:42,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816912639] [2025-02-07 20:05:42,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:42,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:42,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-07 20:05:42,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-07 20:05:42,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:42,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:42,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:42,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:42,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816912639] [2025-02-07 20:05:42,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816912639] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:42,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847297363] [2025-02-07 20:05:42,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:42,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:42,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:43,000 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-07 20:05:43,007 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-07 20:05:43,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-07 20:05:43,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-07 20:05:43,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:43,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:43,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-07 20:05:43,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:05:43,159 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-07 20:05:43,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2025-02-07 20:05:43,213 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-07 20:05:43,213 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-07 20:05:43,258 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 17 treesize of output 12 [2025-02-07 20:05:43,272 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-07 20:05:43,272 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 16 treesize of output 18 [2025-02-07 20:05:43,318 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 35 treesize of output 16 [2025-02-07 20:05:43,323 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 18 treesize of output 7 [2025-02-07 20:05:43,490 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-07 20:05:43,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:43,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2025-02-07 20:05:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:43,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:05:43,700 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_554 Int) (|v_ULTIMATE.start_main_~item~0#1.base_16| Int) (v_ArrVal_552 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_16|) 0)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_552))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_16| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_16|) 0 v_ArrVal_554) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0)))) is different from false [2025-02-07 20:05:43,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:43,758 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 51 treesize of output 44 [2025-02-07 20:05:43,761 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:05:43,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:43,766 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 163 treesize of output 157 [2025-02-07 20:05:43,770 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 66 treesize of output 64 [2025-02-07 20:05:43,797 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 76 treesize of output 70 [2025-02-07 20:05:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-07 20:05:43,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847297363] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:05:43,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:05:43,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2025-02-07 20:05:43,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153666461] [2025-02-07 20:05:43,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:05:43,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-07 20:05:43,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:43,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-07 20:05:43,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=528, Unknown=2, NotChecked=46, Total=650 [2025-02-07 20:05:43,928 INFO L87 Difference]: Start difference. First operand 166 states and 180 transitions. Second operand has 26 states, 26 states have (on average 4.423076923076923) internal successors, (115), 26 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:44,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:44,613 INFO L93 Difference]: Finished difference Result 233 states and 251 transitions. [2025-02-07 20:05:44,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-07 20:05:44,613 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.423076923076923) internal successors, (115), 26 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-07 20:05:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:44,614 INFO L225 Difference]: With dead ends: 233 [2025-02-07 20:05:44,614 INFO L226 Difference]: Without dead ends: 230 [2025-02-07 20:05:44,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=1061, Unknown=2, NotChecked=68, Total=1332 [2025-02-07 20:05:44,615 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 397 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:44,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1159 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1003 Invalid, 0 Unknown, 176 Unchecked, 0.4s Time] [2025-02-07 20:05:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-07 20:05:44,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 174. [2025-02-07 20:05:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 167 states have (on average 1.089820359281437) internal successors, (182), 172 states have internal predecessors, (182), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2025-02-07 20:05:44,632 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 46 [2025-02-07 20:05:44,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:44,632 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2025-02-07 20:05:44,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.423076923076923) internal successors, (115), 26 states have internal predecessors, (115), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:44,632 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2025-02-07 20:05:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-07 20:05:44,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:44,633 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:44,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 20:05:44,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-07 20:05:44,833 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:44,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:44,834 INFO L85 PathProgramCache]: Analyzing trace with hash -55578957, now seen corresponding path program 1 times [2025-02-07 20:05:44,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:44,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590825397] [2025-02-07 20:05:44,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:44,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:44,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-07 20:05:44,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-07 20:05:44,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:44,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:44,880 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-07 20:05:44,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:44,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590825397] [2025-02-07 20:05:44,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590825397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:44,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:44,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:05:44,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613764033] [2025-02-07 20:05:44,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:44,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:05:44,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:44,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:05:44,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:05:44,882 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:44,930 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2025-02-07 20:05:44,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:05:44,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-02-07 20:05:44,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:44,931 INFO L225 Difference]: With dead ends: 176 [2025-02-07 20:05:44,931 INFO L226 Difference]: Without dead ends: 137 [2025-02-07 20:05:44,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:05:44,931 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 1 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:44,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 231 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:05:44,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-07 20:05:44,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-02-07 20:05:44,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 131 states have (on average 1.0763358778625953) internal successors, (141), 135 states have internal predecessors, (141), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:44,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 146 transitions. [2025-02-07 20:05:44,944 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 146 transitions. Word has length 47 [2025-02-07 20:05:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:44,945 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 146 transitions. [2025-02-07 20:05:44,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:44,945 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2025-02-07 20:05:44,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-07 20:05:44,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:44,945 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:44,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 20:05:44,945 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:44,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:44,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2012759896, now seen corresponding path program 1 times [2025-02-07 20:05:44,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:44,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742344064] [2025-02-07 20:05:44,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:44,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:44,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 20:05:44,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 20:05:44,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:44,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:45,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:45,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742344064] [2025-02-07 20:05:45,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742344064] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:45,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258845556] [2025-02-07 20:05:45,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:45,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:45,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:45,837 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:05:45,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 20:05:45,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 20:05:45,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 20:05:45,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:45,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:45,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-02-07 20:05:45,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:05:45,961 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-07 20:05:45,989 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 18 treesize of output 7 [2025-02-07 20:05:45,993 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 18 treesize of output 7 [2025-02-07 20:05:46,033 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-07 20:05:46,034 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-07 20:05:46,078 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-07 20:05:46,082 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-07 20:05:46,092 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-07 20:05:46,092 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 16 treesize of output 18 [2025-02-07 20:05:46,131 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 30 treesize of output 22 [2025-02-07 20:05:46,138 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 34 treesize of output 15 [2025-02-07 20:05:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:46,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:05:46,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:46,809 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 52 treesize of output 45 [2025-02-07 20:05:46,811 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:05:46,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:46,817 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 86 treesize of output 86 [2025-02-07 20:05:46,821 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 34 treesize of output 30 [2025-02-07 20:05:46,854 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 80 treesize of output 68 [2025-02-07 20:05:46,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:46,919 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 52 treesize of output 45 [2025-02-07 20:05:46,923 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 20:05:46,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:46,928 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 172 treesize of output 166 [2025-02-07 20:05:46,932 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 29 treesize of output 25 [2025-02-07 20:05:46,943 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 21 treesize of output 13 [2025-02-07 20:05:46,960 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 125 treesize of output 113 [2025-02-07 20:05:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:47,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258845556] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:05:47,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:05:47,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 31 [2025-02-07 20:05:47,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704662729] [2025-02-07 20:05:47,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:05:47,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-07 20:05:47,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:47,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-07 20:05:47,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=855, Unknown=1, NotChecked=0, Total=930 [2025-02-07 20:05:47,115 INFO L87 Difference]: Start difference. First operand 137 states and 146 transitions. Second operand has 31 states, 31 states have (on average 4.225806451612903) internal successors, (131), 31 states have internal predecessors, (131), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:48,470 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2025-02-07 20:05:48,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-07 20:05:48,472 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.225806451612903) internal successors, (131), 31 states have internal predecessors, (131), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-02-07 20:05:48,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:48,472 INFO L225 Difference]: With dead ends: 181 [2025-02-07 20:05:48,473 INFO L226 Difference]: Without dead ends: 158 [2025-02-07 20:05:48,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=289, Invalid=2260, Unknown=1, NotChecked=0, Total=2550 [2025-02-07 20:05:48,473 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 492 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:48,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 815 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 20:05:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-07 20:05:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 125. [2025-02-07 20:05:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 119 states have (on average 1.0672268907563025) internal successors, (127), 123 states have internal predecessors, (127), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2025-02-07 20:05:48,489 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 49 [2025-02-07 20:05:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:48,490 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2025-02-07 20:05:48,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.225806451612903) internal successors, (131), 31 states have internal predecessors, (131), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2025-02-07 20:05:48,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-07 20:05:48,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:48,490 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:48,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 20:05:48,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-07 20:05:48,691 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:48,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:48,691 INFO L85 PathProgramCache]: Analyzing trace with hash 707418434, now seen corresponding path program 1 times [2025-02-07 20:05:48,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:48,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768930618] [2025-02-07 20:05:48,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:48,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:48,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 20:05:48,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 20:05:48,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:48,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:49,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:49,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768930618] [2025-02-07 20:05:49,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768930618] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:49,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798570958] [2025-02-07 20:05:49,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:49,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:49,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:49,498 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:05:49,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 20:05:49,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 20:05:49,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 20:05:49,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:49,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:49,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-02-07 20:05:49,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:05:49,604 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-07 20:05:49,619 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 18 treesize of output 7 [2025-02-07 20:05:49,629 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-07 20:05:49,629 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-07 20:05:49,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-02-07 20:05:49,659 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 34 treesize of output 15 [2025-02-07 20:05:49,664 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 30 treesize of output 22 [2025-02-07 20:05:49,730 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-02-07 20:05:49,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2025-02-07 20:05:49,789 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 27 treesize of output 25 [2025-02-07 20:05:49,799 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-02-07 20:05:49,800 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 56 treesize of output 49 [2025-02-07 20:05:49,813 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-07 20:05:49,814 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-07 20:05:49,874 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-02-07 20:05:49,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 44 [2025-02-07 20:05:49,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2025-02-07 20:05:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:50,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:05:54,942 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~node~1#1.offset| Int) (v_ArrVal_801 Int)) (= (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse3 |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~node~1#1.offset|) .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|)))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse1 |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_801) .cse2 |c_ULTIMATE.start_main_~data~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|))) 0)) (forall ((|ULTIMATE.start_main_~node~1#1.offset| Int) (v_ArrVal_801 Int)) (= (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse1 |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_801) .cse2 |c_ULTIMATE.start_main_~data~0#1.base|)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (store .cse3 |c_ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~node~1#1.offset|) .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) 0)))) is different from false [2025-02-07 20:05:59,081 INFO L349 Elim1Store]: treesize reduction 208, result has 34.4 percent of original size [2025-02-07 20:05:59,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 501 treesize of output 402 [2025-02-07 20:05:59,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:59,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 33933434 treesize of output 33761616