./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label53.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label53.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 f141a301b31229dd66a7cd564eee9643a79b3eee13542a71eb8c2449d9b4afb4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:09:14,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:09:14,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:09:14,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:09:14,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:09:14,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:09:14,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:09:14,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:09:14,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:09:14,301 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:09:14,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:09:14,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:09:14,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:09:14,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:09:14,301 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:09:14,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:09:14,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:09:14,301 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:09:14,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:09:14,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:09:14,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:09:14,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:09:14,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:09:14,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:09:14,302 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:09:14,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:09:14,302 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:09:14,302 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:09:14,302 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:09:14,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:09:14,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:09:14,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:09:14,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:09:14,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:09:14,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:09:14,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:09:14,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:09:14,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:09:14,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:09:14,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:09:14,304 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:09:14,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:09:14,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:09:14,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:09:14,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:09:14,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:09:14,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:09:14,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:09:14,304 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 -> f141a301b31229dd66a7cd564eee9643a79b3eee13542a71eb8c2449d9b4afb4 [2025-01-09 00:09:14,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:09:14,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:09:14,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:09:14,538 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:09:14,538 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:09:14,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label53.c [2025-01-09 00:09:15,614 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b02708683/c41a7eea628a48bb950910be261d0a01/FLAG01cddd488 [2025-01-09 00:09:16,031 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:09:16,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label53.c [2025-01-09 00:09:16,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b02708683/c41a7eea628a48bb950910be261d0a01/FLAG01cddd488 [2025-01-09 00:09:16,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b02708683/c41a7eea628a48bb950910be261d0a01 [2025-01-09 00:09:16,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:09:16,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:09:16,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:09:16,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:09:16,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:09:16,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:09:16" (1/1) ... [2025-01-09 00:09:16,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ceaecac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:16, skipping insertion in model container [2025-01-09 00:09:16,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:09:16" (1/1) ... [2025-01-09 00:09:16,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:09:16,409 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/eca-rers2012/Problem16_label53.c[4014,4027] [2025-01-09 00:09:16,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:09:16,658 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:09:16,669 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/eca-rers2012/Problem16_label53.c[4014,4027] [2025-01-09 00:09:16,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:09:16,786 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:09:16,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:16 WrapperNode [2025-01-09 00:09:16,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:09:16,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:09:16,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:09:16,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:09:16,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:16" (1/1) ... [2025-01-09 00:09:16,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:16" (1/1) ... [2025-01-09 00:09:16,930 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-01-09 00:09:16,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:09:16,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:09:16,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:09:16,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:09:16,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:16" (1/1) ... [2025-01-09 00:09:16,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:16" (1/1) ... [2025-01-09 00:09:16,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:16" (1/1) ... [2025-01-09 00:09:17,054 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:09:17,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:16" (1/1) ... [2025-01-09 00:09:17,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:16" (1/1) ... [2025-01-09 00:09:17,101 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:16" (1/1) ... [2025-01-09 00:09:17,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:16" (1/1) ... [2025-01-09 00:09:17,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:16" (1/1) ... [2025-01-09 00:09:17,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:16" (1/1) ... [2025-01-09 00:09:17,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:16" (1/1) ... [2025-01-09 00:09:17,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:09:17,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:09:17,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:09:17,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:09:17,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:16" (1/1) ... [2025-01-09 00:09:17,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:09:17,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:09:17,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:09:17,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:09:17,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:09:17,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:09:17,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:09:17,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:09:17,260 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:09:17,261 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:09:19,046 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-01-09 00:09:19,047 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:09:19,059 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:09:19,059 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:09:19,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:09:19 BoogieIcfgContainer [2025-01-09 00:09:19,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:09:19,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:09:19,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:09:19,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:09:19,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:09:16" (1/3) ... [2025-01-09 00:09:19,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cdac0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:09:19, skipping insertion in model container [2025-01-09 00:09:19,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:16" (2/3) ... [2025-01-09 00:09:19,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cdac0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:09:19, skipping insertion in model container [2025-01-09 00:09:19,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:09:19" (3/3) ... [2025-01-09 00:09:19,066 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label53.c [2025-01-09 00:09:19,077 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:09:19,078 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label53.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:09:19,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:09:19,128 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;@1789bb2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:09:19,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:09:19,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:19,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 00:09:19,136 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:19,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:19,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:19,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:19,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1047782724, now seen corresponding path program 1 times [2025-01-09 00:09:19,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:19,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952498794] [2025-01-09 00:09:19,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:19,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:19,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 00:09:19,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 00:09:19,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:19,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:09:19,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:19,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952498794] [2025-01-09 00:09:19,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952498794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:19,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:19,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:09:19,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601291559] [2025-01-09 00:09:19,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:19,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:19,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:19,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:19,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:19,390 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:20,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:20,900 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-01-09 00:09:20,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:20,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 00:09:20,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:20,910 INFO L225 Difference]: With dead ends: 1122 [2025-01-09 00:09:20,910 INFO L226 Difference]: Without dead ends: 662 [2025-01-09 00:09:20,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-09 00:09:20,915 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 350 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:20,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 254 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:09:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-01-09 00:09:20,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-01-09 00:09:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.518910741301059) internal successors, (1004), 661 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1004 transitions. [2025-01-09 00:09:20,961 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1004 transitions. Word has length 37 [2025-01-09 00:09:20,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:20,961 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1004 transitions. [2025-01-09 00:09:20,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1004 transitions. [2025-01-09 00:09:20,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 00:09:20,963 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:20,963 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:20,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:09:20,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:20,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:20,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1155634263, now seen corresponding path program 1 times [2025-01-09 00:09:20,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:20,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135510409] [2025-01-09 00:09:20,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:20,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:20,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 00:09:21,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 00:09:21,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:21,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:21,312 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:09:21,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:21,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135510409] [2025-01-09 00:09:21,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135510409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:21,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:21,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:09:21,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618107473] [2025-01-09 00:09:21,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:21,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:09:21,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:21,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:09:21,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:09:21,315 INFO L87 Difference]: Start difference. First operand 662 states and 1004 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:23,196 INFO L93 Difference]: Finished difference Result 2309 states and 3414 transitions. [2025-01-09 00:09:23,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:09:23,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-01-09 00:09:23,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:23,201 INFO L225 Difference]: With dead ends: 2309 [2025-01-09 00:09:23,202 INFO L226 Difference]: Without dead ends: 1649 [2025-01-09 00:09:23,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:09:23,204 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1006 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:23,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 44 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:09:23,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-01-09 00:09:23,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2025-01-09 00:09:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1648 states have (on average 1.4010922330097086) internal successors, (2309), 1648 states have internal predecessors, (2309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:23,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2309 transitions. [2025-01-09 00:09:23,236 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2309 transitions. Word has length 105 [2025-01-09 00:09:23,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:23,237 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2309 transitions. [2025-01-09 00:09:23,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:23,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2309 transitions. [2025-01-09 00:09:23,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-01-09 00:09:23,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:23,243 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:23,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:09:23,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:23,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:23,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1008423921, now seen corresponding path program 1 times [2025-01-09 00:09:23,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:23,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670239350] [2025-01-09 00:09:23,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:23,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:23,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-01-09 00:09:23,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-01-09 00:09:23,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:23,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 00:09:23,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:23,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670239350] [2025-01-09 00:09:23,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670239350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:23,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:23,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:09:23,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019904512] [2025-01-09 00:09:23,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:23,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:23,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:23,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:23,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:23,465 INFO L87 Difference]: Start difference. First operand 1649 states and 2309 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:24,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:24,855 INFO L93 Difference]: Finished difference Result 3625 states and 5239 transitions. [2025-01-09 00:09:24,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:24,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2025-01-09 00:09:24,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:24,865 INFO L225 Difference]: With dead ends: 3625 [2025-01-09 00:09:24,865 INFO L226 Difference]: Without dead ends: 2307 [2025-01-09 00:09:24,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-09 00:09:24,869 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:24,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 77 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:09:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-01-09 00:09:24,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-01-09 00:09:24,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.3490893321769297) internal successors, (3111), 2306 states have internal predecessors, (3111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3111 transitions. [2025-01-09 00:09:24,926 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3111 transitions. Word has length 265 [2025-01-09 00:09:24,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:24,928 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3111 transitions. [2025-01-09 00:09:24,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3111 transitions. [2025-01-09 00:09:24,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-01-09 00:09:24,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:24,932 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:24,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:09:24,932 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:24,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:24,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1724807768, now seen corresponding path program 1 times [2025-01-09 00:09:24,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:24,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088271791] [2025-01-09 00:09:24,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:24,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:24,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-01-09 00:09:24,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-01-09 00:09:24,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:24,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-09 00:09:25,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:25,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088271791] [2025-01-09 00:09:25,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088271791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:25,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:25,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:09:25,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772658127] [2025-01-09 00:09:25,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:25,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:25,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:25,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:25,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:25,171 INFO L87 Difference]: Start difference. First operand 2307 states and 3111 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:26,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:26,178 INFO L93 Difference]: Finished difference Result 5599 states and 7694 transitions. [2025-01-09 00:09:26,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:26,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 300 [2025-01-09 00:09:26,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:26,189 INFO L225 Difference]: With dead ends: 5599 [2025-01-09 00:09:26,189 INFO L226 Difference]: Without dead ends: 3623 [2025-01-09 00:09:26,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-09 00:09:26,193 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:26,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:09:26,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2025-01-09 00:09:26,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3294. [2025-01-09 00:09:26,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 3293 states have (on average 1.2356513817187975) internal successors, (4069), 3293 states have internal predecessors, (4069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:26,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 4069 transitions. [2025-01-09 00:09:26,241 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 4069 transitions. Word has length 300 [2025-01-09 00:09:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:26,242 INFO L471 AbstractCegarLoop]: Abstraction has 3294 states and 4069 transitions. [2025-01-09 00:09:26,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 4069 transitions. [2025-01-09 00:09:26,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-01-09 00:09:26,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:26,252 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:26,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:09:26,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:26,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:26,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1164041035, now seen corresponding path program 1 times [2025-01-09 00:09:26,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:26,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312625663] [2025-01-09 00:09:26,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:26,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:26,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-01-09 00:09:26,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-01-09 00:09:26,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:26,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 701 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-01-09 00:09:26,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:26,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312625663] [2025-01-09 00:09:26,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312625663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:26,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:26,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:09:26,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109456988] [2025-01-09 00:09:26,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:26,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:26,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:26,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:26,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:26,631 INFO L87 Difference]: Start difference. First operand 3294 states and 4069 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:27,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:27,593 INFO L93 Difference]: Finished difference Result 7573 states and 9417 transitions. [2025-01-09 00:09:27,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:27,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 553 [2025-01-09 00:09:27,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:27,604 INFO L225 Difference]: With dead ends: 7573 [2025-01-09 00:09:27,604 INFO L226 Difference]: Without dead ends: 3952 [2025-01-09 00:09:27,608 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-01-09 00:09:27,610 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 286 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:27,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 540 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:09:27,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-01-09 00:09:27,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2025-01-09 00:09:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.072892938496583) internal successors, (4239), 3951 states have internal predecessors, (4239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4239 transitions. [2025-01-09 00:09:27,742 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4239 transitions. Word has length 553 [2025-01-09 00:09:27,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:27,742 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 4239 transitions. [2025-01-09 00:09:27,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:27,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4239 transitions. [2025-01-09 00:09:27,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 826 [2025-01-09 00:09:27,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:27,777 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:27,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:09:27,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:27,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:27,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1610672647, now seen corresponding path program 1 times [2025-01-09 00:09:27,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:27,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730716507] [2025-01-09 00:09:27,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:27,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:27,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 825 statements into 1 equivalence classes. [2025-01-09 00:09:27,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 825 of 825 statements. [2025-01-09 00:09:27,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:27,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:28,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1388 backedges. 1088 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-01-09 00:09:28,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:28,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730716507] [2025-01-09 00:09:28,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730716507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:28,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:28,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:09:28,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910208007] [2025-01-09 00:09:28,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:28,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:28,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:28,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:28,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:28,560 INFO L87 Difference]: Start difference. First operand 3952 states and 4239 transitions. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:29,444 INFO L93 Difference]: Finished difference Result 8889 states and 9584 transitions. [2025-01-09 00:09:29,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:29,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 825 [2025-01-09 00:09:29,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:29,457 INFO L225 Difference]: With dead ends: 8889 [2025-01-09 00:09:29,457 INFO L226 Difference]: Without dead ends: 5268 [2025-01-09 00:09:29,462 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-01-09 00:09:29,464 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 219 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:29,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 428 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:09:29,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2025-01-09 00:09:29,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 5268. [2025-01-09 00:09:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5268 states, 5267 states have (on average 1.0599962027719765) internal successors, (5583), 5267 states have internal predecessors, (5583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 5583 transitions. [2025-01-09 00:09:29,570 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 5583 transitions. Word has length 825 [2025-01-09 00:09:29,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:29,570 INFO L471 AbstractCegarLoop]: Abstraction has 5268 states and 5583 transitions. [2025-01-09 00:09:29,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:29,571 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 5583 transitions. [2025-01-09 00:09:29,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 889 [2025-01-09 00:09:29,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:29,578 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:29,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:09:29,579 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:29,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:29,580 INFO L85 PathProgramCache]: Analyzing trace with hash -589698478, now seen corresponding path program 1 times [2025-01-09 00:09:29,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:29,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336174584] [2025-01-09 00:09:29,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:29,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:29,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 888 statements into 1 equivalence classes. [2025-01-09 00:09:29,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 888 of 888 statements. [2025-01-09 00:09:29,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:29,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1543 backedges. 1086 proven. 0 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2025-01-09 00:09:30,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:30,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336174584] [2025-01-09 00:09:30,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336174584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:30,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:30,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:09:30,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797379975] [2025-01-09 00:09:30,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:30,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:30,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:30,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:30,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:30,014 INFO L87 Difference]: Start difference. First operand 5268 states and 5583 transitions. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:30,771 INFO L93 Difference]: Finished difference Result 11850 states and 12616 transitions. [2025-01-09 00:09:30,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:30,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 888 [2025-01-09 00:09:30,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:30,786 INFO L225 Difference]: With dead ends: 11850 [2025-01-09 00:09:30,786 INFO L226 Difference]: Without dead ends: 6913 [2025-01-09 00:09:30,791 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-01-09 00:09:30,792 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 184 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:30,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 57 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:09:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2025-01-09 00:09:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6584. [2025-01-09 00:09:30,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6583 states have (on average 1.055142032507975) internal successors, (6946), 6583 states have internal predecessors, (6946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 6946 transitions. [2025-01-09 00:09:30,887 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 6946 transitions. Word has length 888 [2025-01-09 00:09:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:30,888 INFO L471 AbstractCegarLoop]: Abstraction has 6584 states and 6946 transitions. [2025-01-09 00:09:30,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 6946 transitions. [2025-01-09 00:09:30,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1254 [2025-01-09 00:09:30,900 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:30,901 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:30,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:09:30,901 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:30,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:30,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1892517226, now seen corresponding path program 1 times [2025-01-09 00:09:30,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:30,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495861934] [2025-01-09 00:09:30,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:30,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:30,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1253 statements into 1 equivalence classes. [2025-01-09 00:09:31,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1253 of 1253 statements. [2025-01-09 00:09:31,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:31,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2845 backedges. 1676 proven. 0 refuted. 0 times theorem prover too weak. 1169 trivial. 0 not checked. [2025-01-09 00:09:31,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:31,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495861934] [2025-01-09 00:09:31,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495861934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:31,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:31,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:09:31,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556341352] [2025-01-09 00:09:31,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:31,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:09:31,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:31,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:09:31,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:09:31,948 INFO L87 Difference]: Start difference. First operand 6584 states and 6946 transitions. Second operand has 4 states, 4 states have (on average 193.5) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:33,138 INFO L93 Difference]: Finished difference Result 18101 states and 19132 transitions. [2025-01-09 00:09:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:09:33,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 193.5) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1253 [2025-01-09 00:09:33,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:33,160 INFO L225 Difference]: With dead ends: 18101 [2025-01-09 00:09:33,161 INFO L226 Difference]: Without dead ends: 11848 [2025-01-09 00:09:33,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:09:33,168 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 268 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:33,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 79 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:09:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2025-01-09 00:09:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 10532. [2025-01-09 00:09:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10532 states, 10531 states have (on average 1.0539359984806762) internal successors, (11099), 10531 states have internal predecessors, (11099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10532 states to 10532 states and 11099 transitions. [2025-01-09 00:09:33,298 INFO L78 Accepts]: Start accepts. Automaton has 10532 states and 11099 transitions. Word has length 1253 [2025-01-09 00:09:33,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:33,300 INFO L471 AbstractCegarLoop]: Abstraction has 10532 states and 11099 transitions. [2025-01-09 00:09:33,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 193.5) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:33,301 INFO L276 IsEmpty]: Start isEmpty. Operand 10532 states and 11099 transitions. [2025-01-09 00:09:33,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1292 [2025-01-09 00:09:33,343 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:33,344 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:33,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:09:33,345 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:33,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:33,346 INFO L85 PathProgramCache]: Analyzing trace with hash -405613608, now seen corresponding path program 1 times [2025-01-09 00:09:33,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:33,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480082184] [2025-01-09 00:09:33,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:33,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:33,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1291 statements into 1 equivalence classes. [2025-01-09 00:09:33,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1291 of 1291 statements. [2025-01-09 00:09:33,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:33,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:35,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3511 backedges. 1605 proven. 156 refuted. 0 times theorem prover too weak. 1750 trivial. 0 not checked. [2025-01-09 00:09:35,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:35,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480082184] [2025-01-09 00:09:35,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480082184] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:09:35,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688525538] [2025-01-09 00:09:35,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:35,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:09:35,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:09:35,031 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:09:35,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:09:35,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1291 statements into 1 equivalence classes. [2025-01-09 00:09:35,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1291 of 1291 statements. [2025-01-09 00:09:35,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:35,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:35,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 1525 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:09:35,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:09:36,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3511 backedges. 1761 proven. 0 refuted. 0 times theorem prover too weak. 1750 trivial. 0 not checked. [2025-01-09 00:09:36,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:09:36,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688525538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:36,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:09:36,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-09 00:09:36,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996406879] [2025-01-09 00:09:36,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:36,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:36,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:36,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:36,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:09:36,169 INFO L87 Difference]: Start difference. First operand 10532 states and 11099 transitions. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:36,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:36,867 INFO L93 Difference]: Finished difference Result 22707 states and 23951 transitions. [2025-01-09 00:09:36,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:36,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1291 [2025-01-09 00:09:36,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:36,886 INFO L225 Difference]: With dead ends: 22707 [2025-01-09 00:09:36,886 INFO L226 Difference]: Without dead ends: 12506 [2025-01-09 00:09:36,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1295 GetRequests, 1290 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:09:36,896 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 173 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:36,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 100 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:09:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2025-01-09 00:09:36,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 11848. [2025-01-09 00:09:36,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.0504769139866632) internal successors, (12445), 11847 states have internal predecessors, (12445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12445 transitions. [2025-01-09 00:09:36,986 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12445 transitions. Word has length 1291 [2025-01-09 00:09:36,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:36,987 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 12445 transitions. [2025-01-09 00:09:36,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:36,987 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12445 transitions. [2025-01-09 00:09:37,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1540 [2025-01-09 00:09:37,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:37,006 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:37,014 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-01-09 00:09:37,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:09:37,210 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:37,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:37,211 INFO L85 PathProgramCache]: Analyzing trace with hash 18206242, now seen corresponding path program 1 times [2025-01-09 00:09:37,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:37,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176514333] [2025-01-09 00:09:37,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:37,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:37,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1539 statements into 1 equivalence classes. [2025-01-09 00:09:37,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1539 of 1539 statements. [2025-01-09 00:09:37,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:37,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:38,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4141 backedges. 2372 proven. 0 refuted. 0 times theorem prover too weak. 1769 trivial. 0 not checked. [2025-01-09 00:09:38,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:38,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176514333] [2025-01-09 00:09:38,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176514333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:38,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:38,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:09:38,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744177117] [2025-01-09 00:09:38,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:38,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:38,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:38,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:38,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:38,107 INFO L87 Difference]: Start difference. First operand 11848 states and 12445 transitions. Second operand has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:38,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:38,800 INFO L93 Difference]: Finished difference Result 25997 states and 27372 transitions. [2025-01-09 00:09:38,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:38,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1539 [2025-01-09 00:09:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:38,823 INFO L225 Difference]: With dead ends: 25997 [2025-01-09 00:09:38,823 INFO L226 Difference]: Without dead ends: 14151 [2025-01-09 00:09:38,877 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-01-09 00:09:38,878 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:38,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 426 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:09:38,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2025-01-09 00:09:38,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 13822. [2025-01-09 00:09:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.042399247521887) internal successors, (14407), 13821 states have internal predecessors, (14407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14407 transitions. [2025-01-09 00:09:38,977 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14407 transitions. Word has length 1539 [2025-01-09 00:09:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:38,978 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14407 transitions. [2025-01-09 00:09:38,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14407 transitions. [2025-01-09 00:09:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1558 [2025-01-09 00:09:38,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:38,997 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:38,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:09:38,997 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:38,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:38,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1366806991, now seen corresponding path program 1 times [2025-01-09 00:09:38,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:38,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216365072] [2025-01-09 00:09:38,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:38,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:39,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1557 statements into 1 equivalence classes. [2025-01-09 00:09:39,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1557 of 1557 statements. [2025-01-09 00:09:39,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:39,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4175 backedges. 2693 proven. 236 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2025-01-09 00:09:40,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:40,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216365072] [2025-01-09 00:09:40,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216365072] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:09:40,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961442574] [2025-01-09 00:09:40,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:40,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:09:40,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:09:40,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:09:40,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:09:40,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1557 statements into 1 equivalence classes. [2025-01-09 00:09:40,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1557 of 1557 statements. [2025-01-09 00:09:40,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:40,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:40,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 1808 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:09:40,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:09:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4175 backedges. 1505 proven. 0 refuted. 0 times theorem prover too weak. 2670 trivial. 0 not checked. [2025-01-09 00:09:41,153 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:09:41,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961442574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:41,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:09:41,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 00:09:41,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805697337] [2025-01-09 00:09:41,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:41,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:41,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:41,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:41,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:09:41,155 INFO L87 Difference]: Start difference. First operand 13822 states and 14407 transitions. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:41,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:41,854 INFO L93 Difference]: Finished difference Result 27642 states and 28812 transitions. [2025-01-09 00:09:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:41,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1557 [2025-01-09 00:09:41,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:41,875 INFO L225 Difference]: With dead ends: 27642 [2025-01-09 00:09:41,876 INFO L226 Difference]: Without dead ends: 13822 [2025-01-09 00:09:41,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1562 GetRequests, 1557 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:09:41,888 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 47 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:41,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 416 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:09:41,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2025-01-09 00:09:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13493. [2025-01-09 00:09:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.0356507560035577) internal successors, (13973), 13492 states have internal predecessors, (13973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:42,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13973 transitions. [2025-01-09 00:09:42,086 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13973 transitions. Word has length 1557 [2025-01-09 00:09:42,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:42,087 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 13973 transitions. [2025-01-09 00:09:42,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:42,087 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13973 transitions. [2025-01-09 00:09:42,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2025-01-09 00:09:42,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:42,177 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:42,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 00:09:42,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:09:42,378 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:42,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:42,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1972892039, now seen corresponding path program 1 times [2025-01-09 00:09:42,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:42,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748433284] [2025-01-09 00:09:42,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:42,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:42,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1624 statements into 1 equivalence classes. [2025-01-09 00:09:42,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1624 of 1624 statements. [2025-01-09 00:09:42,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:42,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4315 backedges. 3011 proven. 0 refuted. 0 times theorem prover too weak. 1304 trivial. 0 not checked. [2025-01-09 00:09:43,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:43,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748433284] [2025-01-09 00:09:43,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748433284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:43,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:43,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:09:43,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301426959] [2025-01-09 00:09:43,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:43,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:43,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:43,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:43,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:43,745 INFO L87 Difference]: Start difference. First operand 13493 states and 13973 transitions. Second operand has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:44,507 INFO L93 Difference]: Finished difference Result 26984 states and 27944 transitions. [2025-01-09 00:09:44,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:44,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1624 [2025-01-09 00:09:44,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:44,525 INFO L225 Difference]: With dead ends: 26984 [2025-01-09 00:09:44,525 INFO L226 Difference]: Without dead ends: 13493 [2025-01-09 00:09:44,535 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-01-09 00:09:44,536 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 62 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:44,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 434 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:09:44,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2025-01-09 00:09:44,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13493. [2025-01-09 00:09:44,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.0355025200118588) internal successors, (13971), 13492 states have internal predecessors, (13971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:44,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13971 transitions. [2025-01-09 00:09:44,642 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13971 transitions. Word has length 1624 [2025-01-09 00:09:44,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:44,643 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 13971 transitions. [2025-01-09 00:09:44,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:44,643 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13971 transitions. [2025-01-09 00:09:44,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1712 [2025-01-09 00:09:44,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:44,664 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:44,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:09:44,664 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:44,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:44,665 INFO L85 PathProgramCache]: Analyzing trace with hash -246010477, now seen corresponding path program 1 times [2025-01-09 00:09:44,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:44,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681023562] [2025-01-09 00:09:44,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:44,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:44,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1711 statements into 1 equivalence classes. [2025-01-09 00:09:44,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1711 of 1711 statements. [2025-01-09 00:09:44,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:44,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5729 backedges. 4291 proven. 132 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2025-01-09 00:09:46,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:46,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681023562] [2025-01-09 00:09:46,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681023562] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:09:46,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29509296] [2025-01-09 00:09:46,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:46,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:09:46,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:09:46,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:09:46,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:09:46,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1711 statements into 1 equivalence classes. [2025-01-09 00:09:46,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1711 of 1711 statements. [2025-01-09 00:09:46,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:46,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:46,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 1997 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:09:46,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:09:46,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5729 backedges. 2865 proven. 0 refuted. 0 times theorem prover too weak. 2864 trivial. 0 not checked. [2025-01-09 00:09:46,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:09:46,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29509296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:46,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:09:46,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 00:09:46,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275005587] [2025-01-09 00:09:46,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:46,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:46,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:46,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:46,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:09:46,867 INFO L87 Difference]: Start difference. First operand 13493 states and 13971 transitions. Second operand has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:47,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:47,509 INFO L93 Difference]: Finished difference Result 27313 states and 28274 transitions. [2025-01-09 00:09:47,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:47,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1711 [2025-01-09 00:09:47,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:47,536 INFO L225 Difference]: With dead ends: 27313 [2025-01-09 00:09:47,537 INFO L226 Difference]: Without dead ends: 13822 [2025-01-09 00:09:47,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1715 GetRequests, 1711 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:09:47,556 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 263 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:47,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 432 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:09:47,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2025-01-09 00:09:47,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13822. [2025-01-09 00:09:47,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.0337168077563128) internal successors, (14287), 13821 states have internal predecessors, (14287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14287 transitions. [2025-01-09 00:09:47,809 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14287 transitions. Word has length 1711 [2025-01-09 00:09:47,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:47,810 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14287 transitions. [2025-01-09 00:09:47,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:47,811 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14287 transitions. [2025-01-09 00:09:47,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1795 [2025-01-09 00:09:47,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:47,850 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:47,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 00:09:48,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:09:48,051 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:48,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:48,053 INFO L85 PathProgramCache]: Analyzing trace with hash 523056666, now seen corresponding path program 1 times [2025-01-09 00:09:48,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:48,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435960266] [2025-01-09 00:09:48,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:48,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:48,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1794 statements into 1 equivalence classes. [2025-01-09 00:09:48,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1794 of 1794 statements. [2025-01-09 00:09:48,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:48,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5653 backedges. 4357 proven. 50 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2025-01-09 00:09:50,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:50,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435960266] [2025-01-09 00:09:50,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435960266] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:09:50,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111453954] [2025-01-09 00:09:50,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:50,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:09:50,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:09:50,663 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:09:50,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 00:09:50,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1794 statements into 1 equivalence classes. [2025-01-09 00:09:51,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1794 of 1794 statements. [2025-01-09 00:09:51,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:51,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:51,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 2055 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:09:51,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:09:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5653 backedges. 2983 proven. 0 refuted. 0 times theorem prover too weak. 2670 trivial. 0 not checked. [2025-01-09 00:09:51,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:09:51,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111453954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:51,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:09:51,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-01-09 00:09:51,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317518086] [2025-01-09 00:09:51,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:51,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:09:51,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:51,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:09:51,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 00:09:51,919 INFO L87 Difference]: Start difference. First operand 13822 states and 14287 transitions. Second operand has 4 states, 4 states have (on average 215.25) internal successors, (861), 4 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:53,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:53,044 INFO L93 Difference]: Finished difference Result 29616 states and 30574 transitions. [2025-01-09 00:09:53,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:09:53,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 215.25) internal successors, (861), 4 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1794 [2025-01-09 00:09:53,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:53,058 INFO L225 Difference]: With dead ends: 29616 [2025-01-09 00:09:53,058 INFO L226 Difference]: Without dead ends: 13822 [2025-01-09 00:09:53,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1802 GetRequests, 1793 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 00:09:53,067 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 133 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:53,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 403 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:09:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2025-01-09 00:09:53,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13493. [2025-01-09 00:09:53,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.0299436703231544) internal successors, (13896), 13492 states have internal predecessors, (13896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13896 transitions. [2025-01-09 00:09:53,165 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13896 transitions. Word has length 1794 [2025-01-09 00:09:53,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:53,167 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 13896 transitions. [2025-01-09 00:09:53,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 215.25) internal successors, (861), 4 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13896 transitions. [2025-01-09 00:09:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1796 [2025-01-09 00:09:53,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:53,186 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:53,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 00:09:53,386 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,SelfDestructingSolverStorable13 [2025-01-09 00:09:53,387 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:53,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:53,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1807864443, now seen corresponding path program 1 times [2025-01-09 00:09:53,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:53,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576978808] [2025-01-09 00:09:53,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:53,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:53,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1795 statements into 1 equivalence classes. [2025-01-09 00:09:53,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1795 of 1795 statements. [2025-01-09 00:09:53,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:53,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6760 backedges. 4896 proven. 132 refuted. 0 times theorem prover too weak. 1732 trivial. 0 not checked. [2025-01-09 00:09:54,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:54,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576978808] [2025-01-09 00:09:54,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576978808] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:09:54,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408492658] [2025-01-09 00:09:54,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:54,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:09:54,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:09:54,902 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:09:54,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 00:09:55,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1795 statements into 1 equivalence classes. [2025-01-09 00:09:55,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1795 of 1795 statements. [2025-01-09 00:09:55,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:55,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:55,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 2089 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:09:55,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:09:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6760 backedges. 4129 proven. 0 refuted. 0 times theorem prover too weak. 2631 trivial. 0 not checked. [2025-01-09 00:09:55,490 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:09:55,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408492658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:55,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:09:55,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 00:09:55,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337015769] [2025-01-09 00:09:55,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:55,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:55,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:55,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:55,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:09:55,493 INFO L87 Difference]: Start difference. First operand 13493 states and 13896 transitions. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:56,146 INFO L93 Difference]: Finished difference Result 28958 states and 29839 transitions. [2025-01-09 00:09:56,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:56,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1795 [2025-01-09 00:09:56,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:56,160 INFO L225 Difference]: With dead ends: 28958 [2025-01-09 00:09:56,160 INFO L226 Difference]: Without dead ends: 15796 [2025-01-09 00:09:56,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1799 GetRequests, 1795 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:09:56,170 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 221 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:56,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 425 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:09:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15796 states. [2025-01-09 00:09:56,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15796 to 15467. [2025-01-09 00:09:56,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15467 states, 15466 states have (on average 1.028384844174318) internal successors, (15905), 15466 states have internal predecessors, (15905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:56,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15467 states to 15467 states and 15905 transitions. [2025-01-09 00:09:56,337 INFO L78 Accepts]: Start accepts. Automaton has 15467 states and 15905 transitions. Word has length 1795 [2025-01-09 00:09:56,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:56,338 INFO L471 AbstractCegarLoop]: Abstraction has 15467 states and 15905 transitions. [2025-01-09 00:09:56,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:56,338 INFO L276 IsEmpty]: Start isEmpty. Operand 15467 states and 15905 transitions. [2025-01-09 00:09:56,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1848 [2025-01-09 00:09:56,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:56,382 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:56,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 00:09:56,582 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,SelfDestructingSolverStorable14 [2025-01-09 00:09:56,583 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:56,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:56,584 INFO L85 PathProgramCache]: Analyzing trace with hash -85983144, now seen corresponding path program 1 times [2025-01-09 00:09:56,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:56,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822125239] [2025-01-09 00:09:56,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:56,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:56,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1847 statements into 1 equivalence classes. [2025-01-09 00:09:56,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1847 of 1847 statements. [2025-01-09 00:09:56,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:56,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:57,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7532 backedges. 4534 proven. 0 refuted. 0 times theorem prover too weak. 2998 trivial. 0 not checked. [2025-01-09 00:09:57,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:57,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822125239] [2025-01-09 00:09:57,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822125239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:09:57,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:09:57,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:09:57,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262344977] [2025-01-09 00:09:57,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:09:57,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:09:57,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:09:57,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:09:57,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:09:57,354 INFO L87 Difference]: Start difference. First operand 15467 states and 15905 transitions. Second operand has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:09:58,023 INFO L93 Difference]: Finished difference Result 33235 states and 34200 transitions. [2025-01-09 00:09:58,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:09:58,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1847 [2025-01-09 00:09:58,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:09:58,042 INFO L225 Difference]: With dead ends: 33235 [2025-01-09 00:09:58,042 INFO L226 Difference]: Without dead ends: 18099 [2025-01-09 00:09:58,053 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-01-09 00:09:58,054 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 261 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:09:58,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 418 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:09:58,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18099 states. [2025-01-09 00:09:58,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18099 to 17441. [2025-01-09 00:09:58,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17441 states, 17440 states have (on average 1.0255160550458715) internal successors, (17885), 17440 states have internal predecessors, (17885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17441 states to 17441 states and 17885 transitions. [2025-01-09 00:09:58,178 INFO L78 Accepts]: Start accepts. Automaton has 17441 states and 17885 transitions. Word has length 1847 [2025-01-09 00:09:58,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:09:58,178 INFO L471 AbstractCegarLoop]: Abstraction has 17441 states and 17885 transitions. [2025-01-09 00:09:58,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:09:58,179 INFO L276 IsEmpty]: Start isEmpty. Operand 17441 states and 17885 transitions. [2025-01-09 00:09:58,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1970 [2025-01-09 00:09:58,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:09:58,255 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:09:58,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:09:58,255 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:09:58,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:09:58,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1819959512, now seen corresponding path program 1 times [2025-01-09 00:09:58,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:09:58,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990324643] [2025-01-09 00:09:58,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:58,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:09:58,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1969 statements into 1 equivalence classes. [2025-01-09 00:09:58,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1969 of 1969 statements. [2025-01-09 00:09:58,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:58,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 7507 backedges. 5611 proven. 91 refuted. 0 times theorem prover too weak. 1805 trivial. 0 not checked. [2025-01-09 00:10:00,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:00,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990324643] [2025-01-09 00:10:00,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990324643] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:10:00,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672063878] [2025-01-09 00:10:00,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:00,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:10:00,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:10:00,312 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:10:00,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 00:10:00,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1969 statements into 1 equivalence classes. [2025-01-09 00:10:00,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1969 of 1969 statements. [2025-01-09 00:10:00,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:00,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:00,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 2263 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:10:00,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:10:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7507 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 7123 trivial. 0 not checked. [2025-01-09 00:10:01,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:10:01,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672063878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:01,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:10:01,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 00:10:01,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034804014] [2025-01-09 00:10:01,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:01,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:10:01,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:01,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:10:01,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:10:01,178 INFO L87 Difference]: Start difference. First operand 17441 states and 17885 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:01,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:01,933 INFO L93 Difference]: Finished difference Result 17772 states and 18219 transitions. [2025-01-09 00:10:01,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:01,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1969 [2025-01-09 00:10:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:01,947 INFO L225 Difference]: With dead ends: 17772 [2025-01-09 00:10:01,947 INFO L226 Difference]: Without dead ends: 17770 [2025-01-09 00:10:01,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1974 GetRequests, 1969 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:10:01,951 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 297 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:01,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 418 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:10:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17770 states. [2025-01-09 00:10:02,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 17770. [2025-01-09 00:10:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17770 states, 17769 states have (on average 1.0252124486465193) internal successors, (18217), 17769 states have internal predecessors, (18217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17770 states to 17770 states and 18217 transitions. [2025-01-09 00:10:02,082 INFO L78 Accepts]: Start accepts. Automaton has 17770 states and 18217 transitions. Word has length 1969 [2025-01-09 00:10:02,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:02,083 INFO L471 AbstractCegarLoop]: Abstraction has 17770 states and 18217 transitions. [2025-01-09 00:10:02,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 17770 states and 18217 transitions. [2025-01-09 00:10:02,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2119 [2025-01-09 00:10:02,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:02,107 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:10:02,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 00:10:02,311 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,SelfDestructingSolverStorable16 [2025-01-09 00:10:02,311 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:02,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:02,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1516214828, now seen corresponding path program 1 times [2025-01-09 00:10:02,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:02,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246503791] [2025-01-09 00:10:02,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:02,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:02,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2118 statements into 1 equivalence classes. [2025-01-09 00:10:02,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2118 of 2118 statements. [2025-01-09 00:10:02,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:02,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8914 backedges. 6547 proven. 91 refuted. 0 times theorem prover too weak. 2276 trivial. 0 not checked. [2025-01-09 00:10:04,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:04,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246503791] [2025-01-09 00:10:04,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246503791] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:10:04,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336434821] [2025-01-09 00:10:04,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:04,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:10:04,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:10:04,949 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:10:04,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 00:10:05,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2118 statements into 1 equivalence classes. [2025-01-09 00:10:05,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2118 of 2118 statements. [2025-01-09 00:10:05,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:05,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:05,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 2436 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:10:05,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:10:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 8914 backedges. 1568 proven. 0 refuted. 0 times theorem prover too weak. 7346 trivial. 0 not checked. [2025-01-09 00:10:05,895 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:10:05,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336434821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:05,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:10:05,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 00:10:05,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331611584] [2025-01-09 00:10:05,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:05,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:10:05,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:05,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:10:05,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:10:05,898 INFO L87 Difference]: Start difference. First operand 17770 states and 18217 transitions. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:06,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:06,746 INFO L93 Difference]: Finished difference Result 35867 states and 36772 transitions. [2025-01-09 00:10:06,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:10:06,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2118 [2025-01-09 00:10:06,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:06,765 INFO L225 Difference]: With dead ends: 35867 [2025-01-09 00:10:06,766 INFO L226 Difference]: Without dead ends: 18428 [2025-01-09 00:10:06,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2123 GetRequests, 2117 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:10:06,777 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 223 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:06,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 38 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:10:06,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2025-01-09 00:10:06,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 16783. [2025-01-09 00:10:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16783 states, 16782 states have (on average 1.0244905255631034) internal successors, (17193), 16782 states have internal predecessors, (17193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:06,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17193 transitions. [2025-01-09 00:10:06,987 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17193 transitions. Word has length 2118 [2025-01-09 00:10:06,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:06,988 INFO L471 AbstractCegarLoop]: Abstraction has 16783 states and 17193 transitions. [2025-01-09 00:10:06,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:06,988 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17193 transitions. [2025-01-09 00:10:07,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2185 [2025-01-09 00:10:07,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:07,013 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:10:07,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 00:10:07,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:10:07,217 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:07,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:07,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1410525511, now seen corresponding path program 1 times [2025-01-09 00:10:07,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:07,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189049889] [2025-01-09 00:10:07,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:07,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:07,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2184 statements into 1 equivalence classes. [2025-01-09 00:10:07,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2184 of 2184 statements. [2025-01-09 00:10:07,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:07,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9259 backedges. 1568 proven. 0 refuted. 0 times theorem prover too weak. 7691 trivial. 0 not checked. [2025-01-09 00:10:09,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:09,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189049889] [2025-01-09 00:10:09,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189049889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:09,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:10:09,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:10:09,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981443550] [2025-01-09 00:10:09,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:09,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:10:09,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:09,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:10:09,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:10:09,548 INFO L87 Difference]: Start difference. First operand 16783 states and 17193 transitions. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:10,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:10,137 INFO L93 Difference]: Finished difference Result 33258 states and 34076 transitions. [2025-01-09 00:10:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:10:10,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2184 [2025-01-09 00:10:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:10,150 INFO L225 Difference]: With dead ends: 33258 [2025-01-09 00:10:10,150 INFO L226 Difference]: Without dead ends: 16783 [2025-01-09 00:10:10,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:10:10,157 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 227 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:10,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 16 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:10:10,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16783 states. [2025-01-09 00:10:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16783 to 16783. [2025-01-09 00:10:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16783 states, 16782 states have (on average 1.0244309379096652) internal successors, (17192), 16782 states have internal predecessors, (17192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17192 transitions. [2025-01-09 00:10:10,322 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17192 transitions. Word has length 2184 [2025-01-09 00:10:10,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:10,323 INFO L471 AbstractCegarLoop]: Abstraction has 16783 states and 17192 transitions. [2025-01-09 00:10:10,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:10,323 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17192 transitions. [2025-01-09 00:10:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2294 [2025-01-09 00:10:10,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:10:10,355 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:10:10,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:10:10,356 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:10:10,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:10:10,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2140013563, now seen corresponding path program 1 times [2025-01-09 00:10:10,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:10:10,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97376560] [2025-01-09 00:10:10,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:10,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:10:10,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2293 statements into 1 equivalence classes. [2025-01-09 00:10:10,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2293 of 2293 statements. [2025-01-09 00:10:10,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:10,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9733 backedges. 7179 proven. 91 refuted. 0 times theorem prover too weak. 2463 trivial. 0 not checked. [2025-01-09 00:10:13,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:10:13,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97376560] [2025-01-09 00:10:13,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97376560] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:10:13,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768932111] [2025-01-09 00:10:13,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:10:13,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:10:13,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:10:13,544 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:10:13,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 00:10:13,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2293 statements into 1 equivalence classes. [2025-01-09 00:10:13,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2293 of 2293 statements. [2025-01-09 00:10:13,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:10:13,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:10:13,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 2614 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:10:14,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:10:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9733 backedges. 2387 proven. 0 refuted. 0 times theorem prover too weak. 7346 trivial. 0 not checked. [2025-01-09 00:10:14,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:10:14,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768932111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:10:14,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:10:14,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 00:10:14,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441978566] [2025-01-09 00:10:14,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:10:14,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:10:14,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:10:14,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:10:14,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:10:14,537 INFO L87 Difference]: Start difference. First operand 16783 states and 17192 transitions. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:15,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:10:15,708 INFO L93 Difference]: Finished difference Result 37181 states and 38076 transitions. [2025-01-09 00:10:15,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:10:15,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2293 [2025-01-09 00:10:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:10:15,710 INFO L225 Difference]: With dead ends: 37181 [2025-01-09 00:10:15,710 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:10:15,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2298 GetRequests, 2292 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:10:15,723 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 344 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:10:15,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 53 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:10:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:10:15,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:10:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:10:15,725 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2293 [2025-01-09 00:10:15,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:10:15,725 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:10:15,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:10:15,726 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:10:15,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:10:15,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:10:15,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 00:10:15,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:10:15,933 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:10:15,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 00:10:17,132 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:10:17,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:10:17 BoogieIcfgContainer [2025-01-09 00:10:17,157 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:10:17,157 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:10:17,157 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:10:17,157 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:10:17,158 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:09:19" (3/4) ... [2025-01-09 00:10:17,159 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 00:10:17,182 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 00:10:17,185 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 00:10:17,186 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 00:10:17,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 00:10:17,334 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:10:17,335 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:10:17,335 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:10:17,336 INFO L158 Benchmark]: Toolchain (without parser) took 61130.12ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 127.4MB in the beginning and 557.8MB in the end (delta: -430.5MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-01-09 00:10:17,336 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:10:17,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.89ms. Allocated memory is still 167.8MB. Free memory was 126.6MB in the beginning and 69.5MB in the end (delta: 57.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 00:10:17,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 141.30ms. Allocated memory is still 167.8MB. Free memory was 69.5MB in the beginning and 46.3MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 00:10:17,337 INFO L158 Benchmark]: Boogie Preprocessor took 222.73ms. Allocated memory is still 167.8MB. Free memory was 46.3MB in the beginning and 86.7MB in the end (delta: -40.4MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2025-01-09 00:10:17,338 INFO L158 Benchmark]: RCFGBuilder took 1904.98ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 86.7MB in the beginning and 202.9MB in the end (delta: -116.2MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2025-01-09 00:10:17,338 INFO L158 Benchmark]: TraceAbstraction took 58095.43ms. Allocated memory was 335.5MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 201.6MB in the beginning and 583.0MB in the end (delta: -381.4MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-01-09 00:10:17,338 INFO L158 Benchmark]: Witness Printer took 177.83ms. Allocated memory is still 1.9GB. Free memory was 583.0MB in the beginning and 557.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 00:10:17,339 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 581.89ms. Allocated memory is still 167.8MB. Free memory was 126.6MB in the beginning and 69.5MB in the end (delta: 57.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 141.30ms. Allocated memory is still 167.8MB. Free memory was 69.5MB in the beginning and 46.3MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 222.73ms. Allocated memory is still 167.8MB. Free memory was 46.3MB in the beginning and 86.7MB in the end (delta: -40.4MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1904.98ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 86.7MB in the beginning and 202.9MB in the end (delta: -116.2MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. * TraceAbstraction took 58095.43ms. Allocated memory was 335.5MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 201.6MB in the beginning and 583.0MB in the end (delta: -381.4MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 177.83ms. Allocated memory is still 1.9GB. Free memory was 583.0MB in the beginning and 557.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 128]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.8s, OverallIterations: 20, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5242 SdHoareTripleChecker+Valid, 17.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5242 mSDsluCounter, 5213 SdHoareTripleChecker+Invalid, 14.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 2812 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18667 IncrementalHoareTripleChecker+Invalid, 21479 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2812 mSolverCounterUnsat, 5080 mSDtfsCounter, 18667 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14603 GetRequests, 14543 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17770occurred in iteration=17, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 6251 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 40476 NumberOfCodeBlocks, 40476 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 40448 ConstructedInterpolants, 0 QuantifiedInterpolants, 81523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 16787 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 28 InterpolantComputations, 20 PerfectInterpolantSequences, 135665/136644 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1783]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((a16 != 10) && (a15 <= 3)) && (0 <= ((long long) 154 + a18))) && (7 == a12)) || (((a16 <= 9) && (a15 <= 3)) && (7 == a12))) || (((a16 <= 9) && (0 <= ((long long) 154 + a18))) && (7 == a12))) || ((((a15 <= 3) && (a12 == 8)) && (((long long) 119 + a18) <= 0)) && (0 <= ((long long) 154 + a18)))) || (((a12 == 8) && (150 <= a18)) && (a15 == 3))) || ((a16 <= 8) && (0 <= ((long long) 87 + a18)))) || ((((((long long) a18 + 79) <= 0) && (a12 <= 5)) && (0 <= ((long long) 154 + a18))) && (a16 <= 11))) || (((a12 <= 5) && (a16 == 8)) && (0 <= ((long long) 600001 + a18)))) || ((((a16 != 10) && (a15 <= 3)) && (a12 == 8)) && (0 <= ((long long) 154 + a18)))) || (((a12 <= 5) && (a15 <= 3)) && (0 <= ((long long) 154 + a18)))) || ((((a12 <= 5) && (a16 <= 9)) && (a15 <= 3)) && (0 <= ((long long) a18 + 155)))) || ((((a16 != 10) && (a15 <= 3)) && (0 <= ((long long) 600001 + a18))) && (((long long) a18 + 156) <= 0))) || (((0 <= ((long long) 87 + a18)) && (a16 != 10)) && (a15 <= 3))) || ((((a15 <= 3) && (0 <= ((long long) 600001 + a18))) && (a12 == 8)) && (((long long) a18 + 156) <= 0))) || ((a16 <= 8) && (a15 <= 3))) || (((a16 <= 9) && (0 <= ((long long) 600001 + a18))) && (((long long) a18 + 156) <= 0))) || (((a16 <= 9) && (0 <= ((long long) 600001 + a18))) && (a12 == 8))) || (((a12 <= 5) && (158 <= a18)) && (a16 <= 11))) || (((a16 <= 9) && (((long long) a18 + 80) <= 0)) && (0 <= ((long long) 154 + a18)))) || ((((a12 <= 5) && (0 <= ((long long) 600001 + a18))) && (((long long) a18 + 156) <= 0)) && (a16 <= 11))) || (((0 <= ((long long) 600001 + a18)) && (a12 == 6)) && (a16 <= 11))) || (((a16 <= 9) && (a15 <= 3)) && (a12 == 8))) RESULT: Ultimate proved your program to be correct! [2025-01-09 00:10:17,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE