./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 affe6b2992f7714f4bd95d6011e70945dc7608cfcd3847461bdcd80eeea00f05 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:47:00,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:47:00,497 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:47:00,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:47:00,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:47:00,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:47:00,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:47:00,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:47:00,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:47:00,522 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:47:00,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:47:00,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:47:00,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:47:00,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:47:00,523 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:47:00,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:47:00,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:47:00,523 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:47:00,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:47:00,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:47:00,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:47:00,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:47:00,523 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:47:00,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:47:00,524 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:47:00,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:47:00,524 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:47:00,524 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:47:00,524 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:47:00,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:47:00,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:47:00,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:47:00,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:47:00,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:47:00,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:47:00,525 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:47:00,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:47:00,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:47:00,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:47:00,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:47:00,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:47:00,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:47:00,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:47:00,525 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/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 -> affe6b2992f7714f4bd95d6011e70945dc7608cfcd3847461bdcd80eeea00f05 [2025-03-08 05:47:00,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:47:00,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:47:00,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:47:00,754 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:47:00,754 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:47:00,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i [2025-03-08 05:47:01,885 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5a88242a/fa0e970a627d4886a9076a0e02b8d06e/FLAGd75b5c785 [2025-03-08 05:47:02,074 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:47:02,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i [2025-03-08 05:47:02,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5a88242a/fa0e970a627d4886a9076a0e02b8d06e/FLAGd75b5c785 [2025-03-08 05:47:02,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5a88242a/fa0e970a627d4886a9076a0e02b8d06e [2025-03-08 05:47:02,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:47:02,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:47:02,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:47:02,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:47:02,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:47:02,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:47:02" (1/1) ... [2025-03-08 05:47:02,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b7558f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:47:02, skipping insertion in model container [2025-03-08 05:47:02,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:47:02" (1/1) ... [2025-03-08 05:47:02,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:47:02,203 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i[1692,1705] [2025-03-08 05:47:02,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:47:02,219 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:47:02,226 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i[1692,1705] [2025-03-08 05:47:02,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:47:02,238 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:47:02,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:47:02 WrapperNode [2025-03-08 05:47:02,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:47:02,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:47:02,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:47:02,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:47:02,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:47:02" (1/1) ... [2025-03-08 05:47:02,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:47:02" (1/1) ... [2025-03-08 05:47:02,257 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2025-03-08 05:47:02,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:47:02,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:47:02,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:47:02,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:47:02,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:47:02" (1/1) ... [2025-03-08 05:47:02,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:47:02" (1/1) ... [2025-03-08 05:47:02,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:47:02" (1/1) ... [2025-03-08 05:47:02,270 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 13, 3]. 72 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 5 writes are split as follows [0, 4, 1]. [2025-03-08 05:47:02,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:47:02" (1/1) ... [2025-03-08 05:47:02,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:47:02" (1/1) ... [2025-03-08 05:47:02,274 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:47:02" (1/1) ... [2025-03-08 05:47:02,275 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:47:02" (1/1) ... [2025-03-08 05:47:02,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:47:02" (1/1) ... [2025-03-08 05:47:02,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:47:02" (1/1) ... [2025-03-08 05:47:02,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:47:02,280 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:47:02,280 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:47:02,280 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:47:02,281 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:47:02" (1/1) ... [2025-03-08 05:47:02,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:47:02,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:47:02,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:47:02,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:47:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:47:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_32_to_33_0 [2025-03-08 05:47:02,321 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_32_to_33_0 [2025-03-08 05:47:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:47:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:47:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:47:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 05:47:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 05:47:02,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 05:47:02,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 05:47:02,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:47:02,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:47:02,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 05:47:02,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 05:47:02,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 05:47:02,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 05:47:02,322 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 05:47:02,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 05:47:02,322 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_36_to_40_0 [2025-03-08 05:47:02,322 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_36_to_40_0 [2025-03-08 05:47:02,383 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:47:02,385 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:47:02,509 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-08 05:47:02,509 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:47:02,518 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:47:02,518 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:47:02,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:47:02 BoogieIcfgContainer [2025-03-08 05:47:02,520 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:47:02,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:47:02,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:47:02,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:47:02,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:47:02" (1/3) ... [2025-03-08 05:47:02,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61598037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:47:02, skipping insertion in model container [2025-03-08 05:47:02,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:47:02" (2/3) ... [2025-03-08 05:47:02,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61598037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:47:02, skipping insertion in model container [2025-03-08 05:47:02,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:47:02" (3/3) ... [2025-03-08 05:47:02,529 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_1-1.i [2025-03-08 05:47:02,540 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:47:02,542 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_simple_array_index_value_1-1.i that has 4 procedures, 31 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 05:47:02,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:47:02,590 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;@6f17f1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:47:02,590 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:47:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 05:47:02,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 05:47:02,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:47:02,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:47:02,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:47:02,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:47:02,600 INFO L85 PathProgramCache]: Analyzing trace with hash 575543335, now seen corresponding path program 1 times [2025-03-08 05:47:02,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:47:02,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348904023] [2025-03-08 05:47:02,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:47:02,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:47:02,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 05:47:02,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 05:47:02,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:47:02,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:47:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:47:03,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:47:03,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348904023] [2025-03-08 05:47:03,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348904023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:47:03,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:47:03,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:47:03,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052923651] [2025-03-08 05:47:03,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:47:03,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:47:03,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:47:03,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:47:03,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:47:03,102 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:47:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:47:03,248 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2025-03-08 05:47:03,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:47:03,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-08 05:47:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:47:03,253 INFO L225 Difference]: With dead ends: 59 [2025-03-08 05:47:03,253 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 05:47:03,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:47:03,256 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:47:03,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 46 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:47:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 05:47:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-08 05:47:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 05:47:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-08 05:47:03,281 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2025-03-08 05:47:03,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:47:03,281 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-08 05:47:03,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:47:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-08 05:47:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 05:47:03,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:47:03,284 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:47:03,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:47:03,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:47:03,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:47:03,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1914922352, now seen corresponding path program 1 times [2025-03-08 05:47:03,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:47:03,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796942938] [2025-03-08 05:47:03,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:47:03,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:47:03,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 05:47:03,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 05:47:03,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:47:03,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:47:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:47:03,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:47:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796942938] [2025-03-08 05:47:03,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796942938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:47:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117072426] [2025-03-08 05:47:03,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:47:03,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:47:03,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:47:03,653 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:47:03,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:47:03,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 05:47:03,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 05:47:03,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:47:03,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:47:03,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-08 05:47:03,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:47:03,742 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 11 treesize of output 7 [2025-03-08 05:47:03,799 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-03-08 05:47:03,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 05:47:03,898 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 11 treesize of output 7 [2025-03-08 05:47:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:47:04,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:47:04,603 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 28 treesize of output 26 [2025-03-08 05:47:04,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2025-03-08 05:47:04,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 05:47:04,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 100 [2025-03-08 05:47:04,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-08 05:47:04,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2025-03-08 05:47:04,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2025-03-08 05:47:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:47:05,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117072426] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:47:05,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:47:05,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 31 [2025-03-08 05:47:05,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261779629] [2025-03-08 05:47:05,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:47:05,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 05:47:05,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:47:05,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 05:47:05,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2025-03-08 05:47:05,100 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 31 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 10 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-08 05:47:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:47:05,619 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2025-03-08 05:47:05,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:47:05,620 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 10 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 21 [2025-03-08 05:47:05,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:47:05,621 INFO L225 Difference]: With dead ends: 46 [2025-03-08 05:47:05,621 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 05:47:05,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=126, Invalid=1134, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 05:47:05,622 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:47:05,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 118 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:47:05,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 05:47:05,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-08 05:47:05,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 05:47:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-03-08 05:47:05,632 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 21 [2025-03-08 05:47:05,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:47:05,632 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-03-08 05:47:05,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 10 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-08 05:47:05,633 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-03-08 05:47:05,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 05:47:05,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:47:05,634 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:47:05,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:47:05,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:47:05,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:47:05,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:47:05,839 INFO L85 PathProgramCache]: Analyzing trace with hash 330516943, now seen corresponding path program 2 times [2025-03-08 05:47:05,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:47:05,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469307213] [2025-03-08 05:47:05,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:47:05,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:47:05,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 05:47:05,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 05:47:05,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:47:05,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:47:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:47:06,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:47:06,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469307213] [2025-03-08 05:47:06,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469307213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:47:06,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075156691] [2025-03-08 05:47:06,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:47:06,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:47:06,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:47:06,323 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:47:06,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:47:06,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 05:47:06,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 05:47:06,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:47:06,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:47:06,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 05:47:06,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:47:06,442 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 11 treesize of output 7 [2025-03-08 05:47:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:47:06,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:47:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:47:11,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075156691] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:47:11,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:47:11,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 28 [2025-03-08 05:47:11,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219241503] [2025-03-08 05:47:11,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:47:11,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 05:47:11,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:47:11,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 05:47:11,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=640, Unknown=1, NotChecked=0, Total=756 [2025-03-08 05:47:11,128 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 28 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 24 states have internal predecessors, (33), 8 states have call successors, (9), 5 states have call predecessors, (9), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-08 05:47:15,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 05:47:19,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 05:47:31,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 05:47:35,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 05:47:35,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:47:35,475 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2025-03-08 05:47:35,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:47:35,475 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 24 states have internal predecessors, (33), 8 states have call successors, (9), 5 states have call predecessors, (9), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 26 [2025-03-08 05:47:35,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:47:35,476 INFO L225 Difference]: With dead ends: 50 [2025-03-08 05:47:35,476 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 05:47:35,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=172, Invalid=881, Unknown=3, NotChecked=0, Total=1056 [2025-03-08 05:47:35,476 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 14 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:47:35,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 98 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 300 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2025-03-08 05:47:35,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 05:47:35,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-08 05:47:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:47:35,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2025-03-08 05:47:35,485 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 26 [2025-03-08 05:47:35,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:47:35,485 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2025-03-08 05:47:35,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 24 states have internal predecessors, (33), 8 states have call successors, (9), 5 states have call predecessors, (9), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-08 05:47:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2025-03-08 05:47:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 05:47:35,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:47:35,487 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:47:35,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:47:35,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 05:47:35,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:47:35,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:47:35,688 INFO L85 PathProgramCache]: Analyzing trace with hash -258502793, now seen corresponding path program 3 times [2025-03-08 05:47:35,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:47:35,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410080868] [2025-03-08 05:47:35,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:47:35,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:47:35,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 5 equivalence classes. [2025-03-08 05:47:35,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 05:47:35,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 05:47:35,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:47:36,412 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:47:36,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:47:36,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410080868] [2025-03-08 05:47:36,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410080868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:47:36,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711645968] [2025-03-08 05:47:36,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:47:36,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:47:36,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:47:36,415 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:47:36,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:47:36,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 5 equivalence classes. [2025-03-08 05:47:36,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 05:47:36,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 05:47:36,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:47:36,600 WARN L254 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 161 conjuncts are in the unsatisfiable core [2025-03-08 05:47:36,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:47:36,609 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 11 treesize of output 7 [2025-03-08 05:47:36,676 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-03-08 05:47:37,520 INFO L349 Elim1Store]: treesize reduction 447, result has 3.7 percent of original size [2025-03-08 05:47:37,520 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 3 case distinctions, treesize of input 125 treesize of output 27 [2025-03-08 05:47:37,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 05:47:37,652 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 11 treesize of output 7 [2025-03-08 05:47:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:47:37,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:47:41,871 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 05:47:41,872 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 05:47:41,872 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 05:47:41,875 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 05:47:41,878 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 05:47:41,881 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 05:47:41,882 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 05:47:41,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 05:47:41,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 16 case distinctions, treesize of input 371 treesize of output 486 [2025-03-08 05:47:42,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 229 treesize of output 196 [2025-03-08 05:47:42,019 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 05:47:42,020 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 05:47:42,021 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 05:47:42,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 05:47:42,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 198 treesize of output 103 [2025-03-08 05:47:42,035 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 05:47:42,035 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 05:47:42,036 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 05:47:42,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 84 [2025-03-08 05:47:42,044 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 05:47:42,045 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 05:47:42,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 65 [2025-03-08 05:47:42,054 INFO L349 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2025-03-08 05:47:42,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2025-03-08 05:47:43,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711645968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:47:43,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:47:43,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 36 [2025-03-08 05:47:43,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721806700] [2025-03-08 05:47:43,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:47:43,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 05:47:43,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:47:43,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 05:47:43,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1838, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 05:47:43,820 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 36 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 31 states have internal predecessors, (41), 11 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-08 05:47:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:47:47,060 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2025-03-08 05:47:47,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 05:47:47,060 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 31 states have internal predecessors, (41), 11 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Word has length 36 [2025-03-08 05:47:47,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:47:47,061 INFO L225 Difference]: With dead ends: 72 [2025-03-08 05:47:47,061 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 05:47:47,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=387, Invalid=3773, Unknown=0, NotChecked=0, Total=4160 [2025-03-08 05:47:47,063 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 50 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:47:47,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 176 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 05:47:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 05:47:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2025-03-08 05:47:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-08 05:47:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-03-08 05:47:47,074 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 36 [2025-03-08 05:47:47,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:47:47,075 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-03-08 05:47:47,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 31 states have internal predecessors, (41), 11 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-08 05:47:47,075 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-03-08 05:47:47,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 05:47:47,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:47:47,075 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:47:47,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:47:47,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:47:47,276 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:47:47,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:47:47,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1585165984, now seen corresponding path program 4 times [2025-03-08 05:47:47,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:47:47,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519648831] [2025-03-08 05:47:47,277 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:47:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:47:47,286 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-03-08 05:47:47,296 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 05:47:47,296 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 05:47:47,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:47:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:47:48,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:47:48,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519648831] [2025-03-08 05:47:48,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519648831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:47:48,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090132069] [2025-03-08 05:47:48,058 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:47:48,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:47:48,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:47:48,061 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:47:48,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:47:48,111 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-03-08 05:47:48,157 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 05:47:48,157 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 05:47:48,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:47:48,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-08 05:47:48,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:47:48,165 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 11 treesize of output 7 [2025-03-08 05:47:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 05:47:48,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:48:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:48:30,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090132069] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:48:30,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:48:30,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 26] total 47 [2025-03-08 05:48:30,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812068374] [2025-03-08 05:48:30,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:48:30,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-08 05:48:30,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:30,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-08 05:48:30,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1934, Unknown=10, NotChecked=0, Total=2162 [2025-03-08 05:48:30,299 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 47 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 40 states have internal predecessors, (49), 12 states have call successors, (13), 8 states have call predecessors, (13), 18 states have return successors, (18), 16 states have call predecessors, (18), 11 states have call successors, (18) [2025-03-08 05:48:34,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 05:48:38,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 05:48:42,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []