./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-cav19/array_init_pair_sum_const.c --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/array-cav19/array_init_pair_sum_const.c -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 b8fdffcd3d5c4257bd11c08a4d1194cf24a2807af8b572699be11b4eeff19c02 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:15:39,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:15:39,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 17:15:39,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:15:39,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:15:39,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:15:39,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:15:39,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:15:39,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:15:39,434 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:15:39,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:15:39,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:15:39,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:15:39,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:15:39,435 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:15:39,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:15:39,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:15:39,436 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:15:39,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:15:39,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:15:39,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:15:39,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:15:39,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:15:39,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:15:39,436 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:15:39,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:15:39,436 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:15:39,437 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:15:39,437 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:15:39,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:15:39,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:15:39,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:15:39,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:15:39,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:15:39,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:15:39,438 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:15:39,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:15:39,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:15:39,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:15:39,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:15:39,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:15:39,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:15:39,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:15:39,438 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 -> b8fdffcd3d5c4257bd11c08a4d1194cf24a2807af8b572699be11b4eeff19c02 [2025-02-07 17:15:39,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:15:39,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:15:39,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:15:39,675 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:15:39,675 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:15:39,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_init_pair_sum_const.c [2025-02-07 17:15:40,852 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75c5f5dd0/5cb8319861664e9a82d6481757e67443/FLAGa1e477b91 [2025-02-07 17:15:41,042 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:15:41,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_pair_sum_const.c [2025-02-07 17:15:41,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75c5f5dd0/5cb8319861664e9a82d6481757e67443/FLAGa1e477b91 [2025-02-07 17:15:41,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75c5f5dd0/5cb8319861664e9a82d6481757e67443 [2025-02-07 17:15:41,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:15:41,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:15:41,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:15:41,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:15:41,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:15:41,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:15:41" (1/1) ... [2025-02-07 17:15:41,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e02b091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:15:41, skipping insertion in model container [2025-02-07 17:15:41,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:15:41" (1/1) ... [2025-02-07 17:15:41,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:15:41,205 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/array-cav19/array_init_pair_sum_const.c[416,429] [2025-02-07 17:15:41,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:15:41,222 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:15:41,229 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/array-cav19/array_init_pair_sum_const.c[416,429] [2025-02-07 17:15:41,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:15:41,241 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:15:41,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:15:41 WrapperNode [2025-02-07 17:15:41,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:15:41,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:15:41,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:15:41,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:15:41,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:15:41" (1/1) ... [2025-02-07 17:15:41,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:15:41" (1/1) ... [2025-02-07 17:15:41,262 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2025-02-07 17:15:41,263 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:15:41,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:15:41,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:15:41,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:15:41,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:15:41" (1/1) ... [2025-02-07 17:15:41,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:15:41" (1/1) ... [2025-02-07 17:15:41,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:15:41" (1/1) ... [2025-02-07 17:15:41,285 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2025-02-07 17:15:41,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:15:41" (1/1) ... [2025-02-07 17:15:41,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:15:41" (1/1) ... [2025-02-07 17:15:41,291 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:15:41" (1/1) ... [2025-02-07 17:15:41,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:15:41" (1/1) ... [2025-02-07 17:15:41,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:15:41" (1/1) ... [2025-02-07 17:15:41,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:15:41" (1/1) ... [2025-02-07 17:15:41,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:15:41,294 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:15:41,294 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:15:41,295 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:15:41,295 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:15:41" (1/1) ... [2025-02-07 17:15:41,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:15:41,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:15:41,320 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 17:15:41,323 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 17:15:41,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:15:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:15:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 17:15:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 17:15:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 17:15:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 17:15:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 17:15:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 17:15:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 17:15:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 17:15:41,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:15:41,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:15:41,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 17:15:41,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 17:15:41,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 17:15:41,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 17:15:41,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 17:15:41,396 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:15:41,398 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:15:41,512 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset; [2025-02-07 17:15:41,519 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-07 17:15:41,520 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:15:41,526 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:15:41,526 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:15:41,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:15:41 BoogieIcfgContainer [2025-02-07 17:15:41,527 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:15:41,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:15:41,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:15:41,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:15:41,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:15:41" (1/3) ... [2025-02-07 17:15:41,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c56d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:15:41, skipping insertion in model container [2025-02-07 17:15:41,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:15:41" (2/3) ... [2025-02-07 17:15:41,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c56d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:15:41, skipping insertion in model container [2025-02-07 17:15:41,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:15:41" (3/3) ... [2025-02-07 17:15:41,536 INFO L128 eAbstractionObserver]: Analyzing ICFG array_init_pair_sum_const.c [2025-02-07 17:15:41,546 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:15:41,548 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array_init_pair_sum_const.c that has 1 procedures, 11 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-07 17:15:41,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:15:41,597 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;@6238e715, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:15:41,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:15:41,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:15:41,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 17:15:41,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:15:41,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 17:15:41,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:15:41,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:15:41,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1299700829, now seen corresponding path program 1 times [2025-02-07 17:15:41,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:15:41,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188175915] [2025-02-07 17:15:41,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:15:41,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:15:41,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 17:15:41,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 17:15:41,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:15:41,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:15:41,807 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 17:15:41,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:15:41,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188175915] [2025-02-07 17:15:41,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188175915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:15:41,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:15:41,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 17:15:41,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854140375] [2025-02-07 17:15:41,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:15:41,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:15:41,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:15:41,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:15:41,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:15:41,829 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:15:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:15:41,866 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2025-02-07 17:15:41,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:15:41,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-07 17:15:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:15:41,872 INFO L225 Difference]: With dead ends: 21 [2025-02-07 17:15:41,873 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 17:15:41,876 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 17:15:41,878 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:15:41,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:15:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 17:15:41,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-02-07 17:15:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:15:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2025-02-07 17:15:41,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2025-02-07 17:15:41,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:15:41,902 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2025-02-07 17:15:41,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:15:41,902 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2025-02-07 17:15:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 17:15:41,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:15:41,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:15:41,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:15:41,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:15:41,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:15:41,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1666527978, now seen corresponding path program 1 times [2025-02-07 17:15:41,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:15:41,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506583903] [2025-02-07 17:15:41,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:15:41,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:15:41,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 17:15:41,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 17:15:41,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:15:41,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:15:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:15:41,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:15:41,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506583903] [2025-02-07 17:15:41,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506583903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:15:41,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:15:41,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:15:41,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543884573] [2025-02-07 17:15:41,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:15:41,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:15:41,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:15:41,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:15:41,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:15:41,992 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:15:42,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:15:42,016 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2025-02-07 17:15:42,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:15:42,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 17:15:42,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:15:42,017 INFO L225 Difference]: With dead ends: 15 [2025-02-07 17:15:42,017 INFO L226 Difference]: Without dead ends: 10 [2025-02-07 17:15:42,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:15:42,018 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:15:42,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 8 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:15:42,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-07 17:15:42,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-02-07 17:15:42,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:15:42,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2025-02-07 17:15:42,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2025-02-07 17:15:42,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:15:42,022 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-02-07 17:15:42,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:15:42,023 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2025-02-07 17:15:42,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 17:15:42,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:15:42,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:15:42,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 17:15:42,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:15:42,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:15:42,023 INFO L85 PathProgramCache]: Analyzing trace with hash 123715037, now seen corresponding path program 1 times [2025-02-07 17:15:42,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:15:42,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611878253] [2025-02-07 17:15:42,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:15:42,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:15:42,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 17:15:42,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 17:15:42,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:15:42,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:15:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:15:42,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:15:42,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611878253] [2025-02-07 17:15:42,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611878253] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:15:42,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298179111] [2025-02-07 17:15:42,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:15:42,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:15:42,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:15:42,096 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 17:15:42,098 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 17:15:42,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 17:15:42,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 17:15:42,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:15:42,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:15:42,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 17:15:42,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:15:42,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:15:42,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:15:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:15:42,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298179111] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:15:42,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:15:42,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-02-07 17:15:42,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613427930] [2025-02-07 17:15:42,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:15:42,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 17:15:42,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:15:42,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 17:15:42,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-07 17:15:42,251 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:15:42,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:15:42,283 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2025-02-07 17:15:42,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 17:15:42,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-07 17:15:42,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:15:42,284 INFO L225 Difference]: With dead ends: 20 [2025-02-07 17:15:42,284 INFO L226 Difference]: Without dead ends: 13 [2025-02-07 17:15:42,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-07 17:15:42,285 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:15:42,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 20 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:15:42,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-07 17:15:42,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-07 17:15:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:15:42,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-02-07 17:15:42,290 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2025-02-07 17:15:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:15:42,290 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-02-07 17:15:42,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:15:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-02-07 17:15:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 17:15:42,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:15:42,291 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:15:42,296 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 17:15:42,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:15:42,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:15:42,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:15:42,492 INFO L85 PathProgramCache]: Analyzing trace with hash 648146826, now seen corresponding path program 2 times [2025-02-07 17:15:42,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:15:42,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777570121] [2025-02-07 17:15:42,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:15:42,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:15:42,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-07 17:15:42,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 17:15:42,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:15:42,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:15:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 17:15:42,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:15:42,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777570121] [2025-02-07 17:15:42,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777570121] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:15:42,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662657524] [2025-02-07 17:15:42,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:15:42,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:15:42,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:15:42,622 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 17:15:42,623 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 17:15:42,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-07 17:15:42,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 17:15:42,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:15:42,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:15:42,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 17:15:42,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:15:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:15:42,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:15:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:15:42,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662657524] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:15:42,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:15:42,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2025-02-07 17:15:42,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469761476] [2025-02-07 17:15:42,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:15:42,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 17:15:42,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:15:42,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 17:15:42,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=114, Unknown=0, NotChecked=0, Total=210 [2025-02-07 17:15:42,818 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:15:42,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:15:42,969 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2025-02-07 17:15:42,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 17:15:42,970 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 17:15:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:15:42,970 INFO L225 Difference]: With dead ends: 76 [2025-02-07 17:15:42,970 INFO L226 Difference]: Without dead ends: 69 [2025-02-07 17:15:42,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=214, Unknown=0, NotChecked=0, Total=380 [2025-02-07 17:15:42,971 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 140 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:15:42,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 31 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:15:42,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-07 17:15:42,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 28. [2025-02-07 17:15:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:15:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-02-07 17:15:42,978 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 11 [2025-02-07 17:15:42,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:15:42,978 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-02-07 17:15:42,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:15:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-02-07 17:15:42,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 17:15:42,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:15:42,979 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2025-02-07 17:15:42,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 17:15:43,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:15:43,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:15:43,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:15:43,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1662398621, now seen corresponding path program 3 times [2025-02-07 17:15:43,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:15:43,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940605260] [2025-02-07 17:15:43,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:15:43,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:15:43,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 6 equivalence classes. [2025-02-07 17:15:43,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 17:15:43,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-07 17:15:43,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:15:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-07 17:15:43,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:15:43,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940605260] [2025-02-07 17:15:43,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940605260] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:15:43,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121965398] [2025-02-07 17:15:43,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:15:43,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:15:43,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:15:43,525 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 17:15:43,526 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 17:15:43,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 6 equivalence classes. [2025-02-07 17:15:43,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 17:15:43,786 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-07 17:15:43,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:15:43,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-07 17:15:43,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:15:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-07 17:15:43,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:15:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-07 17:15:44,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121965398] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:15:44,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:15:44,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 36 [2025-02-07 17:15:44,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938478257] [2025-02-07 17:15:44,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:15:44,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-07 17:15:44,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:15:44,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-07 17:15:44,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2025-02-07 17:15:44,209 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 37 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:15:44,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:15:44,591 INFO L93 Difference]: Finished difference Result 169 states and 196 transitions. [2025-02-07 17:15:44,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-07 17:15:44,592 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-07 17:15:44,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:15:44,592 INFO L225 Difference]: With dead ends: 169 [2025-02-07 17:15:44,592 INFO L226 Difference]: Without dead ends: 153 [2025-02-07 17:15:44,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=876, Invalid=1380, Unknown=0, NotChecked=0, Total=2256 [2025-02-07 17:15:44,594 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 437 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:15:44,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 76 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:15:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-07 17:15:44,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 52. [2025-02-07 17:15:44,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:15:44,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2025-02-07 17:15:44,605 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 26 [2025-02-07 17:15:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:15:44,605 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2025-02-07 17:15:44,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:15:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2025-02-07 17:15:44,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-07 17:15:44,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:15:44,606 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1] [2025-02-07 17:15:44,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 17:15:44,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:15:44,806 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:15:44,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:15:44,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1646371811, now seen corresponding path program 4 times [2025-02-07 17:15:44,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:15:44,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067920372] [2025-02-07 17:15:44,807 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:15:44,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:15:44,845 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-02-07 17:15:45,106 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 49 of 50 statements. [2025-02-07 17:15:45,106 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 17:15:45,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:15:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 42 proven. 463 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:15:51,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:15:51,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067920372] [2025-02-07 17:15:51,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067920372] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:15:51,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308827414] [2025-02-07 17:15:51,078 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:15:51,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:15:51,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:15:51,081 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 17:15:51,082 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 17:15:51,150 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-02-07 17:15:51,222 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 49 of 50 statements. [2025-02-07 17:15:51,223 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 17:15:51,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:15:51,227 WARN L254 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 223 conjuncts are in the unsatisfiable core [2025-02-07 17:15:51,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:15:51,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-07 17:15:51,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2025-02-07 17:15:51,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:51,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2025-02-07 17:15:51,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:51,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2025-02-07 17:15:51,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:51,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:51,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:51,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 58 [2025-02-07 17:15:51,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:51,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:51,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 73 [2025-02-07 17:15:51,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:51,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 77 treesize of output 88 [2025-02-07 17:15:51,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:51,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:51,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 103 [2025-02-07 17:15:51,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:51,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:51,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 101 treesize of output 118 [2025-02-07 17:15:51,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:52,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:52,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 113 treesize of output 133 [2025-02-07 17:15:52,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:52,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:52,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 125 treesize of output 148 [2025-02-07 17:15:52,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:52,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:52,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 137 treesize of output 163 [2025-02-07 17:15:52,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:52,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:52,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:52,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 149 treesize of output 178 [2025-02-07 17:15:52,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:52,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:52,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 161 treesize of output 193 [2025-02-07 17:15:52,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:52,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:52,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 173 treesize of output 208 [2025-02-07 17:15:53,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:53,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:53,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 185 treesize of output 223 [2025-02-07 17:15:53,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:53,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 197 treesize of output 238 [2025-02-07 17:15:53,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:53,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:53,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:53,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 209 treesize of output 253 [2025-02-07 17:15:53,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:53,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 221 treesize of output 268 [2025-02-07 17:15:53,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:53,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:53,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 233 treesize of output 283 [2025-02-07 17:15:53,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:54,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:54,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 245 treesize of output 298 [2025-02-07 17:15:54,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-02-07 17:15:54,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-02-07 17:15:54,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:54,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 256 treesize of output 312 [2025-02-07 17:15:55,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-02-07 17:15:55,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2025-02-07 17:15:56,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:56,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 76 [2025-02-07 17:15:56,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:56,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 102 [2025-02-07 17:15:57,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:57,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 120 treesize of output 128 [2025-02-07 17:15:57,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:57,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 143 treesize of output 154 [2025-02-07 17:15:58,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:58,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 166 treesize of output 180 [2025-02-07 17:15:58,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:58,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 189 treesize of output 206 [2025-02-07 17:15:59,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:59,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 212 treesize of output 232 [2025-02-07 17:15:59,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:15:59,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 235 treesize of output 258 [2025-02-07 17:16:00,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:16:00,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 258 treesize of output 284 [2025-02-07 17:16:00,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:16:00,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 281 treesize of output 310 [2025-02-07 17:16:01,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:16:01,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 304 treesize of output 336 [2025-02-07 17:16:02,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:16:02,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 327 treesize of output 362 [2025-02-07 17:16:02,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:16:02,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 350 treesize of output 388 [2025-02-07 17:16:03,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:16:03,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 373 treesize of output 414 [2025-02-07 17:16:04,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:16:04,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 396 treesize of output 440 [2025-02-07 17:16:05,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:16:05,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 419 treesize of output 466 [2025-02-07 17:16:06,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:16:06,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 442 treesize of output 492 [2025-02-07 17:16:06,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:16:06,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 465 treesize of output 518 [2025-02-07 17:16:16,049 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 1049 DAG size of output: 569 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-02-07 17:16:16,049 INFO L349 Elim1Store]: treesize reduction 1680, result has 52.4 percent of original size [2025-02-07 17:16:16,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 42 select indices, 42 select index equivalence classes, 0 disjoint index pairs (out of 861 index pairs), introduced 42 new quantified variables, introduced 861 case distinctions, treesize of input 740 treesize of output 2273 [2025-02-07 17:16:16,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:16:16,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 22 select indices, 22 select index equivalence classes, 0 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 231 case distinctions, treesize of input 5095 treesize of output 3868 [2025-02-07 17:16:16,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 210 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 0 case distinctions, treesize of input 3380 treesize of output 2281 [2025-02-07 17:16:23,054 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 19 treesize of output 7 [2025-02-07 17:16:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 42 proven. 463 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:16:23,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:16:27,806 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 594 treesize of output 592