./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-crafted/simple_array_index_value_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-crafted/simple_array_index_value_3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ce03462fe975a31ea60daf5f1377957a781bf3e81bf898be84185f681a4ed0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:48:15,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:48:15,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:48:15,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:48:15,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:48:15,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:48:15,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:48:15,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:48:15,263 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:48:15,263 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:48:15,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:48:15,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:48:15,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:48:15,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:48:15,263 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:48:15,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:48:15,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:48:15,263 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:48:15,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:48:15,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:48:15,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:48:15,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:48:15,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:48:15,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:48:15,264 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:48:15,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:48:15,264 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:48:15,264 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:48:15,264 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:48:15,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:48:15,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:48:15,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:48:15,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:48:15,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:48:15,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:48:15,265 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:48:15,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:48:15,265 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:48:15,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:48:15,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:48:15,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:48:15,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:48:15,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:48:15,266 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 -> 8ce03462fe975a31ea60daf5f1377957a781bf3e81bf898be84185f681a4ed0e [2025-02-05 14:48:15,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:48:15,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:48:15,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:48:15,565 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:48:15,565 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:48:15,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-crafted/simple_array_index_value_3.i [2025-02-05 14:48:16,848 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a0a203c5/fa8e92cb173e4b81b5a2827caa172648/FLAG36a31adf7 [2025-02-05 14:48:17,148 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:48:17,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-crafted/simple_array_index_value_3.i [2025-02-05 14:48:17,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a0a203c5/fa8e92cb173e4b81b5a2827caa172648/FLAG36a31adf7 [2025-02-05 14:48:17,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a0a203c5/fa8e92cb173e4b81b5a2827caa172648 [2025-02-05 14:48:17,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:48:17,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:48:17,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:48:17,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:48:17,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:48:17,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:48:17" (1/1) ... [2025-02-05 14:48:17,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25eaaa7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:17, skipping insertion in model container [2025-02-05 14:48:17,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:48:17" (1/1) ... [2025-02-05 14:48:17,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:48:17,330 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/loop-crafted/simple_array_index_value_3.i[920,933] [2025-02-05 14:48:17,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:48:17,355 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:48:17,364 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/loop-crafted/simple_array_index_value_3.i[920,933] [2025-02-05 14:48:17,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:48:17,386 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:48:17,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:17 WrapperNode [2025-02-05 14:48:17,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:48:17,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:48:17,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:48:17,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:48:17,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:17" (1/1) ... [2025-02-05 14:48:17,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:17" (1/1) ... [2025-02-05 14:48:17,409 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 37 [2025-02-05 14:48:17,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:48:17,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:48:17,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:48:17,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:48:17,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:17" (1/1) ... [2025-02-05 14:48:17,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:17" (1/1) ... [2025-02-05 14:48:17,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:17" (1/1) ... [2025-02-05 14:48:17,426 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-05 14:48:17,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:17" (1/1) ... [2025-02-05 14:48:17,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:17" (1/1) ... [2025-02-05 14:48:17,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:17" (1/1) ... [2025-02-05 14:48:17,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:17" (1/1) ... [2025-02-05 14:48:17,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:17" (1/1) ... [2025-02-05 14:48:17,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:17" (1/1) ... [2025-02-05 14:48:17,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:48:17,435 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:48:17,435 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:48:17,435 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:48:17,436 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:17" (1/1) ... [2025-02-05 14:48:17,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:48:17,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:48:17,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 14:48:17,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 14:48:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:48:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:48:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:48:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 14:48:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:48:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:48:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:48:17,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:48:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:48:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:48:17,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:48:17,546 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:48:17,548 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:48:17,683 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-02-05 14:48:17,683 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:48:17,691 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:48:17,691 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:48:17,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:48:17 BoogieIcfgContainer [2025-02-05 14:48:17,692 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:48:17,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:48:17,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:48:17,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:48:17,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:48:17" (1/3) ... [2025-02-05 14:48:17,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f50936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:48:17, skipping insertion in model container [2025-02-05 14:48:17,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:17" (2/3) ... [2025-02-05 14:48:17,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f50936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:48:17, skipping insertion in model container [2025-02-05 14:48:17,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:48:17" (3/3) ... [2025-02-05 14:48:17,701 INFO L128 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_3.i [2025-02-05 14:48:17,713 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:48:17,715 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple_array_index_value_3.i that has 1 procedures, 13 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 14:48:17,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:48:17,769 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;@679d4a19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:48:17,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:48:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 14:48:17,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:48:17,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:48:17,781 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:48:17,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:48:17,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1540969027, now seen corresponding path program 1 times [2025-02-05 14:48:17,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:48:17,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575565357] [2025-02-05 14:48:17,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:48:17,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:48:17,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 14:48:17,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 14:48:17,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:48:17,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:48:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:48:18,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:48:18,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575565357] [2025-02-05 14:48:18,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575565357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:48:18,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:48:18,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:48:18,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769478576] [2025-02-05 14:48:18,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:48:18,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:48:18,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:48:18,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:48:18,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:48:18,105 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:48:18,156 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2025-02-05 14:48:18,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:48:18,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 14:48:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:48:18,165 INFO L225 Difference]: With dead ends: 31 [2025-02-05 14:48:18,166 INFO L226 Difference]: Without dead ends: 18 [2025-02-05 14:48:18,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:48:18,174 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:48:18,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 18 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:48:18,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-05 14:48:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 11. [2025-02-05 14:48:18,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2025-02-05 14:48:18,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2025-02-05 14:48:18,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:48:18,203 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2025-02-05 14:48:18,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:18,204 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2025-02-05 14:48:18,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-05 14:48:18,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:48:18,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:48:18,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:48:18,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:48:18,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:48:18,207 INFO L85 PathProgramCache]: Analyzing trace with hash 392612042, now seen corresponding path program 1 times [2025-02-05 14:48:18,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:48:18,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121731426] [2025-02-05 14:48:18,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:48:18,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:48:18,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-05 14:48:18,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-05 14:48:18,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:48:18,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:48:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:48:18,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:48:18,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121731426] [2025-02-05 14:48:18,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121731426] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:48:18,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919057544] [2025-02-05 14:48:18,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:48:18,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:48:18,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:48:18,422 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:48:18,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 14:48:18,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-05 14:48:18,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-05 14:48:18,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:48:18,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:48:18,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 14:48:18,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:48:18,553 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-02-05 14:48:18,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:48:18,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:48:18,854 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 18 treesize of output 16 [2025-02-05 14:48:18,862 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 26 treesize of output 24 [2025-02-05 14:48:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:48:18,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919057544] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:48:18,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:48:18,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 8] total 13 [2025-02-05 14:48:18,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702836297] [2025-02-05 14:48:18,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:48:18,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 14:48:18,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:48:18,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 14:48:18,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-05 14:48:18,925 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:19,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:48:19,111 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-02-05 14:48:19,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 14:48:19,111 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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 9 [2025-02-05 14:48:19,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:48:19,112 INFO L225 Difference]: With dead ends: 39 [2025-02-05 14:48:19,113 INFO L226 Difference]: Without dead ends: 32 [2025-02-05 14:48:19,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-02-05 14:48:19,114 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:48:19,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 48 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:48:19,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-05 14:48:19,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 14. [2025-02-05 14:48:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-02-05 14:48:19,119 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2025-02-05 14:48:19,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:48:19,121 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-02-05 14:48:19,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2025-02-05 14:48:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 14:48:19,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:48:19,123 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:48:19,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 14:48:19,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:48:19,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:48:19,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:48:19,325 INFO L85 PathProgramCache]: Analyzing trace with hash 204083037, now seen corresponding path program 2 times [2025-02-05 14:48:19,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:48:19,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701493906] [2025-02-05 14:48:19,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:48:19,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:48:19,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-05 14:48:19,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 14:48:19,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:48:19,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:48:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:48:19,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:48:19,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701493906] [2025-02-05 14:48:19,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701493906] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:48:19,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960592208] [2025-02-05 14:48:19,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:48:19,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:48:19,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:48:19,497 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:48:19,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 14:48:19,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-05 14:48:19,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 14:48:19,560 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:48:19,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:48:19,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 14:48:19,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:48:19,590 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-02-05 14:48:19,615 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 27 treesize of output 11 [2025-02-05 14:48:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:48:19,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:48:19,833 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 29 treesize of output 27 [2025-02-05 14:48:19,841 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 154 treesize of output 150 [2025-02-05 14:48:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:48:19,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960592208] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:48:19,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:48:19,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-02-05 14:48:19,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208406230] [2025-02-05 14:48:19,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:48:19,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 14:48:19,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:48:19,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 14:48:19,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-02-05 14:48:19,901 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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-05 14:48:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:48:20,172 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2025-02-05 14:48:20,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 14:48:20,172 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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 10 [2025-02-05 14:48:20,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:48:20,173 INFO L225 Difference]: With dead ends: 56 [2025-02-05 14:48:20,173 INFO L226 Difference]: Without dead ends: 47 [2025-02-05 14:48:20,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-02-05 14:48:20,174 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 119 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:48:20,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 61 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:48:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-05 14:48:20,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 17. [2025-02-05 14:48:20,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-02-05 14:48:20,180 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2025-02-05 14:48:20,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:48:20,180 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-02-05 14:48:20,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 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-05 14:48:20,181 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-02-05 14:48:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 14:48:20,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:48:20,181 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:48:20,189 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-05 14:48:20,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:48:20,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:48:20,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:48:20,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1695557668, now seen corresponding path program 1 times [2025-02-05 14:48:20,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:48:20,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452837199] [2025-02-05 14:48:20,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:48:20,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:48:20,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 14:48:20,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 14:48:20,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:48:20,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:48:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:48:20,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:48:20,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452837199] [2025-02-05 14:48:20,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452837199] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:48:20,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413054265] [2025-02-05 14:48:20,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:48:20,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:48:20,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:48:20,565 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:48:20,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 14:48:20,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 14:48:20,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 14:48:20,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:48:20,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:48:20,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 14:48:20,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:48:20,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:48:20,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:48:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:48:20,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413054265] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:48:20,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:48:20,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-05 14:48:20,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665696423] [2025-02-05 14:48:20,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:48:20,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 14:48:20,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:48:20,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 14:48:20,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-02-05 14:48:20,703 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:20,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:48:20,904 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2025-02-05 14:48:20,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 14:48:20,905 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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 16 [2025-02-05 14:48:20,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:48:20,906 INFO L225 Difference]: With dead ends: 91 [2025-02-05 14:48:20,906 INFO L226 Difference]: Without dead ends: 80 [2025-02-05 14:48:20,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2025-02-05 14:48:20,907 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 134 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:48:20,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 99 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:48:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-05 14:48:20,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 22. [2025-02-05 14:48:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-02-05 14:48:20,919 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2025-02-05 14:48:20,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:48:20,920 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-02-05 14:48:20,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-02-05 14:48:20,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 14:48:20,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:48:20,922 INFO L218 NwaCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:48:20,930 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-05 14:48:21,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:48:21,126 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:48:21,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:48:21,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1802285809, now seen corresponding path program 2 times [2025-02-05 14:48:21,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:48:21,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113724053] [2025-02-05 14:48:21,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:48:21,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:48:21,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-05 14:48:21,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 14:48:21,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:48:21,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:48:21,441 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:48:21,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:48:21,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113724053] [2025-02-05 14:48:21,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113724053] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:48:21,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273481066] [2025-02-05 14:48:21,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:48:21,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:48:21,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:48:21,444 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:48:21,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 14:48:21,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-05 14:48:21,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 14:48:21,587 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:48:21,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:48:21,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 14:48:21,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:48:21,628 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:48:21,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:48:21,833 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:48:21,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273481066] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:48:21,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:48:21,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-02-05 14:48:21,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290893703] [2025-02-05 14:48:21,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:48:21,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 14:48:21,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:48:21,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 14:48:21,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2025-02-05 14:48:21,835 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:48:23,388 INFO L93 Difference]: Finished difference Result 191 states and 220 transitions. [2025-02-05 14:48:23,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 14:48:23,389 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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 21 [2025-02-05 14:48:23,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:48:23,390 INFO L225 Difference]: With dead ends: 191 [2025-02-05 14:48:23,390 INFO L226 Difference]: Without dead ends: 180 [2025-02-05 14:48:23,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=306, Invalid=506, Unknown=0, NotChecked=0, Total=812 [2025-02-05 14:48:23,392 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 641 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 14:48:23,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 446 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 14:48:23,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-05 14:48:23,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 32. [2025-02-05 14:48:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2025-02-05 14:48:23,403 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21 [2025-02-05 14:48:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:48:23,403 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-02-05 14:48:23,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2025-02-05 14:48:23,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 14:48:23,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:48:23,404 INFO L218 NwaCegarLoop]: trace histogram [18, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:48:23,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 14:48:23,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:48:23,605 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:48:23,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:48:23,605 INFO L85 PathProgramCache]: Analyzing trace with hash 537071313, now seen corresponding path program 3 times [2025-02-05 14:48:23,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:48:23,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581760483] [2025-02-05 14:48:23,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 14:48:23,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:48:23,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 10 equivalence classes. [2025-02-05 14:48:23,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 14:48:23,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-05 14:48:23,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:48:24,405 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:48:24,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:48:24,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581760483] [2025-02-05 14:48:24,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581760483] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:48:24,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099684398] [2025-02-05 14:48:24,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 14:48:24,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:48:24,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:48:24,408 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:48:24,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 14:48:24,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 10 equivalence classes. [2025-02-05 14:49:12,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 14:49:12,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-05 14:49:12,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:49:12,694 WARN L254 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 131 conjuncts are in the unsatisfiable core [2025-02-05 14:49:12,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:49:12,735 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-02-05 14:49:12,780 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 21 treesize of output 20 [2025-02-05 14:49:12,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:49:12,828 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 30 treesize of output 32 [2025-02-05 14:49:12,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:49:12,891 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 39 treesize of output 44 [2025-02-05 14:49:12,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:49:12,967 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 48 treesize of output 56 [2025-02-05 14:49:13,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:49:13,065 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 57 treesize of output 68 [2025-02-05 14:49:13,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:49:13,146 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 66 treesize of output 80 [2025-02-05 14:49:13,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:49:13,236 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 75 treesize of output 92 [2025-02-05 14:49:13,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:49:13,338 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 84 treesize of output 104 [2025-02-05 14:49:13,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:49:13,474 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 93 treesize of output 116 [2025-02-05 14:49:13,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:49:13,601 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 102 treesize of output 128 [2025-02-05 14:49:13,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:49:13,730 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 111 treesize of output 140 [2025-02-05 14:49:13,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:49:13,886 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 120 treesize of output 152 [2025-02-05 14:49:14,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:49:14,042 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 129 treesize of output 164 [2025-02-05 14:49:14,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:49:14,231 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 138 treesize of output 176 [2025-02-05 14:49:14,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:49:14,406 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 147 treesize of output 188 [2025-02-05 14:49:14,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:49:14,596 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 156 treesize of output 200 [2025-02-05 14:49:14,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 14:49:14,818 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 165 treesize of output 212 [2025-02-05 14:49:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:49:14,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:49:48,258 WARN L286 SmtUtils]: Spent 20.02s on a formula simplification. DAG size of input: 18 DAG size of output: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-05 14:49:56,272 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)