./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s4if.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-fpi/s4if.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 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:34:10,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:34:10,488 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:34:10,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:34:10,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:34:10,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:34:10,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:34:10,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:34:10,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:34:10,508 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:34:10,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:34:10,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:34:10,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:34:10,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:34:10,508 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:34:10,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:34:10,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:34:10,509 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:34:10,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:34:10,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:34:10,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:34:10,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:34:10,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:34:10,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:34:10,509 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:34:10,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:34:10,510 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:34:10,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:34:10,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:34:10,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:34:10,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:34:10,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:34:10,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:34:10,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:34:10,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:34:10,510 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:34:10,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:34:10,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:34:10,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:34:10,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:34:10,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:34:10,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:34:10,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:34:10,511 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 -> 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e [2025-02-05 10:34:10,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:34:10,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:34:10,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:34:10,761 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:34:10,761 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:34:10,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s4if.c [2025-02-05 10:34:11,902 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42007d8cf/1ca917cfd9864f2dbeac38800c924dfd/FLAG29dd0f713 [2025-02-05 10:34:12,134 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:34:12,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/s4if.c [2025-02-05 10:34:12,144 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42007d8cf/1ca917cfd9864f2dbeac38800c924dfd/FLAG29dd0f713 [2025-02-05 10:34:12,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42007d8cf/1ca917cfd9864f2dbeac38800c924dfd [2025-02-05 10:34:12,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:34:12,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:34:12,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:34:12,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:34:12,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:34:12,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:34:12" (1/1) ... [2025-02-05 10:34:12,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c5a69ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:34:12, skipping insertion in model container [2025-02-05 10:34:12,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:34:12" (1/1) ... [2025-02-05 10:34:12,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:34:12,620 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-fpi/s4if.c[587,600] [2025-02-05 10:34:12,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:34:12,645 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:34:12,653 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-fpi/s4if.c[587,600] [2025-02-05 10:34:12,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:34:12,673 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:34:12,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:34:12 WrapperNode [2025-02-05 10:34:12,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:34:12,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:34:12,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:34:12,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:34:12,680 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:34:12" (1/1) ... [2025-02-05 10:34:12,685 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:34:12" (1/1) ... [2025-02-05 10:34:12,699 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-02-05 10:34:12,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:34:12,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:34:12,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:34:12,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:34:12,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:34:12" (1/1) ... [2025-02-05 10:34:12,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:34:12" (1/1) ... [2025-02-05 10:34:12,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:34:12" (1/1) ... [2025-02-05 10:34:12,723 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 4, 7, 6]. 37 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 0, 7, 0]. The 4 writes are split as follows [0, 1, 0, 3]. [2025-02-05 10:34:12,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:34:12" (1/1) ... [2025-02-05 10:34:12,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:34:12" (1/1) ... [2025-02-05 10:34:12,732 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:34:12" (1/1) ... [2025-02-05 10:34:12,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:34:12" (1/1) ... [2025-02-05 10:34:12,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:34:12" (1/1) ... [2025-02-05 10:34:12,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:34:12" (1/1) ... [2025-02-05 10:34:12,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:34:12,739 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:34:12,739 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:34:12,739 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:34:12,740 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:34:12" (1/1) ... [2025-02-05 10:34:12,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:34:12,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:34:12,770 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:34:12,777 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:34:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:34:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:34:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:34:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 10:34:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 10:34:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 10:34:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:34:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:34:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 10:34:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 10:34:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 10:34:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:34:12,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:34:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:34:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:34:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 10:34:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 10:34:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 10:34:12,854 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:34:12,856 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:34:12,953 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2025-02-05 10:34:12,958 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-05 10:34:12,958 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:34:12,963 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:34:12,963 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:34:12,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:34:12 BoogieIcfgContainer [2025-02-05 10:34:12,964 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:34:12,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:34:12,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:34:12,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:34:12,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:34:12" (1/3) ... [2025-02-05 10:34:12,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3f722b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:34:12, skipping insertion in model container [2025-02-05 10:34:12,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:34:12" (2/3) ... [2025-02-05 10:34:12,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3f722b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:34:12, skipping insertion in model container [2025-02-05 10:34:12,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:34:12" (3/3) ... [2025-02-05 10:34:12,970 INFO L128 eAbstractionObserver]: Analyzing ICFG s4if.c [2025-02-05 10:34:12,980 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:34:12,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s4if.c that has 1 procedures, 16 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 10:34:13,011 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:34:13,019 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;@6c93d772, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:34:13,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:34:13,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:13,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-05 10:34:13,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:13,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:13,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:13,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:13,029 INFO L85 PathProgramCache]: Analyzing trace with hash -673256721, now seen corresponding path program 1 times [2025-02-05 10:34:13,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:13,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765678498] [2025-02-05 10:34:13,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:34:13,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:13,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-05 10:34:13,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-05 10:34:13,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:34:13,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:13,125 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:34:13,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:13,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765678498] [2025-02-05 10:34:13,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765678498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:34:13,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:34:13,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:34:13,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42871966] [2025-02-05 10:34:13,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:34:13,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 10:34:13,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:13,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 10:34:13,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:34:13,142 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:34:13,150 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2025-02-05 10:34:13,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 10:34:13,151 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-05 10:34:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:34:13,155 INFO L225 Difference]: With dead ends: 28 [2025-02-05 10:34:13,155 INFO L226 Difference]: Without dead ends: 12 [2025-02-05 10:34:13,156 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:34:13,158 INFO L435 NwaCegarLoop]: 19 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, 19 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:34:13,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:34:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-02-05 10:34:13,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-02-05 10:34:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-02-05 10:34:13,175 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2025-02-05 10:34:13,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:34:13,176 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-02-05 10:34:13,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2025-02-05 10:34:13,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-05 10:34:13,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:13,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:13,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:34:13,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:13,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:13,177 INFO L85 PathProgramCache]: Analyzing trace with hash -644627570, now seen corresponding path program 1 times [2025-02-05 10:34:13,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:13,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700645111] [2025-02-05 10:34:13,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:34:13,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:13,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-05 10:34:13,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-05 10:34:13,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:34:13,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:13,272 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:34:13,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:13,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700645111] [2025-02-05 10:34:13,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700645111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:34:13,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:34:13,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:34:13,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761655212] [2025-02-05 10:34:13,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:34:13,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:34:13,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:13,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:34:13,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:34:13,276 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:34:13,304 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2025-02-05 10:34:13,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:34:13,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-05 10:34:13,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:34:13,305 INFO L225 Difference]: With dead ends: 22 [2025-02-05 10:34:13,305 INFO L226 Difference]: Without dead ends: 16 [2025-02-05 10:34:13,305 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:34:13,306 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:34:13,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 9 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:34:13,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-05 10:34:13,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2025-02-05 10:34:13,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-02-05 10:34:13,309 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2025-02-05 10:34:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:34:13,309 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-02-05 10:34:13,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2025-02-05 10:34:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 10:34:13,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:13,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:13,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:34:13,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:13,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:13,310 INFO L85 PathProgramCache]: Analyzing trace with hash 380854543, now seen corresponding path program 1 times [2025-02-05 10:34:13,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:13,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218915838] [2025-02-05 10:34:13,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:34:13,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:13,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 10:34:13,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 10:34:13,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:34:13,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:13,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:13,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218915838] [2025-02-05 10:34:13,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218915838] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:34:13,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826762428] [2025-02-05 10:34:13,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:34:13,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:13,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:34:13,800 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:34:13,807 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:34:13,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 10:34:13,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 10:34:13,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:34:13,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:13,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 10:34:13,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:34:13,920 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:34:14,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 10:34:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:14,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:34:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:14,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826762428] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:34:14,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:34:14,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-02-05 10:34:14,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286500559] [2025-02-05 10:34:14,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:34:14,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 10:34:14,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:14,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 10:34:14,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:34:14,250 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:14,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:34:14,523 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2025-02-05 10:34:14,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 10:34:14,524 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-05 10:34:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:34:14,524 INFO L225 Difference]: With dead ends: 26 [2025-02-05 10:34:14,524 INFO L226 Difference]: Without dead ends: 23 [2025-02-05 10:34:14,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2025-02-05 10:34:14,525 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:34:14,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 40 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:34:14,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-05 10:34:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2025-02-05 10:34:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-02-05 10:34:14,535 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 13 [2025-02-05 10:34:14,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:34:14,536 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-02-05 10:34:14,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-02-05 10:34:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 10:34:14,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:14,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:14,542 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:34:14,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:14,737 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:14,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:14,738 INFO L85 PathProgramCache]: Analyzing trace with hash 381778064, now seen corresponding path program 1 times [2025-02-05 10:34:14,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:14,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921385710] [2025-02-05 10:34:14,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:34:14,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:14,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 10:34:14,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 10:34:14,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:34:14,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:14,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:14,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921385710] [2025-02-05 10:34:14,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921385710] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:34:14,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246180775] [2025-02-05 10:34:14,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:34:14,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:14,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:34:14,916 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:34:14,917 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:34:14,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 10:34:14,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 10:34:14,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:34:14,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:14,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 10:34:14,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:34:14,999 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:34:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:15,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:34:15,043 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 14 treesize of output 12 [2025-02-05 10:34:15,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-05 10:34:15,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:15,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246180775] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:34:15,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:34:15,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-05 10:34:15,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478149357] [2025-02-05 10:34:15,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:34:15,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 10:34:15,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:15,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 10:34:15,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:34:15,056 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:15,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:34:15,099 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2025-02-05 10:34:15,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:34:15,100 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-05 10:34:15,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:34:15,101 INFO L225 Difference]: With dead ends: 32 [2025-02-05 10:34:15,101 INFO L226 Difference]: Without dead ends: 21 [2025-02-05 10:34:15,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:34:15,101 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:34:15,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 30 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:34:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-05 10:34:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-02-05 10:34:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-02-05 10:34:15,107 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2025-02-05 10:34:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:34:15,107 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-02-05 10:34:15,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-02-05 10:34:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 10:34:15,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:15,108 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:15,113 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:34:15,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:15,312 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:15,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:15,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1610116533, now seen corresponding path program 2 times [2025-02-05 10:34:15,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:15,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141352808] [2025-02-05 10:34:15,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:34:15,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:15,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-05 10:34:15,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 10:34:15,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:34:15,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:15,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:15,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141352808] [2025-02-05 10:34:15,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141352808] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:34:15,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169494446] [2025-02-05 10:34:15,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:34:15,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:15,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:34:15,388 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:34:15,396 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:34:15,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-05 10:34:15,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 10:34:15,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:34:15,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:15,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 10:34:15,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:34:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:15,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:34:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:15,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169494446] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:34:15,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:34:15,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-05 10:34:15,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779041584] [2025-02-05 10:34:15,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:34:15,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 10:34:15,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:15,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 10:34:15,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:34:15,532 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:15,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:34:15,624 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2025-02-05 10:34:15,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:34:15,624 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-05 10:34:15,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:34:15,624 INFO L225 Difference]: With dead ends: 27 [2025-02-05 10:34:15,625 INFO L226 Difference]: Without dead ends: 24 [2025-02-05 10:34:15,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:34:15,625 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:34:15,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:34:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-05 10:34:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2025-02-05 10:34:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-02-05 10:34:15,628 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2025-02-05 10:34:15,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:34:15,628 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-02-05 10:34:15,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-02-05 10:34:15,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 10:34:15,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:15,629 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:15,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 10:34:15,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:15,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:15,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:15,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1147567788, now seen corresponding path program 3 times [2025-02-05 10:34:15,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:15,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770006326] [2025-02-05 10:34:15,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:34:15,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:15,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-02-05 10:34:15,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 10:34:15,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:34:15,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:15,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:15,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770006326] [2025-02-05 10:34:15,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770006326] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:34:15,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558619307] [2025-02-05 10:34:15,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:34:15,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:15,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:34:15,893 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:34:15,894 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:34:15,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-02-05 10:34:15,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 10:34:15,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:34:15,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:15,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 10:34:15,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:34:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:15,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:34:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:15,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558619307] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:34:15,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:34:15,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-05 10:34:15,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819211713] [2025-02-05 10:34:15,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:34:15,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 10:34:15,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:15,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 10:34:15,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:34:15,996 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:16,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:34:16,036 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-02-05 10:34:16,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:34:16,037 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-05 10:34:16,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:34:16,037 INFO L225 Difference]: With dead ends: 30 [2025-02-05 10:34:16,037 INFO L226 Difference]: Without dead ends: 20 [2025-02-05 10:34:16,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:34:16,038 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:34:16,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 21 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:34:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-05 10:34:16,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-02-05 10:34:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-02-05 10:34:16,041 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2025-02-05 10:34:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:34:16,041 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-02-05 10:34:16,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-02-05 10:34:16,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 10:34:16,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:16,042 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:16,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 10:34:16,242 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,SelfDestructingSolverStorable5 [2025-02-05 10:34:16,242 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:16,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:16,242 INFO L85 PathProgramCache]: Analyzing trace with hash 905210606, now seen corresponding path program 4 times [2025-02-05 10:34:16,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:16,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105839545] [2025-02-05 10:34:16,243 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:34:16,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:16,252 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-02-05 10:34:16,260 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:34:16,260 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:34:16,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:16,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:16,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105839545] [2025-02-05 10:34:16,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105839545] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:34:16,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17506451] [2025-02-05 10:34:16,580 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:34:16,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:16,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:34:16,584 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:34:16,589 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:34:16,622 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-02-05 10:34:16,637 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:34:16,637 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:34:16,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:16,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-05 10:34:16,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:34:16,646 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:34:16,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 10:34:16,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 10:34:16,827 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-05 10:34:16,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 7 [2025-02-05 10:34:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:16,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:34:17,017 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-05 10:34:17,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2025-02-05 10:34:17,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:17,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17506451] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:34:17,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:34:17,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2025-02-05 10:34:17,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738313022] [2025-02-05 10:34:17,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:34:17,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-05 10:34:17,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:17,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-05 10:34:17,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2025-02-05 10:34:17,157 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:34:17,873 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2025-02-05 10:34:17,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-05 10:34:17,874 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 10:34:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:34:17,875 INFO L225 Difference]: With dead ends: 47 [2025-02-05 10:34:17,875 INFO L226 Difference]: Without dead ends: 40 [2025-02-05 10:34:17,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=298, Invalid=1594, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 10:34:17,876 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:34:17,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 70 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:34:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-05 10:34:17,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2025-02-05 10:34:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2025-02-05 10:34:17,882 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 17 [2025-02-05 10:34:17,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:34:17,882 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-02-05 10:34:17,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:17,882 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2025-02-05 10:34:17,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 10:34:17,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:17,882 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:17,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 10:34:18,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:18,087 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:18,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:18,088 INFO L85 PathProgramCache]: Analyzing trace with hash 906134127, now seen corresponding path program 1 times [2025-02-05 10:34:18,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:18,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84293085] [2025-02-05 10:34:18,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:34:18,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:18,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:34:18,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:34:18,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:34:18,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:18,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:18,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:18,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84293085] [2025-02-05 10:34:18,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84293085] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:34:18,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780668022] [2025-02-05 10:34:18,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:34:18,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:18,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:34:18,257 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:34:18,258 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:34:18,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:34:18,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:34:18,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:34:18,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:18,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 10:34:18,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:34:18,319 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:34:18,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:18,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:34:18,399 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 16 treesize of output 14 [2025-02-05 10:34:18,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-05 10:34:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:18,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780668022] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:34:18,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:34:18,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-02-05 10:34:18,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145020667] [2025-02-05 10:34:18,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:34:18,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 10:34:18,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:18,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 10:34:18,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:34:18,427 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:34:18,532 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2025-02-05 10:34:18,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:34:18,533 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 10:34:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:34:18,534 INFO L225 Difference]: With dead ends: 55 [2025-02-05 10:34:18,534 INFO L226 Difference]: Without dead ends: 38 [2025-02-05 10:34:18,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:34:18,535 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:34:18,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 53 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:34:18,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-05 10:34:18,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-02-05 10:34:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-02-05 10:34:18,542 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 17 [2025-02-05 10:34:18,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:34:18,543 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-02-05 10:34:18,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-02-05 10:34:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 10:34:18,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:18,543 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:18,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 10:34:18,748 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,SelfDestructingSolverStorable7 [2025-02-05 10:34:18,748 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:18,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:18,749 INFO L85 PathProgramCache]: Analyzing trace with hash 116831380, now seen corresponding path program 5 times [2025-02-05 10:34:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:18,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216844767] [2025-02-05 10:34:18,750 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:34:18,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:18,756 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-02-05 10:34:18,766 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 10:34:18,768 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-05 10:34:18,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:18,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:18,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216844767] [2025-02-05 10:34:18,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216844767] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:34:18,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918308072] [2025-02-05 10:34:18,834 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:34:18,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:18,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:34:18,835 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:34:18,837 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:34:18,872 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-02-05 10:34:18,886 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 10:34:18,886 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-05 10:34:18,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:18,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 10:34:18,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:34:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:18,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:34:18,960 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:18,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918308072] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:34:18,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:34:18,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-02-05 10:34:18,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189447382] [2025-02-05 10:34:18,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:34:18,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 10:34:18,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:18,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 10:34:18,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:34:18,961 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:34:19,056 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2025-02-05 10:34:19,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 10:34:19,056 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-05 10:34:19,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:34:19,057 INFO L225 Difference]: With dead ends: 45 [2025-02-05 10:34:19,057 INFO L226 Difference]: Without dead ends: 42 [2025-02-05 10:34:19,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:34:19,057 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:34:19,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 26 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:34:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-05 10:34:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2025-02-05 10:34:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2025-02-05 10:34:19,069 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 18 [2025-02-05 10:34:19,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:34:19,069 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2025-02-05 10:34:19,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2025-02-05 10:34:19,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 10:34:19,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:19,071 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:19,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 10:34:19,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:19,272 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:19,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:19,272 INFO L85 PathProgramCache]: Analyzing trace with hash -851226986, now seen corresponding path program 2 times [2025-02-05 10:34:19,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:19,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954418950] [2025-02-05 10:34:19,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:34:19,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:19,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-05 10:34:19,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:34:19,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:34:19,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:19,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:19,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954418950] [2025-02-05 10:34:19,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954418950] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:34:19,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313579437] [2025-02-05 10:34:19,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:34:19,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:19,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:34:19,348 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:34:19,350 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:34:19,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-05 10:34:19,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:34:19,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:34:19,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:19,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 10:34:19,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:34:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:19,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:34:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:19,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313579437] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:34:19,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:34:19,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-02-05 10:34:19,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959101447] [2025-02-05 10:34:19,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:34:19,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 10:34:19,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:19,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 10:34:19,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:34:19,514 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:19,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:34:19,591 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2025-02-05 10:34:19,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:34:19,591 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-05 10:34:19,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:34:19,591 INFO L225 Difference]: With dead ends: 48 [2025-02-05 10:34:19,591 INFO L226 Difference]: Without dead ends: 24 [2025-02-05 10:34:19,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:34:19,592 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:34:19,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 27 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:34:19,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-05 10:34:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-02-05 10:34:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-02-05 10:34:19,595 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2025-02-05 10:34:19,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:34:19,595 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-02-05 10:34:19,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-02-05 10:34:19,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 10:34:19,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:19,596 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:19,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 10:34:19,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:19,797 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:19,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:19,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1718469551, now seen corresponding path program 6 times [2025-02-05 10:34:19,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:19,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576219857] [2025-02-05 10:34:19,797 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 10:34:19,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:19,804 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-02-05 10:34:19,825 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 10:34:19,825 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-02-05 10:34:19,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:20,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:20,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576219857] [2025-02-05 10:34:20,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576219857] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:34:20,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541433990] [2025-02-05 10:34:20,159 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 10:34:20,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:20,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:34:20,161 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:34:20,163 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:34:20,199 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-02-05 10:34:20,214 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 10:34:20,215 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-02-05 10:34:20,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:20,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-05 10:34:20,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:34:20,219 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:34:20,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 10:34:20,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 10:34:20,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 10:34:20,614 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-02-05 10:34:20,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 10 [2025-02-05 10:34:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:20,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:34:21,363 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-02-05 10:34:21,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 13 [2025-02-05 10:34:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:21,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541433990] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:34:21,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:34:21,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 45 [2025-02-05 10:34:21,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234287619] [2025-02-05 10:34:21,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:34:21,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-05 10:34:21,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:21,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-05 10:34:21,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1776, Unknown=0, NotChecked=0, Total=1980 [2025-02-05 10:34:21,567 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 45 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:34:22,314 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-02-05 10:34:22,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-05 10:34:22,314 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-05 10:34:22,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:34:22,315 INFO L225 Difference]: With dead ends: 43 [2025-02-05 10:34:22,315 INFO L226 Difference]: Without dead ends: 40 [2025-02-05 10:34:22,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=397, Invalid=3143, Unknown=0, NotChecked=0, Total=3540 [2025-02-05 10:34:22,316 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:34:22,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 88 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:34:22,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-05 10:34:22,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2025-02-05 10:34:22,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-02-05 10:34:22,323 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2025-02-05 10:34:22,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:34:22,323 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-02-05 10:34:22,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:22,324 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-02-05 10:34:22,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 10:34:22,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:22,327 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:22,335 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:34:22,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:22,528 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:22,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:22,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1719393072, now seen corresponding path program 3 times [2025-02-05 10:34:22,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:22,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069511929] [2025-02-05 10:34:22,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:34:22,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:22,537 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-02-05 10:34:22,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 21 statements. [2025-02-05 10:34:22,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:34:22,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:34:22,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:22,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069511929] [2025-02-05 10:34:22,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069511929] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:34:22,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390226858] [2025-02-05 10:34:22,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:34:22,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:22,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:34:22,843 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:34:22,844 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:34:22,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-02-05 10:34:22,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 21 statements. [2025-02-05 10:34:22,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:34:22,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:22,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 10:34:22,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:34:22,908 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 15 treesize of output 11 [2025-02-05 10:34:22,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:34:22,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2025-02-05 10:34:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:34:23,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:34:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:34:23,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390226858] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:34:23,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:34:23,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2025-02-05 10:34:23,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851725611] [2025-02-05 10:34:23,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:34:23,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 10:34:23,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:23,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 10:34:23,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:34:23,070 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:23,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:34:23,288 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2025-02-05 10:34:23,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 10:34:23,289 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-05 10:34:23,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:34:23,289 INFO L225 Difference]: With dead ends: 30 [2025-02-05 10:34:23,289 INFO L226 Difference]: Without dead ends: 27 [2025-02-05 10:34:23,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2025-02-05 10:34:23,290 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:34:23,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 37 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:34:23,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-05 10:34:23,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-02-05 10:34:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:23,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-02-05 10:34:23,294 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2025-02-05 10:34:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:34:23,294 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-02-05 10:34:23,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:23,294 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-02-05 10:34:23,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:34:23,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:23,295 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:23,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 10:34:23,495 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,SelfDestructingSolverStorable11 [2025-02-05 10:34:23,495 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:23,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash -965436748, now seen corresponding path program 7 times [2025-02-05 10:34:23,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:23,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040249809] [2025-02-05 10:34:23,496 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 10:34:23,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:23,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:34:23,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:34:23,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:34:23,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:23,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:23,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040249809] [2025-02-05 10:34:23,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040249809] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:34:23,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558755641] [2025-02-05 10:34:23,570 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 10:34:23,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:23,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:34:23,572 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:34:23,573 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:34:23,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:34:23,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:34:23,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:34:23,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:23,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 10:34:23,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:34:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:23,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:34:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:23,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558755641] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:34:23,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:34:23,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2025-02-05 10:34:23,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927648688] [2025-02-05 10:34:23,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:34:23,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 10:34:23,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:23,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 10:34:23,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:34:23,733 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:23,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:34:23,818 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-02-05 10:34:23,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:34:23,819 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 10:34:23,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:34:23,819 INFO L225 Difference]: With dead ends: 49 [2025-02-05 10:34:23,819 INFO L226 Difference]: Without dead ends: 31 [2025-02-05 10:34:23,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:34:23,820 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:34:23,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 38 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:34:23,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-05 10:34:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2025-02-05 10:34:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-02-05 10:34:23,825 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2025-02-05 10:34:23,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:34:23,826 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-02-05 10:34:23,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-02-05 10:34:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 10:34:23,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:23,828 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:23,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 10:34:24,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 10:34:24,032 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:24,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:24,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1056880050, now seen corresponding path program 8 times [2025-02-05 10:34:24,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:24,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419098451] [2025-02-05 10:34:24,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:34:24,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:24,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-05 10:34:24,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:34:24,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:34:24,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:25,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:25,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419098451] [2025-02-05 10:34:25,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419098451] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:34:25,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679137256] [2025-02-05 10:34:25,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:34:25,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:25,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:34:25,175 INFO L229 MonitoredProcess]: Starting monitored process 13 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:34:25,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 10:34:25,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-05 10:34:25,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 10:34:25,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:34:25,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:25,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-05 10:34:25,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:34:25,250 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:34:25,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 10:34:25,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 10:34:25,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 10:34:25,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 10:34:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:25,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:34:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:26,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679137256] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:34:26,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:34:26,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 17] total 52 [2025-02-05 10:34:26,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290732634] [2025-02-05 10:34:26,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:34:26,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-05 10:34:26,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:26,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-05 10:34:26,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2401, Unknown=0, NotChecked=0, Total=2652 [2025-02-05 10:34:26,322 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 52 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:27,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:34:27,201 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-02-05 10:34:27,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 10:34:27,201 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 10:34:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:34:27,202 INFO L225 Difference]: With dead ends: 47 [2025-02-05 10:34:27,202 INFO L226 Difference]: Without dead ends: 44 [2025-02-05 10:34:27,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=410, Invalid=3750, Unknown=0, NotChecked=0, Total=4160 [2025-02-05 10:34:27,203 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 27 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:34:27,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 71 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:34:27,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-05 10:34:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2025-02-05 10:34:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-02-05 10:34:27,209 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2025-02-05 10:34:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:34:27,210 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-02-05 10:34:27,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-02-05 10:34:27,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 10:34:27,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:27,210 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:27,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-05 10:34:27,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:27,415 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:27,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:27,416 INFO L85 PathProgramCache]: Analyzing trace with hash 685930285, now seen corresponding path program 4 times [2025-02-05 10:34:27,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:27,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422236714] [2025-02-05 10:34:27,416 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:34:27,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:27,421 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-05 10:34:27,426 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 25 statements. [2025-02-05 10:34:27,426 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 10:34:27,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:34:27,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:27,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422236714] [2025-02-05 10:34:27,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422236714] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:34:27,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145672902] [2025-02-05 10:34:27,547 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:34:27,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:27,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:34:27,549 INFO L229 MonitoredProcess]: Starting monitored process 14 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:34:27,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 10:34:27,597 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-02-05 10:34:27,606 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 25 statements. [2025-02-05 10:34:27,606 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 10:34:27,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:27,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 10:34:27,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:34:27,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-05 10:34:27,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-02-05 10:34:27,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:34:27,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2025-02-05 10:34:27,672 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:34:27,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:34:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:34:27,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145672902] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:34:27,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:34:27,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2025-02-05 10:34:27,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733400537] [2025-02-05 10:34:27,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:34:27,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 10:34:27,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:27,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 10:34:27,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:34:27,720 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:27,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:34:27,929 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-02-05 10:34:27,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 10:34:27,931 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-05 10:34:27,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:34:27,931 INFO L225 Difference]: With dead ends: 45 [2025-02-05 10:34:27,931 INFO L226 Difference]: Without dead ends: 42 [2025-02-05 10:34:27,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2025-02-05 10:34:27,932 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:34:27,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 29 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:34:27,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-05 10:34:27,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2025-02-05 10:34:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-02-05 10:34:27,941 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2025-02-05 10:34:27,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:34:27,941 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-02-05 10:34:27,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-02-05 10:34:27,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 10:34:27,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:27,942 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:27,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-05 10:34:28,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:28,146 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:28,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:28,147 INFO L85 PathProgramCache]: Analyzing trace with hash 403344884, now seen corresponding path program 9 times [2025-02-05 10:34:28,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:28,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727177132] [2025-02-05 10:34:28,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:34:28,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:28,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 5 equivalence classes. [2025-02-05 10:34:28,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 10:34:28,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-05 10:34:28,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:28,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:28,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727177132] [2025-02-05 10:34:28,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727177132] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:34:28,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409576058] [2025-02-05 10:34:28,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:34:28,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:28,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:34:28,285 INFO L229 MonitoredProcess]: Starting monitored process 15 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:34:28,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-05 10:34:28,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 5 equivalence classes. [2025-02-05 10:34:28,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 10:34:28,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-05 10:34:28,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:28,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 10:34:28,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:34:28,459 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:28,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:34:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:28,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409576058] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:34:28,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:34:28,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-02-05 10:34:28,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114279839] [2025-02-05 10:34:28,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:34:28,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 10:34:28,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:28,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 10:34:28,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-02-05 10:34:28,538 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:34:28,735 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-02-05 10:34:28,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 10:34:28,735 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 10:34:28,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:34:28,736 INFO L225 Difference]: With dead ends: 65 [2025-02-05 10:34:28,736 INFO L226 Difference]: Without dead ends: 62 [2025-02-05 10:34:28,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2025-02-05 10:34:28,737 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:34:28,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 32 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:34:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-05 10:34:28,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 29. [2025-02-05 10:34:28,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:28,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-02-05 10:34:28,744 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 26 [2025-02-05 10:34:28,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:34:28,744 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-02-05 10:34:28,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-02-05 10:34:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 10:34:28,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:28,744 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:28,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-05 10:34:28,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 10:34:28,946 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:28,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:28,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1010015157, now seen corresponding path program 10 times [2025-02-05 10:34:28,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:28,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102451799] [2025-02-05 10:34:28,946 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:34:28,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:28,953 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-02-05 10:34:28,957 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 10:34:28,957 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:34:28,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:29,036 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:29,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:29,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102451799] [2025-02-05 10:34:29,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102451799] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:34:29,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262804434] [2025-02-05 10:34:29,036 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:34:29,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:29,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:34:29,038 INFO L229 MonitoredProcess]: Starting monitored process 16 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:34:29,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-05 10:34:29,088 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-02-05 10:34:29,106 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 10:34:29,107 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:34:29,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:29,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 10:34:29,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:34:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:29,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:34:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:29,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262804434] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:34:29,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:34:29,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2025-02-05 10:34:29,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040922690] [2025-02-05 10:34:29,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:34:29,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 10:34:29,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:29,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 10:34:29,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-02-05 10:34:29,232 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:34:29,324 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2025-02-05 10:34:29,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 10:34:29,325 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-05 10:34:29,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:34:29,325 INFO L225 Difference]: With dead ends: 68 [2025-02-05 10:34:29,325 INFO L226 Difference]: Without dead ends: 42 [2025-02-05 10:34:29,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-02-05 10:34:29,326 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:34:29,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 32 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:34:29,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-05 10:34:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2025-02-05 10:34:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-02-05 10:34:29,340 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 28 [2025-02-05 10:34:29,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:34:29,340 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-02-05 10:34:29,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:29,340 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-02-05 10:34:29,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 10:34:29,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:29,341 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:29,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-05 10:34:29,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 10:34:29,542 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:29,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:29,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1152717233, now seen corresponding path program 11 times [2025-02-05 10:34:29,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:29,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595601981] [2025-02-05 10:34:29,542 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:34:29,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:29,551 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-02-05 10:34:29,579 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 10:34:29,580 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-05 10:34:29,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 10:34:30,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:30,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595601981] [2025-02-05 10:34:30,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595601981] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:34:30,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155497140] [2025-02-05 10:34:30,049 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:34:30,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:30,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:34:30,053 INFO L229 MonitoredProcess]: Starting monitored process 17 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:34:30,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-05 10:34:30,100 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-02-05 10:34:30,127 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 10:34:30,127 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-05 10:34:30,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:30,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-05 10:34:30,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:34:30,142 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:34:30,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 10:34:30,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 10:34:30,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 10:34:30,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 10:34:31,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-05 10:34:31,121 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-02-05 10:34:31,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 16 [2025-02-05 10:34:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:31,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:34:32,272 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-02-05 10:34:32,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 21 [2025-02-05 10:34:32,660 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:32,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155497140] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:34:32,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:34:32,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24, 24] total 59 [2025-02-05 10:34:32,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506315905] [2025-02-05 10:34:32,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:34:32,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-02-05 10:34:32,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:32,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-02-05 10:34:32,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=3096, Unknown=0, NotChecked=0, Total=3422 [2025-02-05 10:34:32,663 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 59 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:42,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:34:42,326 INFO L93 Difference]: Finished difference Result 131 states and 168 transitions. [2025-02-05 10:34:42,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-02-05 10:34:42,331 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-05 10:34:42,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:34:42,331 INFO L225 Difference]: With dead ends: 131 [2025-02-05 10:34:42,331 INFO L226 Difference]: Without dead ends: 117 [2025-02-05 10:34:42,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5647 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1985, Invalid=15837, Unknown=0, NotChecked=0, Total=17822 [2025-02-05 10:34:42,341 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 69 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:34:42,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 129 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 10:34:42,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-05 10:34:42,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 64. [2025-02-05 10:34:42,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.253968253968254) internal successors, (79), 63 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:42,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2025-02-05 10:34:42,373 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 29 [2025-02-05 10:34:42,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:34:42,373 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2025-02-05 10:34:42,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2025-02-05 10:34:42,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 10:34:42,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:34:42,373 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:34:42,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-05 10:34:42,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 10:34:42,574 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:34:42,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:34:42,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1345298704, now seen corresponding path program 5 times [2025-02-05 10:34:42,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:34:42,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050066286] [2025-02-05 10:34:42,576 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:34:42,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:34:42,583 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-02-05 10:34:42,591 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 10:34:42,591 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-05 10:34:42,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:34:43,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:34:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050066286] [2025-02-05 10:34:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050066286] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:34:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46669840] [2025-02-05 10:34:43,121 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:34:43,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:34:43,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:34:43,130 INFO L229 MonitoredProcess]: Starting monitored process 18 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:34:43,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-05 10:34:43,226 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-02-05 10:34:43,300 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 10:34:43,300 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-05 10:34:43,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:34:43,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-05 10:34:43,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:34:43,405 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:34:43,445 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 23 treesize of output 11 [2025-02-05 10:34:43,489 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 23 treesize of output 11 [2025-02-05 10:34:43,836 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-02-05 10:34:43,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2025-02-05 10:34:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:44,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:34:44,627 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 39 treesize of output 35 [2025-02-05 10:34:44,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:34:44,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2025-02-05 10:34:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:34:44,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46669840] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:34:44,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:34:44,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 48 [2025-02-05 10:34:44,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933015412] [2025-02-05 10:34:44,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:34:44,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-05 10:34:44,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:34:44,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-05 10:34:44,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=2004, Unknown=0, NotChecked=0, Total=2256 [2025-02-05 10:34:44,717 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 48 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:34:47,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-05 10:34:52,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-05 10:34:55,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-05 10:35:09,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-05 10:35:13,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-05 10:35:17,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-05 10:35:19,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:35:19,238 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2025-02-05 10:35:19,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-02-05 10:35:19,238 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-05 10:35:19,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:35:19,239 INFO L225 Difference]: With dead ends: 115 [2025-02-05 10:35:19,239 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 10:35:19,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1788 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=1155, Invalid=7209, Unknown=8, NotChecked=0, Total=8372 [2025-02-05 10:35:19,242 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 119 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 76 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:35:19,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 56 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 749 Invalid, 6 Unknown, 0 Unchecked, 21.3s Time] [2025-02-05 10:35:19,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 10:35:19,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 10:35:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:35:19,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 10:35:19,242 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2025-02-05 10:35:19,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:35:19,242 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 10:35:19,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:35:19,243 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 10:35:19,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 10:35:19,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:35:19,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-02-05 10:35:19,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:35:19,453 INFO L422 BasicCegarLoop]: Path program histogram: [11, 5, 1, 1, 1] [2025-02-05 10:35:19,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 10:35:31,685 WARN L286 SmtUtils]: Spent 12.19s on a formula simplification. DAG size of input: 552 DAG size of output: 715 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-02-05 10:35:38,640 WARN L286 SmtUtils]: Spent 6.95s on a formula simplification. DAG size of input: 128 DAG size of output: 80 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)