./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-c00e63d-m [2025-02-05 10:22:14,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:22:14,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:22:14,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:22:14,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:22:14,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:22:14,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:22:14,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:22:14,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:22:14,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:22:14,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:22:14,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:22:14,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:22:14,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:22:14,780 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:22:14,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:22:14,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:22:14,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:22:14,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:22:14,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:22:14,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:22:14,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:22:14,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:22:14,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:22:14,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:22:14,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:22:14,780 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:22:14,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:22:14,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:22:14,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:22:14,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:22:14,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:22:14,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:22:14,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:22:14,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:22:14,781 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:22:14,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:22:14,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:22:14,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:22:14,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:22:14,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:22:14,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:22:14,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:22:14,781 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-02-05 10:22:14,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:22:14,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:22:14,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:22:14,997 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:22:14,997 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:22:14,998 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-02-05 10:22:16,141 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8369b45cc/866ff519726742ada236cb673cf4b20b/FLAG1f6f37fae [2025-02-05 10:22:16,403 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:22:16,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array22_pattern.c [2025-02-05 10:22:16,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8369b45cc/866ff519726742ada236cb673cf4b20b/FLAG1f6f37fae [2025-02-05 10:22:16,434 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8369b45cc/866ff519726742ada236cb673cf4b20b [2025-02-05 10:22:16,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:22:16,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:22:16,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:22:16,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:22:16,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:22:16,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:22:16" (1/1) ... [2025-02-05 10:22:16,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8c171b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:16, skipping insertion in model container [2025-02-05 10:22:16,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:22:16" (1/1) ... [2025-02-05 10:22:16,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:22:16,550 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-02-05 10:22:16,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:22:16,575 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:22:16,583 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-02-05 10:22:16,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:22:16,602 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:22:16,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:16 WrapperNode [2025-02-05 10:22:16,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:22:16,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:22:16,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:22:16,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:22:16,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:16" (1/1) ... [2025-02-05 10:22:16,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:16" (1/1) ... [2025-02-05 10:22:16,628 INFO L138 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2025-02-05 10:22:16,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:22:16,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:22:16,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:22:16,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:22:16,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:16" (1/1) ... [2025-02-05 10:22:16,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:16" (1/1) ... [2025-02-05 10:22:16,639 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:16" (1/1) ... [2025-02-05 10:22:16,649 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-02-05 10:22:16,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:16" (1/1) ... [2025-02-05 10:22:16,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:16" (1/1) ... [2025-02-05 10:22:16,654 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:16" (1/1) ... [2025-02-05 10:22:16,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:16" (1/1) ... [2025-02-05 10:22:16,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:16" (1/1) ... [2025-02-05 10:22:16,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:16" (1/1) ... [2025-02-05 10:22:16,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:22:16,664 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:22:16,664 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:22:16,664 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:22:16,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:16" (1/1) ... [2025-02-05 10:22:16,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:22:16,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:16,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:22:16,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:22:16,707 INFO L130 BoogieDeclarations]: Found specification of procedure outerBoundaryPatternCheck [2025-02-05 10:22:16,707 INFO L138 BoogieDeclarations]: Found implementation of procedure outerBoundaryPatternCheck [2025-02-05 10:22:16,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:22:16,708 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 10:22:16,708 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 10:22:16,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:22:16,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:22:16,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 10:22:16,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:22:16,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:22:16,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:22:16,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:22:16,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:22:16,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:22:16,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 10:22:16,769 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:22:16,770 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:22:16,906 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L52: call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2025-02-05 10:22:16,919 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-02-05 10:22:16,919 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:22:16,924 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:22:16,925 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:22:16,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:22:16 BoogieIcfgContainer [2025-02-05 10:22:16,925 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:22:16,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:22:16,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:22:16,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:22:16,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:22:16" (1/3) ... [2025-02-05 10:22:16,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af5ea97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:22:16, skipping insertion in model container [2025-02-05 10:22:16,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:22:16" (2/3) ... [2025-02-05 10:22:16,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af5ea97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:22:16, skipping insertion in model container [2025-02-05 10:22:16,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:22:16" (3/3) ... [2025-02-05 10:22:16,932 INFO L128 eAbstractionObserver]: Analyzing ICFG array22_pattern.c [2025-02-05 10:22:16,941 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:22:16,945 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-02-05 10:22:16,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:22:16,995 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;@714035da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:22:16,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:22:16,998 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-02-05 10:22:17,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 10:22:17,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:17,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:17,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:17,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:17,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1959484098, now seen corresponding path program 1 times [2025-02-05 10:22:17,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:17,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370944544] [2025-02-05 10:22:17,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:17,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:17,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 10:22:17,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 10:22:17,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:17,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:22:17,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:17,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370944544] [2025-02-05 10:22:17,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370944544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:22:17,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:22:17,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:22:17,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755877878] [2025-02-05 10:22:17,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:22:17,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 10:22:17,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:17,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 10:22:17,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:22:17,126 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-02-05 10:22:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:17,141 INFO L93 Difference]: Finished difference Result 69 states and 97 transitions. [2025-02-05 10:22:17,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 10:22:17,144 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-02-05 10:22:17,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:17,148 INFO L225 Difference]: With dead ends: 69 [2025-02-05 10:22:17,148 INFO L226 Difference]: Without dead ends: 32 [2025-02-05 10:22:17,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:22:17,152 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-02-05 10:22:17,154 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-02-05 10:22:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-05 10:22:17,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-05 10:22:17,175 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-02-05 10:22:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-02-05 10:22:17,179 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 14 [2025-02-05 10:22:17,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:17,179 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-02-05 10:22:17,180 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-02-05 10:22:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2025-02-05 10:22:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 10:22:17,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:17,181 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-02-05 10:22:17,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:22:17,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:17,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:17,182 INFO L85 PathProgramCache]: Analyzing trace with hash -634911244, now seen corresponding path program 1 times [2025-02-05 10:22:17,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:17,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792928693] [2025-02-05 10:22:17,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:17,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:17,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 10:22:17,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 10:22:17,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:17,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:22:17,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:17,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792928693] [2025-02-05 10:22:17,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792928693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:22:17,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:22:17,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:22:17,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487133178] [2025-02-05 10:22:17,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:22:17,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:22:17,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:17,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:22:17,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:22:17,444 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-02-05 10:22:17,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:17,467 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2025-02-05 10:22:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:22:17,468 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-02-05 10:22:17,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:17,468 INFO L225 Difference]: With dead ends: 37 [2025-02-05 10:22:17,468 INFO L226 Difference]: Without dead ends: 34 [2025-02-05 10:22:17,469 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-02-05 10:22:17,469 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-02-05 10:22:17,469 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-02-05 10:22:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-05 10:22:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-05 10:22:17,473 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-02-05 10:22:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-02-05 10:22:17,474 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 41 [2025-02-05 10:22:17,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:17,475 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-02-05 10:22:17,475 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-02-05 10:22:17,476 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-02-05 10:22:17,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 10:22:17,477 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:17,477 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-02-05 10:22:17,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:22:17,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:17,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:17,479 INFO L85 PathProgramCache]: Analyzing trace with hash 484814132, now seen corresponding path program 1 times [2025-02-05 10:22:17,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:17,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454397440] [2025-02-05 10:22:17,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:17,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:17,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 10:22:17,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:22:17,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:17,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:17,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 10:22:17,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:17,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454397440] [2025-02-05 10:22:17,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454397440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:22:17,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:22:17,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:22:17,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832415712] [2025-02-05 10:22:17,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:22:17,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:22:17,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:17,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:22:17,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:22:17,656 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-02-05 10:22:17,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:17,736 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2025-02-05 10:22:17,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:22:17,737 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-02-05 10:22:17,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:17,738 INFO L225 Difference]: With dead ends: 68 [2025-02-05 10:22:17,739 INFO L226 Difference]: Without dead ends: 39 [2025-02-05 10:22:17,739 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-02-05 10:22:17,739 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-02-05 10:22:17,740 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-02-05 10:22:17,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-05 10:22:17,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2025-02-05 10:22:17,743 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-02-05 10:22:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2025-02-05 10:22:17,744 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 44 [2025-02-05 10:22:17,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:17,744 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2025-02-05 10:22:17,744 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-02-05 10:22:17,744 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2025-02-05 10:22:17,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 10:22:17,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:17,745 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-02-05 10:22:17,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:22:17,745 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:17,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:17,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1011701486, now seen corresponding path program 1 times [2025-02-05 10:22:17,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:17,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083304006] [2025-02-05 10:22:17,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:17,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:17,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 10:22:17,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 10:22:17,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:17,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 10:22:17,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:17,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083304006] [2025-02-05 10:22:17,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083304006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:22:17,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:22:17,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:22:17,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982464253] [2025-02-05 10:22:17,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:22:17,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:22:17,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:17,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:22:17,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:22:17,842 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-02-05 10:22:17,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:17,892 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2025-02-05 10:22:17,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:22:17,893 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-02-05 10:22:17,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:17,893 INFO L225 Difference]: With dead ends: 68 [2025-02-05 10:22:17,894 INFO L226 Difference]: Without dead ends: 38 [2025-02-05 10:22:17,895 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-02-05 10:22:17,895 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:17,895 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.0s Time] [2025-02-05 10:22:17,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-05 10:22:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-02-05 10:22:17,902 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-02-05 10:22:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2025-02-05 10:22:17,902 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 46 [2025-02-05 10:22:17,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:17,903 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2025-02-05 10:22:17,903 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-02-05 10:22:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2025-02-05 10:22:17,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 10:22:17,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:17,905 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-02-05 10:22:17,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:22:17,905 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:17,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:17,906 INFO L85 PathProgramCache]: Analyzing trace with hash 808191946, now seen corresponding path program 1 times [2025-02-05 10:22:17,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:17,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395639434] [2025-02-05 10:22:17,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:17,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:17,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 10:22:17,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:22:17,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:17,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:22:18,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:18,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395639434] [2025-02-05 10:22:18,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395639434] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:18,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403399252] [2025-02-05 10:22:18,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:18,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:18,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:18,056 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:22:18,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 10:22:18,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 10:22:18,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:22:18,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:18,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:18,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 10:22:18,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:22:18,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:22:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:22:18,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403399252] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:22:18,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:22:18,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-05 10:22:18,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736029974] [2025-02-05 10:22:18,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:22:18,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 10:22:18,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:18,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 10:22:18,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:22:18,298 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-02-05 10:22:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:18,440 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2025-02-05 10:22:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:22:18,443 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-02-05 10:22:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:18,443 INFO L225 Difference]: With dead ends: 74 [2025-02-05 10:22:18,443 INFO L226 Difference]: Without dead ends: 44 [2025-02-05 10:22:18,444 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-02-05 10:22:18,444 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-02-05 10:22:18,444 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-02-05 10:22:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-05 10:22:18,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-02-05 10:22:18,451 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-02-05 10:22:18,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-02-05 10:22:18,451 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 47 [2025-02-05 10:22:18,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:18,452 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-02-05 10:22:18,452 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-02-05 10:22:18,452 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-02-05 10:22:18,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 10:22:18,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:18,455 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-02-05 10:22:18,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:22:18,660 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-02-05 10:22:18,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:18,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:18,661 INFO L85 PathProgramCache]: Analyzing trace with hash 151000504, now seen corresponding path program 2 times [2025-02-05 10:22:18,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:18,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94245793] [2025-02-05 10:22:18,662 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:22:18,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:18,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-05 10:22:18,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 10:22:18,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:22:18,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 10:22:18,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:18,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94245793] [2025-02-05 10:22:18,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94245793] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:18,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736808014] [2025-02-05 10:22:18,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:22:18,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:18,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:18,835 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:22:18,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 10:22:18,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-02-05 10:22:18,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 10:22:18,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:22:18,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:18,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 10:22:18,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 10:22:19,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:22:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 10:22:19,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736808014] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:22:19,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:22:19,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-05 10:22:19,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603989711] [2025-02-05 10:22:19,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:22:19,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 10:22:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:19,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 10:22:19,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:22:19,085 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-02-05 10:22:19,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:19,255 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2025-02-05 10:22:19,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 10:22:19,256 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-02-05 10:22:19,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:19,256 INFO L225 Difference]: With dead ends: 85 [2025-02-05 10:22:19,256 INFO L226 Difference]: Without dead ends: 56 [2025-02-05 10:22:19,257 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-02-05 10:22:19,257 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:19,257 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.1s Time] [2025-02-05 10:22:19,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-05 10:22:19,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2025-02-05 10:22:19,267 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-02-05 10:22:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2025-02-05 10:22:19,269 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 49 [2025-02-05 10:22:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:19,269 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2025-02-05 10:22:19,269 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-02-05 10:22:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2025-02-05 10:22:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:22:19,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:19,272 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-02-05 10:22:19,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 10:22:19,477 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-02-05 10:22:19,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:19,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:19,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2019860860, now seen corresponding path program 3 times [2025-02-05 10:22:19,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:19,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388147570] [2025-02-05 10:22:19,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:22:19,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:19,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 7 equivalence classes. [2025-02-05 10:22:19,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:19,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-05 10:22:19,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:22:19,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [88746453] [2025-02-05 10:22:19,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:22:19,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:19,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:19,544 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:22:19,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 10:22:19,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 7 equivalence classes. [2025-02-05 10:22:20,217 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:20,217 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-05 10:22:20,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:20,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-02-05 10:22:20,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:20,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:22:20,367 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-02-05 10:22:20,494 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2025-02-05 10:22:20,495 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-02-05 10:22:20,559 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2025-02-05 10:22:20,560 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-02-05 10:22:21,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:21,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:21,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:21,604 INFO L349 Elim1Store]: treesize reduction 266, result has 30.9 percent of original size [2025-02-05 10:22:21,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 88 treesize of output 158 [2025-02-05 10:22:28,279 INFO L349 Elim1Store]: treesize reduction 192, result has 34.9 percent of original size [2025-02-05 10:22:28,280 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 468 treesize of output 500 [2025-02-05 10:22:32,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:32,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:32,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:32,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:32,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:32,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:32,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:32,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:32,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:32,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:32,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:32,066 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:22:32,197 INFO L349 Elim1Store]: treesize reduction 370, result has 5.6 percent of original size [2025-02-05 10:22:32,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 18 case distinctions, treesize of input 693 treesize of output 890 [2025-02-05 10:22:33,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,318 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:22:33,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 65 [2025-02-05 10:22:33,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,334 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:22:33,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,380 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:22:33,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:33,744 INFO L349 Elim1Store]: treesize reduction 775, result has 7.5 percent of original size [2025-02-05 10:22:33,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 23 case distinctions, treesize of input 384 treesize of output 666 [2025-02-05 10:22:34,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:34,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:34,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:34,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:34,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:34,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:34,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:34,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:34,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:34,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:34,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:34,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:34,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:34,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:34,585 INFO L349 Elim1Store]: treesize reduction 162, result has 32.8 percent of original size [2025-02-05 10:22:34,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 204 treesize of output 196 [2025-02-05 10:22:37,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 213 [2025-02-05 10:22:37,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:37,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:37,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:37,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:22:37,839 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-02-05 10:22:37,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 1 [2025-02-05 10:22:37,848 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-02-05 10:22:37,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1 [2025-02-05 10:22:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:22:38,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:22:40,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:40,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388147570] [2025-02-05 10:22:40,058 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 10:22:40,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88746453] [2025-02-05 10:22:40,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88746453] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:40,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:22:40,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2025-02-05 10:22:40,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428009154] [2025-02-05 10:22:40,058 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 10:22:40,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 10:22:40,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:40,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 10:22:40,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=2588, Unknown=1, NotChecked=0, Total=2862 [2025-02-05 10:22:40,063 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), 34 states have internal predecessors, (47), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-05 10:22:45,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-05 10:22:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:46,842 INFO L93 Difference]: Finished difference Result 119 states and 149 transitions. [2025-02-05 10:22:46,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-05 10:22:46,843 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 57 [2025-02-05 10:22:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:46,844 INFO L225 Difference]: With dead ends: 119 [2025-02-05 10:22:46,844 INFO L226 Difference]: Without dead ends: 110 [2025-02-05 10:22:46,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1417 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=320, Invalid=3219, Unknown=1, NotChecked=0, Total=3540 [2025-02-05 10:22:46,846 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 72 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:46,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 467 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1230 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2025-02-05 10:22:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-05 10:22:46,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 94. [2025-02-05 10:22:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-02-05 10:22:46,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2025-02-05 10:22:46,864 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 57 [2025-02-05 10:22:46,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:46,864 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2025-02-05 10:22:46,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-05 10:22:46,864 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2025-02-05 10:22:46,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:22:46,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:46,865 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-02-05 10:22:46,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 10:22:47,066 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-02-05 10:22:47,066 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:47,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:47,066 INFO L85 PathProgramCache]: Analyzing trace with hash -767554627, now seen corresponding path program 1 times [2025-02-05 10:22:47,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:47,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800878656] [2025-02-05 10:22:47,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:47,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:47,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:47,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:47,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:47,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 10:22:47,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:47,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800878656] [2025-02-05 10:22:47,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800878656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:22:47,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:22:47,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:22:47,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655893614] [2025-02-05 10:22:47,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:22:47,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:22:47,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:47,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:22:47,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:22:47,144 INFO L87 Difference]: Start difference. First operand 94 states and 114 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-02-05 10:22:47,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:47,169 INFO L93 Difference]: Finished difference Result 133 states and 163 transitions. [2025-02-05 10:22:47,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:22:47,169 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-02-05 10:22:47,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:47,172 INFO L225 Difference]: With dead ends: 133 [2025-02-05 10:22:47,172 INFO L226 Difference]: Without dead ends: 100 [2025-02-05 10:22:47,172 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-02-05 10:22:47,173 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-02-05 10:22:47,173 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-02-05 10:22:47,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-05 10:22:47,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2025-02-05 10:22:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 9 states have call successors, (9), 7 states have call predecessors, (9), 9 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-05 10:22:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2025-02-05 10:22:47,198 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 57 [2025-02-05 10:22:47,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:47,198 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2025-02-05 10:22:47,198 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-02-05 10:22:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2025-02-05 10:22:47,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:22:47,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:47,201 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:47,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:22:47,201 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:47,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:47,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1175388989, now seen corresponding path program 1 times [2025-02-05 10:22:47,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:47,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916745340] [2025-02-05 10:22:47,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:47,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:47,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:47,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:47,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:47,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 10:22:47,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:47,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916745340] [2025-02-05 10:22:47,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916745340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:22:47,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:22:47,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:22:47,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040355562] [2025-02-05 10:22:47,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:22:47,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:22:47,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:47,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:22:47,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:22:47,257 INFO L87 Difference]: Start difference. First operand 98 states and 118 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-02-05 10:22:47,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:47,281 INFO L93 Difference]: Finished difference Result 137 states and 166 transitions. [2025-02-05 10:22:47,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:22:47,282 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-02-05 10:22:47,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:47,283 INFO L225 Difference]: With dead ends: 137 [2025-02-05 10:22:47,284 INFO L226 Difference]: Without dead ends: 100 [2025-02-05 10:22:47,284 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-02-05 10:22:47,285 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 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-02-05 10:22:47,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:22:47,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-05 10:22:47,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2025-02-05 10:22:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.2151898734177216) internal successors, (96), 80 states have internal predecessors, (96), 9 states have call successors, (9), 7 states have call predecessors, (9), 9 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-05 10:22:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2025-02-05 10:22:47,308 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 57 [2025-02-05 10:22:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:47,308 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2025-02-05 10:22:47,308 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-02-05 10:22:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2025-02-05 10:22:47,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:22:47,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:47,309 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:47,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:22:47,309 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:47,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:47,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1612026498, now seen corresponding path program 1 times [2025-02-05 10:22:47,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:47,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131007574] [2025-02-05 10:22:47,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:47,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:47,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:47,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:47,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:47,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 10:22:47,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:47,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131007574] [2025-02-05 10:22:47,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131007574] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:47,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021884774] [2025-02-05 10:22:47,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:47,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:47,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:47,458 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:22:47,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 10:22:47,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:47,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:47,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:47,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:47,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 10:22:47,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 10:22:47,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:22:47,747 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-05 10:22:47,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021884774] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:22:47,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:22:47,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 7] total 16 [2025-02-05 10:22:47,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552747556] [2025-02-05 10:22:47,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:22:47,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 10:22:47,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:47,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 10:22:47,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:22:47,749 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 10:22:48,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:48,025 INFO L93 Difference]: Finished difference Result 210 states and 263 transitions. [2025-02-05 10:22:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 10:22:48,025 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 57 [2025-02-05 10:22:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:48,026 INFO L225 Difference]: With dead ends: 210 [2025-02-05 10:22:48,026 INFO L226 Difference]: Without dead ends: 171 [2025-02-05 10:22:48,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-02-05 10:22:48,027 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 29 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:48,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 253 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:22:48,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-05 10:22:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2025-02-05 10:22:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.211111111111111) internal successors, (109), 90 states have internal predecessors, (109), 11 states have call successors, (11), 9 states have call predecessors, (11), 10 states have return successors, (15), 12 states have call predecessors, (15), 11 states have call successors, (15) [2025-02-05 10:22:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2025-02-05 10:22:48,058 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 57 [2025-02-05 10:22:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:48,058 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2025-02-05 10:22:48,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 4 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 10:22:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2025-02-05 10:22:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:22:48,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:48,059 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-02-05 10:22:48,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 10:22:48,259 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,SelfDestructingSolverStorable9 [2025-02-05 10:22:48,260 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:48,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:48,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1030341955, now seen corresponding path program 1 times [2025-02-05 10:22:48,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:48,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823739935] [2025-02-05 10:22:48,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:48,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:48,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:48,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:48,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:48,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:48,320 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 10:22:48,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:48,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823739935] [2025-02-05 10:22:48,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823739935] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:48,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32846628] [2025-02-05 10:22:48,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:48,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:48,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:48,322 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:22:48,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 10:22:48,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:48,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:48,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:48,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:48,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:22:48,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 10:22:48,403 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:22:48,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32846628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:22:48,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:22:48,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-05 10:22:48,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121882971] [2025-02-05 10:22:48,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:22:48,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:22:48,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:48,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:22:48,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:22:48,406 INFO L87 Difference]: Start difference. First operand 112 states and 135 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-02-05 10:22:48,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:48,430 INFO L93 Difference]: Finished difference Result 155 states and 188 transitions. [2025-02-05 10:22:48,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:22:48,431 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-02-05 10:22:48,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:48,432 INFO L225 Difference]: With dead ends: 155 [2025-02-05 10:22:48,432 INFO L226 Difference]: Without dead ends: 112 [2025-02-05 10:22:48,433 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-02-05 10:22:48,433 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-02-05 10:22:48,433 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-02-05 10:22:48,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-05 10:22:48,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-05 10:22:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 90 states have internal predecessors, (107), 11 states have call successors, (11), 9 states have call predecessors, (11), 10 states have return successors, (15), 12 states have call predecessors, (15), 11 states have call successors, (15) [2025-02-05 10:22:48,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2025-02-05 10:22:48,456 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 57 [2025-02-05 10:22:48,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:48,457 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2025-02-05 10:22:48,457 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-02-05 10:22:48,457 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2025-02-05 10:22:48,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:22:48,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:48,457 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-02-05 10:22:48,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:22:48,658 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,SelfDestructingSolverStorable10 [2025-02-05 10:22:48,658 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:48,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:48,658 INFO L85 PathProgramCache]: Analyzing trace with hash -650412481, now seen corresponding path program 1 times [2025-02-05 10:22:48,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:48,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721893607] [2025-02-05 10:22:48,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:48,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:48,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:48,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:48,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 10:22:48,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:48,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721893607] [2025-02-05 10:22:48,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721893607] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:48,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725205709] [2025-02-05 10:22:48,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:48,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:48,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:48,703 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:22:48,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 10:22:48,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:48,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:48,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:48,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:48,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 10:22:48,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 10:22:48,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:22:48,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725205709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:22:48,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:22:48,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-02-05 10:22:48,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748213521] [2025-02-05 10:22:48,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:22:48,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:22:48,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:48,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:22:48,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:22:48,771 INFO L87 Difference]: Start difference. First operand 112 states and 133 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-02-05 10:22:48,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:48,793 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2025-02-05 10:22:48,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:22:48,794 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-02-05 10:22:48,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:48,796 INFO L225 Difference]: With dead ends: 168 [2025-02-05 10:22:48,796 INFO L226 Difference]: Without dead ends: 106 [2025-02-05 10:22:48,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 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-02-05 10:22:48,797 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 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-02-05 10:22:48,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:22:48,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-05 10:22:48,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2025-02-05 10:22:48,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 84 states have internal predecessors, (98), 10 states have call successors, (10), 8 states have call predecessors, (10), 9 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2025-02-05 10:22:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2025-02-05 10:22:48,831 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 57 [2025-02-05 10:22:48,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:48,831 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2025-02-05 10:22:48,831 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-02-05 10:22:48,831 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2025-02-05 10:22:48,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:22:48,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:48,832 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:22:48,841 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-02-05 10:22:49,036 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,SelfDestructingSolverStorable11 [2025-02-05 10:22:49,036 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:49,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:49,036 INFO L85 PathProgramCache]: Analyzing trace with hash -68727938, now seen corresponding path program 1 times [2025-02-05 10:22:49,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:49,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543184916] [2025-02-05 10:22:49,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:49,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:49,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:49,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:49,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:49,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 10:22:49,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:49,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543184916] [2025-02-05 10:22:49,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543184916] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:49,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892810348] [2025-02-05 10:22:49,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:22:49,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:49,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:49,160 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-02-05 10:22:49,165 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-02-05 10:22:49,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:22:49,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:22:49,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:49,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:49,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 10:22:49,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:49,346 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 10:22:49,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:22:49,485 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 10:22:49,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892810348] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:22:49,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:22:49,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 11] total 20 [2025-02-05 10:22:49,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378427593] [2025-02-05 10:22:49,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:22:49,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 10:22:49,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:49,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 10:22:49,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-02-05 10:22:49,488 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 6 states have call successors, (13), 4 states have call predecessors, (13), 8 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-02-05 10:22:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:49,907 INFO L93 Difference]: Finished difference Result 213 states and 254 transitions. [2025-02-05 10:22:49,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-05 10:22:49,908 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 6 states have call successors, (13), 4 states have call predecessors, (13), 8 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 57 [2025-02-05 10:22:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:49,909 INFO L225 Difference]: With dead ends: 213 [2025-02-05 10:22:49,909 INFO L226 Difference]: Without dead ends: 168 [2025-02-05 10:22:49,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2025-02-05 10:22:49,909 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 42 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:49,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 283 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:22:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-05 10:22:49,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 140. [2025-02-05 10:22:49,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 113 states have (on average 1.168141592920354) internal successors, (132), 112 states have internal predecessors, (132), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2025-02-05 10:22:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 163 transitions. [2025-02-05 10:22:49,940 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 163 transitions. Word has length 57 [2025-02-05 10:22:49,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:49,941 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 163 transitions. [2025-02-05 10:22:49,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 17 states have internal predecessors, (62), 6 states have call successors, (13), 4 states have call predecessors, (13), 8 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-02-05 10:22:49,941 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 163 transitions. [2025-02-05 10:22:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 10:22:49,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:49,942 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-02-05 10:22:49,947 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-02-05 10:22:50,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:50,143 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:50,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:50,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1807867506, now seen corresponding path program 4 times [2025-02-05 10:22:50,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:50,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214141289] [2025-02-05 10:22:50,143 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:22:50,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:50,149 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-02-05 10:22:50,158 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 51 of 58 statements. [2025-02-05 10:22:50,158 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 10:22:50,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:50,220 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 10:22:50,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:50,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214141289] [2025-02-05 10:22:50,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214141289] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:50,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947617121] [2025-02-05 10:22:50,221 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:22:50,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:50,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:50,222 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-02-05 10:22:50,224 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-02-05 10:22:50,261 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-02-05 10:22:50,274 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 51 of 58 statements. [2025-02-05 10:22:50,274 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 10:22:50,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:50,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 10:22:50,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:22:50,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:22:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 10:22:50,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947617121] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:22:50,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:22:50,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-02-05 10:22:50,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62041401] [2025-02-05 10:22:50,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:22:50,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 10:22:50,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:50,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 10:22:50,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:22:50,407 INFO L87 Difference]: Start difference. First operand 140 states and 163 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 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-02-05 10:22:50,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:50,517 INFO L93 Difference]: Finished difference Result 239 states and 277 transitions. [2025-02-05 10:22:50,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:22:50,517 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 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-02-05 10:22:50,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:50,518 INFO L225 Difference]: With dead ends: 239 [2025-02-05 10:22:50,518 INFO L226 Difference]: Without dead ends: 148 [2025-02-05 10:22:50,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:22:50,519 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:50,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 122 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:22:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-05 10:22:50,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 142. [2025-02-05 10:22:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 114 states have internal predecessors, (132), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2025-02-05 10:22:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2025-02-05 10:22:50,560 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 58 [2025-02-05 10:22:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:50,560 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2025-02-05 10:22:50,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 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-02-05 10:22:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2025-02-05 10:22:50,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 10:22:50,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:50,561 INFO L218 NwaCegarLoop]: trace histogram [6, 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-02-05 10:22:50,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 10:22:50,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:50,765 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:50,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:50,766 INFO L85 PathProgramCache]: Analyzing trace with hash -451896072, now seen corresponding path program 5 times [2025-02-05 10:22:50,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:50,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607755335] [2025-02-05 10:22:50,766 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:22:50,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:50,773 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 8 equivalence classes. [2025-02-05 10:22:50,780 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 24 of 59 statements. [2025-02-05 10:22:50,780 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-05 10:22:50,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:50,867 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 10:22:50,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:50,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607755335] [2025-02-05 10:22:50,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607755335] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:50,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608112340] [2025-02-05 10:22:50,867 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:22:50,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:50,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:50,869 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-02-05 10:22:50,871 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-02-05 10:22:50,913 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 8 equivalence classes. [2025-02-05 10:22:50,935 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 24 of 59 statements. [2025-02-05 10:22:50,935 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-05 10:22:50,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:50,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 10:22:50,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:51,036 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 10:22:51,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:22:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 10:22:51,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608112340] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:22:51,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:22:51,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-02-05 10:22:51,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465199386] [2025-02-05 10:22:51,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:22:51,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 10:22:51,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:51,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 10:22:51,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:22:51,082 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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-02-05 10:22:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:51,270 INFO L93 Difference]: Finished difference Result 276 states and 321 transitions. [2025-02-05 10:22:51,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 10:22:51,270 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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 59 [2025-02-05 10:22:51,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:51,272 INFO L225 Difference]: With dead ends: 276 [2025-02-05 10:22:51,272 INFO L226 Difference]: Without dead ends: 171 [2025-02-05 10:22:51,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 106 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2025-02-05 10:22:51,274 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 30 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:51,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 161 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:22:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-05 10:22:51,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 149. [2025-02-05 10:22:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 122 states have (on average 1.1639344262295082) internal successors, (142), 121 states have internal predecessors, (142), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2025-02-05 10:22:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2025-02-05 10:22:51,298 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 59 [2025-02-05 10:22:51,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:51,299 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2025-02-05 10:22:51,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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-02-05 10:22:51,299 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2025-02-05 10:22:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 10:22:51,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:51,300 INFO L218 NwaCegarLoop]: trace histogram [8, 4, 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-02-05 10:22:51,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-05 10:22:51,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:51,500 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:51,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:51,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2049950938, now seen corresponding path program 6 times [2025-02-05 10:22:51,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:51,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412873852] [2025-02-05 10:22:51,501 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 10:22:51,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:51,510 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 63 statements into 9 equivalence classes. [2025-02-05 10:22:51,546 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 10:22:51,546 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-02-05 10:22:51,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 38 proven. 16 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 10:22:51,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:22:51,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412873852] [2025-02-05 10:22:51,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412873852] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:22:51,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899406858] [2025-02-05 10:22:51,623 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 10:22:51,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:51,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:51,626 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:22:51,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 10:22:51,674 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 63 statements into 9 equivalence classes. [2025-02-05 10:22:51,873 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 10:22:51,873 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-02-05 10:22:51,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:51,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 10:22:51,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 54 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 10:22:51,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:22:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 37 proven. 24 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 10:22:51,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899406858] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:22:51,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:22:51,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-02-05 10:22:51,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604035397] [2025-02-05 10:22:51,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:22:51,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 10:22:51,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:22:51,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 10:22:51,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:22:51,999 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 10:22:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:22:52,112 INFO L93 Difference]: Finished difference Result 218 states and 245 transitions. [2025-02-05 10:22:52,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:22:52,112 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 63 [2025-02-05 10:22:52,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:22:52,113 INFO L225 Difference]: With dead ends: 218 [2025-02-05 10:22:52,114 INFO L226 Difference]: Without dead ends: 142 [2025-02-05 10:22:52,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 119 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:22:52,115 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 7 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:22:52,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 243 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:22:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-05 10:22:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2025-02-05 10:22:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 114 states have (on average 1.1228070175438596) internal successors, (128), 112 states have internal predecessors, (128), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (15), 15 states have call predecessors, (15), 14 states have call successors, (15) [2025-02-05 10:22:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2025-02-05 10:22:52,136 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 63 [2025-02-05 10:22:52,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:22:52,137 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2025-02-05 10:22:52,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 10:22:52,137 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2025-02-05 10:22:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 10:22:52,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:22:52,137 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-02-05 10:22:52,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-05 10:22:52,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 10:22:52,342 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:22:52,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:22:52,343 INFO L85 PathProgramCache]: Analyzing trace with hash -787902902, now seen corresponding path program 7 times [2025-02-05 10:22:52,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:22:52,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577431074] [2025-02-05 10:22:52,343 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 10:22:52,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:22:52,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 10:22:52,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 10:22:52,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:52,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:22:52,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291430410] [2025-02-05 10:22:52,385 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 10:22:52,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:22:52,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:22:52,387 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:22:52,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 10:22:52,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 10:22:53,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 10:22:53,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:22:53,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:22:53,231 WARN L254 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 169 conjuncts are in the unsatisfiable core [2025-02-05 10:22:53,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:22:53,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-05 10:22:53,356 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-02-05 10:22:53,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:22:53,387 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-02-05 10:22:53,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:22:53,481 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 33 treesize of output 38 [2025-02-05 10:22:53,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:22:53,534 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 40 treesize of output 48 [2025-02-05 10:22:53,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:22:53,582 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 47 treesize of output 58 [2025-02-05 10:22:53,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:22:53,704 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 54 treesize of output 68 [2025-02-05 10:22:53,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:22:53,756 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 61 treesize of output 78 [2025-02-05 10:22:53,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:22:53,819 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 68 treesize of output 88 [2025-02-05 10:22:55,201 INFO L349 Elim1Store]: treesize reduction 468, result has 33.4 percent of original size [2025-02-05 10:22:55,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 36 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 171 case distinctions, treesize of input 144 treesize of output 302 [2025-02-05 10:23:03,730 INFO L349 Elim1Store]: treesize reduction 480, result has 26.3 percent of original size [2025-02-05 10:23:03,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 65 case distinctions, treesize of input 859 treesize of output 815 [2025-02-05 10:23:10,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 610 [2025-02-05 10:23:11,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:11,669 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:11,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:11,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:11,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:11,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:11,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:11,679 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:11,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 8 select indices, 8 select index equivalence classes, 45 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 518 [2025-02-05 10:23:12,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,190 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,191 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,192 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,192 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,193 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,193 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,194 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,194 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,194 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,195 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,195 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,196 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,197 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 31 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 97 [2025-02-05 10:23:12,259 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,260 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,262 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,263 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,263 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,263 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,264 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,264 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,264 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,265 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,265 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,265 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,266 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 31 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 97 [2025-02-05 10:23:12,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,336 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,337 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,338 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,339 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,340 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,341 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,342 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,343 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,343 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,344 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,345 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,346 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,347 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,351 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,352 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,352 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,353 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,354 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,354 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 8 select indices, 8 select index equivalence classes, 32 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 206 [2025-02-05 10:23:12,434 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,435 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,435 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,436 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:23:12,437 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,437 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,438 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,438 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,438 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,439 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,439 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,440 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,440 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-05 10:23:12,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 31 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 97 [2025-02-05 10:23:12,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 85 [2025-02-05 10:23:12,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 131 [2025-02-05 10:23:17,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 454 treesize of output 338 [2025-02-05 10:23:17,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 9 select indices, 9 select index equivalence classes, 39 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 338 treesize of output 541 [2025-02-05 10:23:18,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 69 [2025-02-05 10:23:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 8 proven. 151 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:23:18,190 INFO L312 TraceCheckSpWp]: Computing backward predicates...