./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array22_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array22_pattern.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31d323b6985f030ac0fb5fda45d0cb8af14c3bb3898c8ff09cf5a292e40f357b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:32:14,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:32:14,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:32:14,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:32:14,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:32:15,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:32:15,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:32:15,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:32:15,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:32:15,023 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:32:15,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:32:15,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:32:15,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:32:15,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:32:15,025 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:32:15,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:32:15,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:32:15,026 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:32:15,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:32:15,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:32:15,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:32:15,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:32:15,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:32:15,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:32:15,027 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:32:15,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:32:15,027 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:32:15,027 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:32:15,027 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:32:15,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:32:15,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:32:15,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:32:15,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:32:15,028 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:32:15,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:32:15,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:32:15,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:32:15,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:32:15,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:32:15,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:32:15,029 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:32:15,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:32:15,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:32:15,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:32:15,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:32:15,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:32:15,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:32:15,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:32:15,030 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 -> 31d323b6985f030ac0fb5fda45d0cb8af14c3bb3898c8ff09cf5a292e40f357b [2025-01-08 22:32:15,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:32:15,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:32:15,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:32:15,335 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:32:15,335 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:32:15,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array22_pattern.c [2025-01-08 22:32:16,624 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7742a5373/e49078a84a854503b7bf9de820aad48c/FLAGdbb0e554e [2025-01-08 22:32:16,855 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:32:16,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array22_pattern.c [2025-01-08 22:32:16,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7742a5373/e49078a84a854503b7bf9de820aad48c/FLAGdbb0e554e [2025-01-08 22:32:17,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7742a5373/e49078a84a854503b7bf9de820aad48c [2025-01-08 22:32:17,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:32:17,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:32:17,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:32:17,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:32:17,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:32:17,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:32:17" (1/1) ... [2025-01-08 22:32:17,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@204f131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:32:17, skipping insertion in model container [2025-01-08 22:32:17,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:32:17" (1/1) ... [2025-01-08 22:32:17,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:32:17,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array22_pattern.c[1347,1360] [2025-01-08 22:32:17,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:32:17,382 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:32:17,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array22_pattern.c[1347,1360] [2025-01-08 22:32:17,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:32:17,424 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:32:17,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:32:17 WrapperNode [2025-01-08 22:32:17,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:32:17,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:32:17,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:32:17,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:32:17,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:32:17" (1/1) ... [2025-01-08 22:32:17,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:32:17" (1/1) ... [2025-01-08 22:32:17,455 INFO L138 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2025-01-08 22:32:17,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:32:17,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:32:17,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:32:17,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:32:17,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:32:17" (1/1) ... [2025-01-08 22:32:17,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:32:17" (1/1) ... [2025-01-08 22:32:17,467 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:32:17" (1/1) ... [2025-01-08 22:32:17,482 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-08 22:32:17,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:32:17" (1/1) ... [2025-01-08 22:32:17,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:32:17" (1/1) ... [2025-01-08 22:32:17,491 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:32:17" (1/1) ... [2025-01-08 22:32:17,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:32:17" (1/1) ... [2025-01-08 22:32:17,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:32:17" (1/1) ... [2025-01-08 22:32:17,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:32:17" (1/1) ... [2025-01-08 22:32:17,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:32:17" (1/1) ... [2025-01-08 22:32:17,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:32:17,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:32:17,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:32:17,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:32:17,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:32:17" (1/1) ... [2025-01-08 22:32:17,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:32:17,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:32:17,536 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-01-08 22:32:17,543 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-01-08 22:32:17,562 INFO L130 BoogieDeclarations]: Found specification of procedure outerBoundaryPatternCheck [2025-01-08 22:32:17,562 INFO L138 BoogieDeclarations]: Found implementation of procedure outerBoundaryPatternCheck [2025-01-08 22:32:17,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:32:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-08 22:32:17,563 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-08 22:32:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:32:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:32:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:32:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:32:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:32:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:32:17,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:32:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:32:17,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:32:17,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:32:17,630 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:32:17,631 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:32:17,805 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-01-08 22:32:17,806 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:32:17,814 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:32:17,815 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:32:17,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:32:17 BoogieIcfgContainer [2025-01-08 22:32:17,815 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:32:17,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:32:17,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:32:17,821 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:32:17,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:32:17" (1/3) ... [2025-01-08 22:32:17,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56270f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:32:17, skipping insertion in model container [2025-01-08 22:32:17,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:32:17" (2/3) ... [2025-01-08 22:32:17,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56270f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:32:17, skipping insertion in model container [2025-01-08 22:32:17,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:32:17" (3/3) ... [2025-01-08 22:32:17,823 INFO L128 eAbstractionObserver]: Analyzing ICFG array22_pattern.c [2025-01-08 22:32:17,835 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:32:17,837 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array22_pattern.c that has 3 procedures, 36 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-01-08 22:32:17,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:32:17,901 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;@102161c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:32:17,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:32:17,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-08 22:32:17,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-08 22:32:17,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:32:17,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:32:17,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:32:17,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:32:17,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1063501156, now seen corresponding path program 1 times [2025-01-08 22:32:17,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:32:17,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204691887] [2025-01-08 22:32:17,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:32:17,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:32:17,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-08 22:32:18,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-08 22:32:18,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:32:18,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:32:18,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:32:18,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204691887] [2025-01-08 22:32:18,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204691887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:32:18,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:32:18,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:32:18,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450655902] [2025-01-08 22:32:18,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:32:18,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-08 22:32:18,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:32:18,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-08 22:32:18,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:32:18,078 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-08 22:32:18,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:32:18,093 INFO L93 Difference]: Finished difference Result 69 states and 97 transitions. [2025-01-08 22:32:18,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-08 22:32:18,095 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-01-08 22:32:18,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:32:18,099 INFO L225 Difference]: With dead ends: 69 [2025-01-08 22:32:18,100 INFO L226 Difference]: Without dead ends: 32 [2025-01-08 22:32:18,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:32:18,106 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:32:18,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:32:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-08 22:32:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-01-08 22:32:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-08 22:32:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-01-08 22:32:18,139 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 14 [2025-01-08 22:32:18,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:32:18,140 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-01-08 22:32:18,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-08 22:32:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2025-01-08 22:32:18,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-08 22:32:18,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:32:18,142 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:32:18,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:32:18,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:32:18,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:32:18,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1128465125, now seen corresponding path program 1 times [2025-01-08 22:32:18,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:32:18,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578225803] [2025-01-08 22:32:18,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:32:18,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:32:18,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-08 22:32:18,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-08 22:32:18,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:32:18,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-08 22:32:18,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:32:18,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578225803] [2025-01-08 22:32:18,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578225803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:32:18,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:32:18,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:32:18,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739145295] [2025-01-08 22:32:18,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:32:18,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:32:18,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:32:18,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:32:18,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:32:18,481 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-08 22:32:18,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:32:18,505 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2025-01-08 22:32:18,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:32:18,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2025-01-08 22:32:18,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:32:18,508 INFO L225 Difference]: With dead ends: 37 [2025-01-08 22:32:18,508 INFO L226 Difference]: Without dead ends: 34 [2025-01-08 22:32:18,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:32:18,509 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:32:18,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 97 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:32:18,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-08 22:32:18,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-01-08 22:32:18,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-08 22:32:18,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-01-08 22:32:18,520 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 41 [2025-01-08 22:32:18,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:32:18,521 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-01-08 22:32:18,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-08 22:32:18,521 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-01-08 22:32:18,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-08 22:32:18,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:32:18,522 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:32:18,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:32:18,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:32:18,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:32:18,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1631152846, now seen corresponding path program 1 times [2025-01-08 22:32:18,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:32:18,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984611820] [2025-01-08 22:32:18,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:32:18,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:32:18,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-08 22:32:18,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-08 22:32:18,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:32:18,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-08 22:32:18,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:32:18,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984611820] [2025-01-08 22:32:18,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984611820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:32:18,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:32:18,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:32:18,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888065085] [2025-01-08 22:32:18,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:32:18,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:32:18,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:32:18,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:32:18,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:32:18,752 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-08 22:32:18,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:32:18,860 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2025-01-08 22:32:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:32:18,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2025-01-08 22:32:18,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:32:18,861 INFO L225 Difference]: With dead ends: 68 [2025-01-08 22:32:18,861 INFO L226 Difference]: Without dead ends: 39 [2025-01-08 22:32:18,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:32:18,862 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:32:18,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 76 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:32:18,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-08 22:32:18,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2025-01-08 22:32:18,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-08 22:32:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2025-01-08 22:32:18,868 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 44 [2025-01-08 22:32:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:32:18,868 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2025-01-08 22:32:18,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-08 22:32:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2025-01-08 22:32:18,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-08 22:32:18,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:32:18,871 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:32:18,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:32:18,871 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:32:18,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:32:18,871 INFO L85 PathProgramCache]: Analyzing trace with hash -98050888, now seen corresponding path program 1 times [2025-01-08 22:32:18,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:32:18,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19566112] [2025-01-08 22:32:18,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:32:18,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:32:18,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-08 22:32:18,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-08 22:32:18,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:32:18,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:19,006 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:32:19,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:32:19,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19566112] [2025-01-08 22:32:19,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19566112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:32:19,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:32:19,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:32:19,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417133944] [2025-01-08 22:32:19,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:32:19,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:32:19,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:32:19,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:32:19,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:32:19,007 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-08 22:32:19,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:32:19,082 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2025-01-08 22:32:19,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:32:19,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2025-01-08 22:32:19,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:32:19,083 INFO L225 Difference]: With dead ends: 68 [2025-01-08 22:32:19,084 INFO L226 Difference]: Without dead ends: 38 [2025-01-08 22:32:19,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:32:19,084 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:32:19,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 88 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:32:19,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-08 22:32:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-01-08 22:32:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-08 22:32:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2025-01-08 22:32:19,091 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 46 [2025-01-08 22:32:19,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:32:19,091 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2025-01-08 22:32:19,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-08 22:32:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2025-01-08 22:32:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-08 22:32:19,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:32:19,092 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:32:19,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:32:19,093 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:32:19,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:32:19,093 INFO L85 PathProgramCache]: Analyzing trace with hash -637301560, now seen corresponding path program 1 times [2025-01-08 22:32:19,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:32:19,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217355197] [2025-01-08 22:32:19,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:32:19,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:32:19,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-08 22:32:19,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-08 22:32:19,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:32:19,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:32:19,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:32:19,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217355197] [2025-01-08 22:32:19,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217355197] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:32:19,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124261723] [2025-01-08 22:32:19,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:32:19,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:32:19,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:32:19,319 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-01-08 22:32:19,322 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-01-08 22:32:19,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-08 22:32:19,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-08 22:32:19,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:32:19,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:19,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:32:19,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:32:19,488 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-08 22:32:19,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:32:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:32:19,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124261723] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:32:19,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:32:19,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-01-08 22:32:19,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077359515] [2025-01-08 22:32:19,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:32:19,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-08 22:32:19,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:32:19,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-08 22:32:19,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:32:19,616 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-08 22:32:19,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:32:19,792 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2025-01-08 22:32:19,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-08 22:32:19,793 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 47 [2025-01-08 22:32:19,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:32:19,793 INFO L225 Difference]: With dead ends: 74 [2025-01-08 22:32:19,793 INFO L226 Difference]: Without dead ends: 44 [2025-01-08 22:32:19,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:32:19,794 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:32:19,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 123 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:32:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-08 22:32:19,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-01-08 22:32:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-08 22:32:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-01-08 22:32:19,811 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 47 [2025-01-08 22:32:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:32:19,811 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-01-08 22:32:19,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-08 22:32:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-01-08 22:32:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-08 22:32:19,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:32:19,812 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:32:19,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:32:20,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:32:20,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:32:20,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:32:20,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1107241649, now seen corresponding path program 2 times [2025-01-08 22:32:20,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:32:20,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062605024] [2025-01-08 22:32:20,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:32:20,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:32:20,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-01-08 22:32:20,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-08 22:32:20,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:32:20,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-08 22:32:20,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:32:20,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062605024] [2025-01-08 22:32:20,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062605024] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:32:20,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403872601] [2025-01-08 22:32:20,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:32:20,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:32:20,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:32:20,228 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-01-08 22:32:20,231 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-01-08 22:32:20,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-01-08 22:32:20,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-08 22:32:20,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:32:20,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:20,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:32:20,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:32:20,385 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:32:20,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:32:20,474 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-08 22:32:20,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403872601] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:32:20,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:32:20,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-01-08 22:32:20,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796731809] [2025-01-08 22:32:20,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:32:20,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-08 22:32:20,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:32:20,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-08 22:32:20,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:32:20,476 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-08 22:32:20,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:32:20,717 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2025-01-08 22:32:20,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-08 22:32:20,718 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 49 [2025-01-08 22:32:20,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:32:20,719 INFO L225 Difference]: With dead ends: 85 [2025-01-08 22:32:20,719 INFO L226 Difference]: Without dead ends: 56 [2025-01-08 22:32:20,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-01-08 22:32:20,720 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:32:20,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 137 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:32:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-08 22:32:20,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2025-01-08 22:32:20,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-08 22:32:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-01-08 22:32:20,736 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 49 [2025-01-08 22:32:20,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:32:20,736 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-01-08 22:32:20,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-08 22:32:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-01-08 22:32:20,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-08 22:32:20,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:32:20,737 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:32:20,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:32:20,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:32:20,939 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:32:20,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:32:20,939 INFO L85 PathProgramCache]: Analyzing trace with hash 52402563, now seen corresponding path program 3 times [2025-01-08 22:32:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:32:20,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509670463] [2025-01-08 22:32:20,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:32:20,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:32:20,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 7 equivalence classes. [2025-01-08 22:32:21,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 57 of 57 statements. [2025-01-08 22:32:21,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-08 22:32:21,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-08 22:32:21,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [830529073] [2025-01-08 22:32:21,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:32:21,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:32:21,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:32:21,014 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-01-08 22:32:21,016 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-01-08 22:32:21,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 7 equivalence classes. [2025-01-08 22:32:21,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 57 of 57 statements. [2025-01-08 22:32:21,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-08 22:32:21,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:21,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-01-08 22:32:21,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:32:22,005 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-01-08 22:32:22,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:32:22,248 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2025-01-08 22:32:22,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2025-01-08 22:32:22,344 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2025-01-08 22:32:22,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 44 [2025-01-08 22:32:23,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:23,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:23,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:24,195 INFO L349 Elim1Store]: treesize reduction 508, result has 25.0 percent of original size [2025-01-08 22:32:24,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 5 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 78 case distinctions, treesize of input 122 treesize of output 220 [2025-01-08 22:32:26,813 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 166 treesize of output 144 [2025-01-08 22:32:26,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:26,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:26,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:26,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:26,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:26,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:26,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:26,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:26,925 INFO L349 Elim1Store]: treesize reduction 297, result has 0.3 percent of original size [2025-01-08 22:32:26,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 144 treesize of output 242 [2025-01-08 22:32:27,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:27,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:27,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:27,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:27,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:27,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:27,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:27,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:27,307 INFO L349 Elim1Store]: treesize reduction 183, result has 42.5 percent of original size [2025-01-08 22:32:27,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 159 treesize of output 213 [2025-01-08 22:32:30,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:32:30,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 156 treesize of output 106 [2025-01-08 22:32:31,190 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:32:31,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:32:33,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:32:33,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509670463] [2025-01-08 22:32:33,653 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-08 22:32:33,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830529073] [2025-01-08 22:32:33,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830529073] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:32:33,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:32:33,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2025-01-08 22:32:33,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717724692] [2025-01-08 22:32:33,654 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-08 22:32:33,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-08 22:32:33,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:32:33,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-08 22:32:33,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=2690, Unknown=0, NotChecked=0, Total=2970 [2025-01-08 22:32:33,657 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 33 states have internal predecessors, (47), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-08 22:32:36,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:32:36,946 INFO L93 Difference]: Finished difference Result 137 states and 176 transitions. [2025-01-08 22:32:36,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-08 22:32:36,947 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 33 states have internal predecessors, (47), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 57 [2025-01-08 22:32:36,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:32:36,948 INFO L225 Difference]: With dead ends: 137 [2025-01-08 22:32:36,948 INFO L226 Difference]: Without dead ends: 98 [2025-01-08 22:32:36,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1644 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=396, Invalid=4026, Unknown=0, NotChecked=0, Total=4422 [2025-01-08 22:32:36,951 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 61 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:32:36,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 501 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 22:32:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-08 22:32:36,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2025-01-08 22:32:36,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 71 states have internal predecessors, (87), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-08 22:32:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2025-01-08 22:32:36,976 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 57 [2025-01-08 22:32:36,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:32:36,977 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2025-01-08 22:32:36,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 33 states have internal predecessors, (47), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-08 22:32:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2025-01-08 22:32:36,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-08 22:32:36,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:32:36,980 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:32:36,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:32:37,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:32:37,181 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:32:37,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:32:37,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1227461115, now seen corresponding path program 1 times [2025-01-08 22:32:37,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:32:37,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94065771] [2025-01-08 22:32:37,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:32:37,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:32:37,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-08 22:32:37,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-08 22:32:37,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:32:37,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-08 22:32:37,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:32:37,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94065771] [2025-01-08 22:32:37,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94065771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:32:37,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:32:37,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:32:37,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339726658] [2025-01-08 22:32:37,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:32:37,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:32:37,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:32:37,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:32:37,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:32:37,266 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-08 22:32:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:32:37,295 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2025-01-08 22:32:37,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:32:37,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2025-01-08 22:32:37,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:32:37,298 INFO L225 Difference]: With dead ends: 124 [2025-01-08 22:32:37,298 INFO L226 Difference]: Without dead ends: 91 [2025-01-08 22:32:37,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:32:37,299 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:32:37,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:32:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-08 22:32:37,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-08 22:32:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 74 states have internal predecessors, (89), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2025-01-08 22:32:37,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2025-01-08 22:32:37,325 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 57 [2025-01-08 22:32:37,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:32:37,325 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2025-01-08 22:32:37,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-01-08 22:32:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2025-01-08 22:32:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-08 22:32:37,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:32:37,327 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:32:37,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:32:37,327 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:32:37,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:32:37,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1753035771, now seen corresponding path program 1 times [2025-01-08 22:32:37,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:32:37,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804438281] [2025-01-08 22:32:37,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:32:37,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:32:37,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-08 22:32:37,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-08 22:32:37,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:32:37,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-08 22:32:37,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:32:37,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804438281] [2025-01-08 22:32:37,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804438281] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:32:37,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486828723] [2025-01-08 22:32:37,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:32:37,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:32:37,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:32:37,401 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-01-08 22:32:37,405 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-01-08 22:32:37,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-08 22:32:37,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-08 22:32:37,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:32:37,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:37,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:32:37,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:32:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-08 22:32:37,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:32:37,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486828723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:32:37,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:32:37,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-08 22:32:37,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154042398] [2025-01-08 22:32:37,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:32:37,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:32:37,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:32:37,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:32:37,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:32:37,505 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-08 22:32:37,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:32:37,535 INFO L93 Difference]: Finished difference Result 130 states and 158 transitions. [2025-01-08 22:32:37,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:32:37,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2025-01-08 22:32:37,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:32:37,539 INFO L225 Difference]: With dead ends: 130 [2025-01-08 22:32:37,539 INFO L226 Difference]: Without dead ends: 93 [2025-01-08 22:32:37,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:32:37,539 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:32:37,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:32:37,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-08 22:32:37,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-08 22:32:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 75 states have internal predecessors, (90), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2025-01-08 22:32:37,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2025-01-08 22:32:37,568 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 57 [2025-01-08 22:32:37,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:32:37,569 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2025-01-08 22:32:37,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-08 22:32:37,569 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2025-01-08 22:32:37,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-08 22:32:37,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:32:37,572 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:32:37,580 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-01-08 22:32:37,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-08 22:32:37,776 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:32:37,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:32:37,776 INFO L85 PathProgramCache]: Analyzing trace with hash -651149453, now seen corresponding path program 4 times [2025-01-08 22:32:37,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:32:37,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757243892] [2025-01-08 22:32:37,776 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:32:37,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:32:37,784 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-01-08 22:32:37,792 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 51 of 58 statements. [2025-01-08 22:32:37,792 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-08 22:32:37,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:37,926 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 22:32:37,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:32:37,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757243892] [2025-01-08 22:32:37,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757243892] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:32:37,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660507214] [2025-01-08 22:32:37,927 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:32:37,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:32:37,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:32:37,930 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-01-08 22:32:37,932 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-01-08 22:32:37,977 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-01-08 22:32:37,996 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 51 of 58 statements. [2025-01-08 22:32:37,996 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-08 22:32:37,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:37,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:32:37,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:32:38,039 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-08 22:32:38,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:32:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 22:32:38,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660507214] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:32:38,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:32:38,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-01-08 22:32:38,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821534937] [2025-01-08 22:32:38,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:32:38,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-08 22:32:38,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:32:38,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-08 22:32:38,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:32:38,091 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-08 22:32:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:32:38,316 INFO L93 Difference]: Finished difference Result 213 states and 257 transitions. [2025-01-08 22:32:38,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-08 22:32:38,317 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2025-01-08 22:32:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:32:38,318 INFO L225 Difference]: With dead ends: 213 [2025-01-08 22:32:38,318 INFO L226 Difference]: Without dead ends: 168 [2025-01-08 22:32:38,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:32:38,319 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:32:38,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 387 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:32:38,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-08 22:32:38,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 149. [2025-01-08 22:32:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 118 states have (on average 1.1779661016949152) internal successors, (139), 117 states have internal predecessors, (139), 17 states have call successors, (17), 11 states have call predecessors, (17), 13 states have return successors, (21), 20 states have call predecessors, (21), 17 states have call successors, (21) [2025-01-08 22:32:38,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 177 transitions. [2025-01-08 22:32:38,369 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 177 transitions. Word has length 58 [2025-01-08 22:32:38,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:32:38,369 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 177 transitions. [2025-01-08 22:32:38,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-08 22:32:38,370 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 177 transitions. [2025-01-08 22:32:38,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-08 22:32:38,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:32:38,373 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:32:38,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-08 22:32:38,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-08 22:32:38,573 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:32:38,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:32:38,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1622569956, now seen corresponding path program 5 times [2025-01-08 22:32:38,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:32:38,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472462065] [2025-01-08 22:32:38,574 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:32:38,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:32:38,582 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 7 equivalence classes. [2025-01-08 22:32:38,590 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 23 of 58 statements. [2025-01-08 22:32:38,591 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-08 22:32:38,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-08 22:32:38,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:32:38,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472462065] [2025-01-08 22:32:38,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472462065] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:32:38,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98384337] [2025-01-08 22:32:38,668 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:32:38,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:32:38,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:32:38,671 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:32:38,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-08 22:32:38,718 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 7 equivalence classes. [2025-01-08 22:32:38,741 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 23 of 58 statements. [2025-01-08 22:32:38,741 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-01-08 22:32:38,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:38,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:32:38,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:32:38,822 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-08 22:32:38,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:32:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-08 22:32:38,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98384337] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:32:38,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:32:38,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-01-08 22:32:38,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308122450] [2025-01-08 22:32:38,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:32:38,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-08 22:32:38,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:32:38,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-08 22:32:38,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:32:38,888 INFO L87 Difference]: Start difference. First operand 149 states and 177 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-08 22:32:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:32:39,036 INFO L93 Difference]: Finished difference Result 200 states and 237 transitions. [2025-01-08 22:32:39,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-08 22:32:39,037 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2025-01-08 22:32:39,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:32:39,038 INFO L225 Difference]: With dead ends: 200 [2025-01-08 22:32:39,038 INFO L226 Difference]: Without dead ends: 128 [2025-01-08 22:32:39,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 107 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:32:39,039 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:32:39,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 185 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:32:39,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-08 22:32:39,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2025-01-08 22:32:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 99 states have internal predecessors, (117), 13 states have call successors, (13), 8 states have call predecessors, (13), 10 states have return successors, (17), 17 states have call predecessors, (17), 13 states have call successors, (17) [2025-01-08 22:32:39,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 147 transitions. [2025-01-08 22:32:39,071 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 147 transitions. Word has length 58 [2025-01-08 22:32:39,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:32:39,072 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 147 transitions. [2025-01-08 22:32:39,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-08 22:32:39,072 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 147 transitions. [2025-01-08 22:32:39,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-08 22:32:39,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:32:39,073 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:32:39,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-08 22:32:39,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-08 22:32:39,273 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:32:39,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:32:39,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1315493445, now seen corresponding path program 6 times [2025-01-08 22:32:39,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:32:39,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603227735] [2025-01-08 22:32:39,274 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:32:39,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:32:39,284 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 61 statements into 8 equivalence classes. [2025-01-08 22:32:39,334 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 61 of 61 statements. [2025-01-08 22:32:39,334 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-01-08 22:32:39,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 19 proven. 24 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-08 22:32:39,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:32:39,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603227735] [2025-01-08 22:32:39,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603227735] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:32:39,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347493208] [2025-01-08 22:32:39,458 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:32:39,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:32:39,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:32:39,460 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:32:39,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-08 22:32:39,515 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 61 statements into 8 equivalence classes. [2025-01-08 22:32:40,139 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 61 of 61 statements. [2025-01-08 22:32:40,139 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-01-08 22:32:40,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:40,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:32:40,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:32:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 29 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-08 22:32:40,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:32:40,313 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-08 22:32:40,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347493208] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:32:40,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:32:40,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-01-08 22:32:40,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387725046] [2025-01-08 22:32:40,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:32:40,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-08 22:32:40,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:32:40,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-08 22:32:40,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:32:40,314 INFO L87 Difference]: Start difference. First operand 125 states and 147 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-08 22:32:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:32:40,569 INFO L93 Difference]: Finished difference Result 140 states and 163 transitions. [2025-01-08 22:32:40,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-08 22:32:40,570 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2025-01-08 22:32:40,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:32:40,571 INFO L225 Difference]: With dead ends: 140 [2025-01-08 22:32:40,572 INFO L226 Difference]: Without dead ends: 137 [2025-01-08 22:32:40,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 117 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=594, Unknown=0, NotChecked=0, Total=812 [2025-01-08 22:32:40,573 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 30 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:32:40,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 182 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:32:40,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-08 22:32:40,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2025-01-08 22:32:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 104 states have internal predecessors, (123), 13 states have call successors, (13), 8 states have call predecessors, (13), 10 states have return successors, (17), 17 states have call predecessors, (17), 13 states have call successors, (17) [2025-01-08 22:32:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 153 transitions. [2025-01-08 22:32:40,605 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 153 transitions. Word has length 61 [2025-01-08 22:32:40,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:32:40,606 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 153 transitions. [2025-01-08 22:32:40,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-08 22:32:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 153 transitions. [2025-01-08 22:32:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-08 22:32:40,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:32:40,607 INFO L218 NwaCegarLoop]: trace histogram [9, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:32:40,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-08 22:32:40,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:32:40,807 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:32:40,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:32:40,808 INFO L85 PathProgramCache]: Analyzing trace with hash 762996978, now seen corresponding path program 7 times [2025-01-08 22:32:40,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:32:40,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164680023] [2025-01-08 22:32:40,808 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-08 22:32:40,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:32:40,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-08 22:32:40,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-08 22:32:40,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:32:40,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-08 22:32:40,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:32:40,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164680023] [2025-01-08 22:32:40,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164680023] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:32:40,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094167428] [2025-01-08 22:32:40,960 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-08 22:32:40,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:32:40,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:32:40,962 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:32:40,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-08 22:32:41,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-08 22:32:41,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-08 22:32:41,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:32:41,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:41,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:32:41,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:32:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-01-08 22:32:41,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:32:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-08 22:32:41,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094167428] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:32:41,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:32:41,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-01-08 22:32:41,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895443898] [2025-01-08 22:32:41,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:32:41,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-08 22:32:41,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:32:41,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-08 22:32:41,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-01-08 22:32:41,220 INFO L87 Difference]: Start difference. First operand 130 states and 153 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-08 22:32:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:32:41,419 INFO L93 Difference]: Finished difference Result 189 states and 226 transitions. [2025-01-08 22:32:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-08 22:32:41,420 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2025-01-08 22:32:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:32:41,421 INFO L225 Difference]: With dead ends: 189 [2025-01-08 22:32:41,421 INFO L226 Difference]: Without dead ends: 143 [2025-01-08 22:32:41,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-01-08 22:32:41,422 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 22 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:32:41,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 274 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:32:41,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-08 22:32:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2025-01-08 22:32:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 111 states have (on average 1.162162162162162) internal successors, (129), 109 states have internal predecessors, (129), 13 states have call successors, (13), 8 states have call predecessors, (13), 10 states have return successors, (17), 17 states have call predecessors, (17), 13 states have call successors, (17) [2025-01-08 22:32:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2025-01-08 22:32:41,466 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 66 [2025-01-08 22:32:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:32:41,466 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2025-01-08 22:32:41,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-08 22:32:41,466 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2025-01-08 22:32:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-08 22:32:41,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:32:41,469 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:32:41,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-08 22:32:41,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:32:41,670 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:32:41,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:32:41,670 INFO L85 PathProgramCache]: Analyzing trace with hash -359945720, now seen corresponding path program 8 times [2025-01-08 22:32:41,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:32:41,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311580349] [2025-01-08 22:32:41,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:32:41,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:32:41,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-01-08 22:32:41,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-01-08 22:32:41,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:32:41,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-08 22:32:41,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [579856340] [2025-01-08 22:32:41,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:32:41,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:32:41,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:32:41,707 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:32:41,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-08 22:32:41,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-01-08 22:32:43,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-01-08 22:32:43,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:32:43,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:32:43,057 WARN L254 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 178 conjuncts are in the unsatisfiable core [2025-01-08 22:32:43,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:32:43,109 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-01-08 22:32:43,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-08 22:32:43,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:32:43,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-01-08 22:32:43,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:32:43,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2025-01-08 22:32:43,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:32:43,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 54 [2025-01-08 22:32:43,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:32:43,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 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-01-08 22:32:43,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:32:43,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 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-01-08 22:32:43,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:32:43,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 77 treesize of output 94 [2025-01-08 22:32:43,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:43,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:32:43,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 88 treesize of output 108 [2025-01-08 22:32:45,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:45,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:45,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:45,272 INFO L349 Elim1Store]: treesize reduction 336, result has 31.8 percent of original size [2025-01-08 22:32:45,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 39 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 165 case distinctions, treesize of input 144 treesize of output 266 [2025-01-08 22:32:48,339 INFO L349 Elim1Store]: treesize reduction 192, result has 34.9 percent of original size [2025-01-08 22:32:48,340 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 27 case distinctions, treesize of input 592 treesize of output 554 [2025-01-08 22:32:52,111 INFO L349 Elim1Store]: treesize reduction 389, result has 0.3 percent of original size [2025-01-08 22:32:52,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 12 select indices, 12 select index equivalence classes, 49 disjoint index pairs (out of 66 index pairs), introduced 18 new quantified variables, introduced 30 case distinctions, treesize of input 717 treesize of output 1215 [2025-01-08 22:32:55,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 37 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 95 [2025-01-08 22:32:55,517 INFO L349 Elim1Store]: treesize reduction 420, result has 6.9 percent of original size [2025-01-08 22:32:55,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 12 select indices, 12 select index equivalence classes, 52 disjoint index pairs (out of 66 index pairs), introduced 16 new quantified variables, introduced 32 case distinctions, treesize of input 641 treesize of output 945 [2025-01-08 22:32:56,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:56,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:56,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:56,719 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-08 22:32:56,727 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-08 22:32:56,737 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-08 22:32:56,739 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-08 22:32:56,742 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-08 22:32:56,746 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-08 22:32:56,972 INFO L349 Elim1Store]: treesize reduction 323, result has 13.4 percent of original size [2025-01-08 22:32:56,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 12 select indices, 12 select index equivalence classes, 52 disjoint index pairs (out of 66 index pairs), introduced 14 new quantified variables, introduced 34 case distinctions, treesize of input 696 treesize of output 980 [2025-01-08 22:33:00,792 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2025-01-08 22:33:00,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 37 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 1038 treesize of output 1046 [2025-01-08 22:33:01,714 INFO L349 Elim1Store]: treesize reduction 112, result has 11.8 percent of original size [2025-01-08 22:33:01,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 41 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 102 treesize of output 106 [2025-01-08 22:33:23,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:33:23,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 1491 treesize of output 1937 [2025-01-08 22:33:33,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:33:33,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 36 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 30 case distinctions, treesize of input 349 treesize of output 299 [2025-01-08 22:33:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 8 proven. 151 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:33:35,229 INFO L312 TraceCheckSpWp]: Computing backward predicates...