./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array20_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array20_pattern.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4595fcce7ed27c87f4b36557925b67d85fd0fff83d482c199564b06ae0d3b884 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:12:27,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:12:27,804 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 17:12:27,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:12:27,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:12:27,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:12:27,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:12:27,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:12:27,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:12:27,836 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:12:27,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:12:27,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:12:27,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:12:27,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:12:27,837 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:12:27,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:12:27,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:12:27,838 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:12:27,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:12:27,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:12:27,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:12:27,838 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:12:27,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:12:27,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:12:27,839 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:12:27,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:12:27,839 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:12:27,839 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:12:27,839 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:12:27,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:12:27,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:12:27,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:12:27,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:12:27,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:12:27,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:12:27,840 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:12:27,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:12:27,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:12:27,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:12:27,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:12:27,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:12:27,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:12:27,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:12:27,840 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 -> 4595fcce7ed27c87f4b36557925b67d85fd0fff83d482c199564b06ae0d3b884 [2025-02-07 17:12:28,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:12:28,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:12:28,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:12:28,088 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:12:28,089 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:12:28,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array20_pattern.c [2025-02-07 17:12:29,222 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49d6386c2/038c529153cb478499cdab98e31ef61b/FLAG1773c408f [2025-02-07 17:12:29,461 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:12:29,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array20_pattern.c [2025-02-07 17:12:29,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49d6386c2/038c529153cb478499cdab98e31ef61b/FLAG1773c408f [2025-02-07 17:12:29,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49d6386c2/038c529153cb478499cdab98e31ef61b [2025-02-07 17:12:29,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:12:29,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:12:29,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:12:29,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:12:29,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:12:29,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:12:29" (1/1) ... [2025-02-07 17:12:29,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eaf004b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:29, skipping insertion in model container [2025-02-07 17:12:29,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:12:29" (1/1) ... [2025-02-07 17:12:29,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:12:29,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array20_pattern.c[1444,1457] [2025-02-07 17:12:29,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:12:29,715 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:12:29,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array20_pattern.c[1444,1457] [2025-02-07 17:12:29,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:12:29,741 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:12:29,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:29 WrapperNode [2025-02-07 17:12:29,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:12:29,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:12:29,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:12:29,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:12:29,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:29" (1/1) ... [2025-02-07 17:12:29,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:29" (1/1) ... [2025-02-07 17:12:29,761 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2025-02-07 17:12:29,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:12:29,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:12:29,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:12:29,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:12:29,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:29" (1/1) ... [2025-02-07 17:12:29,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:29" (1/1) ... [2025-02-07 17:12:29,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:29" (1/1) ... [2025-02-07 17:12:29,775 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-07 17:12:29,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:29" (1/1) ... [2025-02-07 17:12:29,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:29" (1/1) ... [2025-02-07 17:12:29,782 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:29" (1/1) ... [2025-02-07 17:12:29,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:29" (1/1) ... [2025-02-07 17:12:29,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:29" (1/1) ... [2025-02-07 17:12:29,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:29" (1/1) ... [2025-02-07 17:12:29,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:12:29,785 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:12:29,785 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:12:29,786 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:12:29,786 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:29" (1/1) ... [2025-02-07 17:12:29,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:12:29,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:12:29,816 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-07 17:12:29,820 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-07 17:12:29,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:12:29,847 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 17:12:29,847 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 17:12:29,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:12:29,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 17:12:29,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 17:12:29,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 17:12:29,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 17:12:29,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:12:29,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:12:29,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 17:12:29,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 17:12:29,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 17:12:29,904 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:12:29,905 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:12:30,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45: call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2025-02-07 17:12:30,053 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-02-07 17:12:30,053 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:12:30,061 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:12:30,061 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:12:30,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:12:30 BoogieIcfgContainer [2025-02-07 17:12:30,062 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:12:30,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:12:30,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:12:30,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:12:30,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:12:29" (1/3) ... [2025-02-07 17:12:30,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2709a791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:12:30, skipping insertion in model container [2025-02-07 17:12:30,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:12:29" (2/3) ... [2025-02-07 17:12:30,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2709a791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:12:30, skipping insertion in model container [2025-02-07 17:12:30,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:12:30" (3/3) ... [2025-02-07 17:12:30,068 INFO L128 eAbstractionObserver]: Analyzing ICFG array20_pattern.c [2025-02-07 17:12:30,077 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:12:30,078 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array20_pattern.c that has 2 procedures, 27 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-07 17:12:30,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:12:30,118 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;@6266a215, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:12:30,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:12:30,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 17:12:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 17:12:30,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:12:30,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:12:30,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:12:30,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:12:30,133 INFO L85 PathProgramCache]: Analyzing trace with hash -340771675, now seen corresponding path program 1 times [2025-02-07 17:12:30,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:12:30,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686292925] [2025-02-07 17:12:30,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:12:30,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:12:30,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 17:12:30,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 17:12:30,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:12:30,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:30,221 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-07 17:12:30,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:12:30,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686292925] [2025-02-07 17:12:30,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686292925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:12:30,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:12:30,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 17:12:30,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481250968] [2025-02-07 17:12:30,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:12:30,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 17:12:30,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:12:30,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 17:12:30,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 17:12:30,241 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 17:12:30,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:12:30,255 INFO L93 Difference]: Finished difference Result 52 states and 76 transitions. [2025-02-07 17:12:30,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 17:12:30,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-07 17:12:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:12:30,261 INFO L225 Difference]: With dead ends: 52 [2025-02-07 17:12:30,261 INFO L226 Difference]: Without dead ends: 23 [2025-02-07 17:12:30,263 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-07 17:12:30,265 INFO L435 NwaCegarLoop]: 35 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, 35 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-07 17:12:30,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:12:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-07 17:12:30,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-07 17:12:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 17:12:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-02-07 17:12:30,289 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 13 [2025-02-07 17:12:30,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:12:30,289 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-02-07 17:12:30,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 17:12:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2025-02-07 17:12:30,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-07 17:12:30,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:12:30,291 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:12:30,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:12:30,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:12:30,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:12:30,293 INFO L85 PathProgramCache]: Analyzing trace with hash 956768038, now seen corresponding path program 1 times [2025-02-07 17:12:30,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:12:30,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202724843] [2025-02-07 17:12:30,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:12:30,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:12:30,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-07 17:12:30,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 17:12:30,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:12:30,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:12:30,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:12:30,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202724843] [2025-02-07 17:12:30,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202724843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:12:30,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:12:30,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:12:30,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258058880] [2025-02-07 17:12:30,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:12:30,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:12:30,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:12:30,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:12:30,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:12:30,550 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 17:12:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:12:30,564 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2025-02-07 17:12:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:12:30,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-02-07 17:12:30,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:12:30,565 INFO L225 Difference]: With dead ends: 28 [2025-02-07 17:12:30,565 INFO L226 Difference]: Without dead ends: 25 [2025-02-07 17:12:30,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:12:30,565 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:12:30,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 68 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:12:30,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-07 17:12:30,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-07 17:12:30,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 17:12:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-02-07 17:12:30,589 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 28 [2025-02-07 17:12:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:12:30,590 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-02-07 17:12:30,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 17:12:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-02-07 17:12:30,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-07 17:12:30,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:12:30,590 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:12:30,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 17:12:30,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:12:30,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:12:30,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1763352382, now seen corresponding path program 1 times [2025-02-07 17:12:30,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:12:30,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181466121] [2025-02-07 17:12:30,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:12:30,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:12:30,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-07 17:12:30,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 17:12:30,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:12:30,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 17:12:30,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:12:30,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181466121] [2025-02-07 17:12:30,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181466121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:12:30,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:12:30,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 17:12:30,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464680206] [2025-02-07 17:12:30,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:12:30,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 17:12:30,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:12:30,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 17:12:30,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:12:30,693 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 17:12:30,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:12:30,754 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2025-02-07 17:12:30,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 17:12:30,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2025-02-07 17:12:30,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:12:30,755 INFO L225 Difference]: With dead ends: 51 [2025-02-07 17:12:30,755 INFO L226 Difference]: Without dead ends: 30 [2025-02-07 17:12:30,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:12:30,756 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:12:30,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 44 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:12:30,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-07 17:12:30,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2025-02-07 17:12:30,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 17:12:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-02-07 17:12:30,759 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 31 [2025-02-07 17:12:30,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:12:30,759 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-02-07 17:12:30,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 17:12:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-02-07 17:12:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 17:12:30,760 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:12:30,760 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:12:30,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 17:12:30,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:12:30,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:12:30,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1811032412, now seen corresponding path program 1 times [2025-02-07 17:12:30,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:12:30,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723989532] [2025-02-07 17:12:30,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:12:30,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:12:30,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 17:12:30,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 17:12:30,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:12:30,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 17:12:30,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:12:30,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723989532] [2025-02-07 17:12:30,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723989532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:12:30,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:12:30,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:12:30,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129858460] [2025-02-07 17:12:30,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:12:30,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:12:30,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:12:30,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:12:30,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:12:30,852 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 17:12:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:12:30,890 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2025-02-07 17:12:30,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:12:30,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-02-07 17:12:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:12:30,890 INFO L225 Difference]: With dead ends: 51 [2025-02-07 17:12:30,890 INFO L226 Difference]: Without dead ends: 29 [2025-02-07 17:12:30,891 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-07 17:12:30,891 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:12:30,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 56 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:12:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-07 17:12:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-02-07 17:12:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 17:12:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-02-07 17:12:30,895 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 33 [2025-02-07 17:12:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:12:30,895 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-02-07 17:12:30,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 17:12:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-02-07 17:12:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-07 17:12:30,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:12:30,896 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:12:30,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 17:12:30,896 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:12:30,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:12:30,897 INFO L85 PathProgramCache]: Analyzing trace with hash -351874274, now seen corresponding path program 1 times [2025-02-07 17:12:30,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:12:30,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050576505] [2025-02-07 17:12:30,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:12:30,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:12:30,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 17:12:30,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 17:12:30,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:12:30,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 17:12:30,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1267086235] [2025-02-07 17:12:30,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:12:30,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:12:30,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:12:30,932 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-07 17:12:30,936 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-07 17:12:30,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 17:12:31,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 17:12:31,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:12:31,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:31,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-07 17:12:31,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:12:31,125 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-07 17:12:31,443 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2025-02-07 17:12:31,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 18 [2025-02-07 17:12:31,513 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-07 17:12:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:12:31,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:12:43,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:12:43,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050576505] [2025-02-07 17:12:43,827 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 17:12:43,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267086235] [2025-02-07 17:12:43,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267086235] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:12:43,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:12:43,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2025-02-07 17:12:43,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227990917] [2025-02-07 17:12:43,828 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-07 17:12:43,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-07 17:12:43,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:12:43,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-07 17:12:43,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2025-02-07 17:12:43,829 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 17:12:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:12:44,328 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2025-02-07 17:12:44,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-07 17:12:44,329 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-02-07 17:12:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:12:44,330 INFO L225 Difference]: With dead ends: 80 [2025-02-07 17:12:44,330 INFO L226 Difference]: Without dead ends: 59 [2025-02-07 17:12:44,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=208, Invalid=1352, Unknown=0, NotChecked=0, Total=1560 [2025-02-07 17:12:44,331 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 48 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 17:12:44,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 150 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 17:12:44,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-07 17:12:44,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2025-02-07 17:12:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 17:12:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2025-02-07 17:12:44,338 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 34 [2025-02-07 17:12:44,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:12:44,338 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2025-02-07 17:12:44,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 17:12:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2025-02-07 17:12:44,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-07 17:12:44,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:12:44,339 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:12:44,346 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-07 17:12:44,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:12:44,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:12:44,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:12:44,544 INFO L85 PathProgramCache]: Analyzing trace with hash -222791555, now seen corresponding path program 1 times [2025-02-07 17:12:44,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:12:44,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000231733] [2025-02-07 17:12:44,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:12:44,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:12:44,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 17:12:44,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 17:12:44,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:12:44,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-07 17:12:44,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:12:44,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000231733] [2025-02-07 17:12:44,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000231733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:12:44,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:12:44,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:12:44,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230631516] [2025-02-07 17:12:44,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:12:44,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:12:44,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:12:44,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:12:44,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:12:44,577 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 17:12:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:12:44,612 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2025-02-07 17:12:44,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:12:44,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2025-02-07 17:12:44,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:12:44,613 INFO L225 Difference]: With dead ends: 74 [2025-02-07 17:12:44,613 INFO L226 Difference]: Without dead ends: 54 [2025-02-07 17:12:44,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:12:44,613 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:12:44,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:12:44,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-07 17:12:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2025-02-07 17:12:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 17:12:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2025-02-07 17:12:44,624 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 34 [2025-02-07 17:12:44,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:12:44,625 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2025-02-07 17:12:44,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 17:12:44,625 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2025-02-07 17:12:44,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-07 17:12:44,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:12:44,626 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:12:44,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 17:12:44,626 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:12:44,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:12:44,627 INFO L85 PathProgramCache]: Analyzing trace with hash -419305060, now seen corresponding path program 1 times [2025-02-07 17:12:44,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:12:44,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361304329] [2025-02-07 17:12:44,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:12:44,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:12:44,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 17:12:44,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 17:12:44,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:12:44,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 17:12:44,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:12:44,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361304329] [2025-02-07 17:12:44,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361304329] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:12:44,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951603592] [2025-02-07 17:12:44,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:12:44,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:12:44,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:12:44,904 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-07 17:12:44,905 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-07 17:12:44,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 17:12:44,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 17:12:44,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:12:44,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:44,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-07 17:12:44,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:12:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 17:12:45,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:12:45,200 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-07 17:12:45,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951603592] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:12:45,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:12:45,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24 [2025-02-07 17:12:45,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759027231] [2025-02-07 17:12:45,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:12:45,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-07 17:12:45,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:12:45,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-07 17:12:45,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2025-02-07 17:12:45,202 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 24 states, 20 states have (on average 2.1) internal successors, (42), 17 states have internal predecessors, (42), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-07 17:12:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:12:45,633 INFO L93 Difference]: Finished difference Result 205 states and 280 transitions. [2025-02-07 17:12:45,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-07 17:12:45,634 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.1) internal successors, (42), 17 states have internal predecessors, (42), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 34 [2025-02-07 17:12:45,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:12:45,636 INFO L225 Difference]: With dead ends: 205 [2025-02-07 17:12:45,636 INFO L226 Difference]: Without dead ends: 162 [2025-02-07 17:12:45,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=1042, Unknown=0, NotChecked=0, Total=1332 [2025-02-07 17:12:45,637 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 131 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 17:12:45,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 176 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 17:12:45,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-07 17:12:45,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 95. [2025-02-07 17:12:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 81 states have internal predecessors, (105), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 17:12:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2025-02-07 17:12:45,654 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 34 [2025-02-07 17:12:45,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:12:45,654 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2025-02-07 17:12:45,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.1) internal successors, (42), 17 states have internal predecessors, (42), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-07 17:12:45,654 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2025-02-07 17:12:45,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 17:12:45,655 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:12:45,655 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:12:45,663 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-07 17:12:45,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:12:45,859 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:12:45,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:12:45,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1977754664, now seen corresponding path program 2 times [2025-02-07 17:12:45,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:12:45,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896610238] [2025-02-07 17:12:45,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:12:45,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:12:45,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-07 17:12:45,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 17:12:45,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:12:45,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:12:45,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:12:45,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896610238] [2025-02-07 17:12:45,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896610238] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:12:45,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036741552] [2025-02-07 17:12:45,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:12:45,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:12:45,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:12:45,959 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-07 17:12:45,960 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-07 17:12:45,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-07 17:12:46,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 17:12:46,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:12:46,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:46,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:12:46,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:12:46,058 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 17:12:46,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:12:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:12:46,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036741552] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:12:46,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:12:46,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-07 17:12:46,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450248478] [2025-02-07 17:12:46,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:12:46,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 17:12:46,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:12:46,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 17:12:46,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-07 17:12:46,096 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:12:46,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:12:46,179 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2025-02-07 17:12:46,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 17:12:46,179 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2025-02-07 17:12:46,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:12:46,180 INFO L225 Difference]: With dead ends: 140 [2025-02-07 17:12:46,180 INFO L226 Difference]: Without dead ends: 98 [2025-02-07 17:12:46,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-02-07 17:12:46,182 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:12:46,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 76 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:12:46,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-07 17:12:46,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2025-02-07 17:12:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 81 states have internal predecessors, (101), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 17:12:46,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 119 transitions. [2025-02-07 17:12:46,198 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 119 transitions. Word has length 35 [2025-02-07 17:12:46,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:12:46,198 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 119 transitions. [2025-02-07 17:12:46,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:12:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 119 transitions. [2025-02-07 17:12:46,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 17:12:46,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:12:46,199 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:12:46,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 17:12:46,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:12:46,400 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:12:46,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:12:46,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1317495196, now seen corresponding path program 3 times [2025-02-07 17:12:46,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:12:46,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480648766] [2025-02-07 17:12:46,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:12:46,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:12:46,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 5 equivalence classes. [2025-02-07 17:12:46,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 17:12:46,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-07 17:12:46,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 17:12:46,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:12:46,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480648766] [2025-02-07 17:12:46,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480648766] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:12:46,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137097019] [2025-02-07 17:12:46,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:12:46,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:12:46,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:12:46,496 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-07 17:12:46,497 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-07 17:12:46,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 5 equivalence classes. [2025-02-07 17:12:46,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 35 statements. [2025-02-07 17:12:46,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-07 17:12:46,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:46,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-07 17:12:46,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:12:46,895 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 71 treesize of output 58 [2025-02-07 17:12:46,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 134 [2025-02-07 17:12:47,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:12:47,084 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 19 [2025-02-07 17:12:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-07 17:12:47,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:12:47,414 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 138 treesize of output 130 [2025-02-07 17:12:47,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:12:47,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 329 [2025-02-07 17:12:47,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:12:47,598 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 368 treesize of output 352 [2025-02-07 17:12:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 17:12:48,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137097019] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:12:48,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:12:48,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 18, 15] total 37 [2025-02-07 17:12:48,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735967485] [2025-02-07 17:12:48,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:12:48,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-07 17:12:48,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:12:48,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-07 17:12:48,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1145, Unknown=0, NotChecked=0, Total=1332 [2025-02-07 17:12:48,094 INFO L87 Difference]: Start difference. First operand 95 states and 119 transitions. Second operand has 37 states, 35 states have (on average 2.0) internal successors, (70), 35 states have internal predecessors, (70), 5 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-07 17:12:51,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-07 17:12:51,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:12:51,513 INFO L93 Difference]: Finished difference Result 203 states and 257 transitions. [2025-02-07 17:12:51,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-02-07 17:12:51,513 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 2.0) internal successors, (70), 35 states have internal predecessors, (70), 5 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 35 [2025-02-07 17:12:51,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:12:51,514 INFO L225 Difference]: With dead ends: 203 [2025-02-07 17:12:51,515 INFO L226 Difference]: Without dead ends: 142 [2025-02-07 17:12:51,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1270 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=926, Invalid=4624, Unknown=0, NotChecked=0, Total=5550 [2025-02-07 17:12:51,522 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 171 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-07 17:12:51,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 260 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-07 17:12:51,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-07 17:12:51,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 69. [2025-02-07 17:12:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 59 states have internal predecessors, (72), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 17:12:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2025-02-07 17:12:51,552 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 35 [2025-02-07 17:12:51,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:12:51,556 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2025-02-07 17:12:51,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 2.0) internal successors, (70), 35 states have internal predecessors, (70), 5 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-07 17:12:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2025-02-07 17:12:51,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-07 17:12:51,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:12:51,556 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:12:51,565 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-07 17:12:51,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-07 17:12:51,759 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:12:51,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:12:51,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1418381382, now seen corresponding path program 4 times [2025-02-07 17:12:51,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:12:51,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734426031] [2025-02-07 17:12:51,760 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:12:51,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:12:51,773 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-02-07 17:12:51,780 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 37 statements. [2025-02-07 17:12:51,781 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 17:12:51,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 17:12:51,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:12:51,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734426031] [2025-02-07 17:12:51,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734426031] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:12:51,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183982463] [2025-02-07 17:12:51,838 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:12:51,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:12:51,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:12:51,840 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-07 17:12:51,844 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-07 17:12:51,875 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-02-07 17:12:51,883 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 37 statements. [2025-02-07 17:12:51,883 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 17:12:51,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:51,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:12:51,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:12:51,928 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-07 17:12:51,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:12:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 17:12:51,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183982463] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:12:51,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:12:51,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-07 17:12:51,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487983037] [2025-02-07 17:12:51,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:12:51,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 17:12:51,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:12:51,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 17:12:51,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-07 17:12:51,966 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:12:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:12:52,057 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2025-02-07 17:12:52,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 17:12:52,057 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2025-02-07 17:12:52,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:12:52,058 INFO L225 Difference]: With dead ends: 79 [2025-02-07 17:12:52,058 INFO L226 Difference]: Without dead ends: 46 [2025-02-07 17:12:52,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-07 17:12:52,059 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:12:52,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 70 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:12:52,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-07 17:12:52,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2025-02-07 17:12:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 17:12:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2025-02-07 17:12:52,070 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 37 [2025-02-07 17:12:52,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:12:52,070 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2025-02-07 17:12:52,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:12:52,071 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2025-02-07 17:12:52,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-07 17:12:52,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:12:52,071 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:12:52,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 17:12:52,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-07 17:12:52,272 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:12:52,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:12:52,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2117025528, now seen corresponding path program 5 times [2025-02-07 17:12:52,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:12:52,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675682842] [2025-02-07 17:12:52,273 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:12:52,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:12:52,279 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 5 equivalence classes. [2025-02-07 17:12:52,284 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 16 of 38 statements. [2025-02-07 17:12:52,284 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-07 17:12:52,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-07 17:12:52,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:12:52,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675682842] [2025-02-07 17:12:52,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675682842] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:12:52,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918845302] [2025-02-07 17:12:52,326 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:12:52,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:12:52,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:12:52,328 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-07 17:12:52,330 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-07 17:12:52,360 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 5 equivalence classes. [2025-02-07 17:12:52,368 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 16 of 38 statements. [2025-02-07 17:12:52,368 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-07 17:12:52,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:52,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:12:52,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:12:52,403 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 17:12:52,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:12:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-07 17:12:52,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918845302] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:12:52,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:12:52,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-07 17:12:52,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926561635] [2025-02-07 17:12:52,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:12:52,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 17:12:52,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:12:52,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 17:12:52,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-07 17:12:52,432 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:12:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:12:52,533 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2025-02-07 17:12:52,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 17:12:52,534 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2025-02-07 17:12:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:12:52,534 INFO L225 Difference]: With dead ends: 84 [2025-02-07 17:12:52,534 INFO L226 Difference]: Without dead ends: 53 [2025-02-07 17:12:52,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-02-07 17:12:52,535 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:12:52,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 118 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:12:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-07 17:12:52,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2025-02-07 17:12:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 17:12:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2025-02-07 17:12:52,541 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 38 [2025-02-07 17:12:52,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:12:52,542 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2025-02-07 17:12:52,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:12:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2025-02-07 17:12:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-07 17:12:52,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:12:52,542 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:12:52,548 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-07 17:12:52,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-07 17:12:52,743 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:12:52,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:12:52,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1282131734, now seen corresponding path program 6 times [2025-02-07 17:12:52,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:12:52,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576230202] [2025-02-07 17:12:52,743 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 17:12:52,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:12:52,749 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 7 equivalence classes. [2025-02-07 17:12:52,780 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 17:12:52,784 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-07 17:12:52,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-07 17:12:52,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:12:52,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576230202] [2025-02-07 17:12:52,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576230202] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:12:52,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878699227] [2025-02-07 17:12:52,898 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 17:12:52,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:12:52,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:12:52,900 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-07 17:12:52,901 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-07 17:12:52,934 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 7 equivalence classes. [2025-02-07 17:12:53,206 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 17:12:53,206 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-07 17:12:53,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:53,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:12:53,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:12:53,251 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:12:53,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:12:53,296 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-07 17:12:53,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878699227] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:12:53,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:12:53,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-02-07 17:12:53,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483949785] [2025-02-07 17:12:53,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:12:53,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 17:12:53,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:12:53,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 17:12:53,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 17:12:53,298 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:12:53,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:12:53,390 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-02-07 17:12:53,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 17:12:53,390 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2025-02-07 17:12:53,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:12:53,391 INFO L225 Difference]: With dead ends: 50 [2025-02-07 17:12:53,391 INFO L226 Difference]: Without dead ends: 43 [2025-02-07 17:12:53,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2025-02-07 17:12:53,391 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:12:53,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 57 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:12:53,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-07 17:12:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-07 17:12:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 17:12:53,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2025-02-07 17:12:53,396 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 42 [2025-02-07 17:12:53,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:12:53,397 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2025-02-07 17:12:53,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 17:12:53,397 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2025-02-07 17:12:53,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-07 17:12:53,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:12:53,397 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:12:53,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-07 17:12:53,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:12:53,602 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:12:53,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:12:53,602 INFO L85 PathProgramCache]: Analyzing trace with hash 446982062, now seen corresponding path program 7 times [2025-02-07 17:12:53,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:12:53,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457231398] [2025-02-07 17:12:53,602 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 17:12:53,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:12:53,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-07 17:12:53,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 17:12:53,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:12:53,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 17:12:53,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1139903192] [2025-02-07 17:12:53,621 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 17:12:53,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:12:53,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:12:53,626 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-07 17:12:53,627 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-07 17:12:53,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-07 17:12:53,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 17:12:53,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:12:53,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:12:53,815 WARN L254 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-02-07 17:12:53,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:12:53,899 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-07 17:12:53,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 17:12:54,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:12:54,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 17:12:54,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:12:54,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-02-07 17:12:54,532 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-02-07 17:12:54,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 172 [2025-02-07 17:12:54,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,590 INFO L349 Elim1Store]: treesize reduction 74, result has 1.3 percent of original size [2025-02-07 17:12:54,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 4 select indices, 4 select index equivalence classes, 26 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 549 [2025-02-07 17:12:54,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,647 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:12:54,648 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:12:54,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,660 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:12:54,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,673 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:12:54,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,685 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:12:54,694 INFO L349 Elim1Store]: treesize reduction 74, result has 1.3 percent of original size [2025-02-07 17:12:54,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 36 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 170 treesize of output 316 [2025-02-07 17:12:54,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,749 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:12:54,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,758 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:12:54,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,769 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:12:54,778 INFO L349 Elim1Store]: treesize reduction 82, result has 1.2 percent of original size [2025-02-07 17:12:54,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 25 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 142 [2025-02-07 17:12:54,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:54,802 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-07 17:12:54,828 INFO L349 Elim1Store]: treesize reduction 44, result has 47.0 percent of original size [2025-02-07 17:12:54,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 162 treesize of output 162 [2025-02-07 17:12:54,996 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 117 treesize of output 95 [2025-02-07 17:12:55,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:55,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:55,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:55,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:55,012 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2025-02-07 17:12:55,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 95 treesize of output 182 [2025-02-07 17:12:55,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:55,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:55,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:55,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:55,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:55,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:55,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:55,178 INFO L349 Elim1Store]: treesize reduction 65, result has 32.3 percent of original size [2025-02-07 17:12:55,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 212 [2025-02-07 17:12:55,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:55,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:55,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:55,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:55,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:55,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:55,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 17:12:55,384 INFO L349 Elim1Store]: treesize reduction 68, result has 9.3 percent of original size [2025-02-07 17:12:55,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 57 [2025-02-07 17:12:56,358 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 134 treesize of output 108 [2025-02-07 17:12:56,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:12:56,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 123 treesize of output 161 [2025-02-07 17:12:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:12:56,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:12,258 WARN L286 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-07 17:13:17,949 WARN L286 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-07 17:13:29,692 WARN L286 SmtUtils]: Spent 11.74s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-07 17:13:37,199 WARN L286 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)