./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gr2006.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/gr2006.i -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 3ef045eb54c58e8ecfe4972142a43378e1f3b08091dc3d5b7e399cf5703f1724 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:50:10,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:50:10,829 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:50:10,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:50:10,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:50:10,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:50:10,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:50:10,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:50:10,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:50:10,856 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:50:10,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:50:10,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:50:10,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:50:10,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:50:10,857 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:50:10,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:50:10,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:50:10,858 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:50:10,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:50:10,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:50:10,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:50:10,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:50:10,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:50:10,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:50:10,859 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:50:10,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:50:10,859 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:50:10,859 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:50:10,859 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:50:10,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:50:10,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:50:10,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:50:10,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:50:10,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:50:10,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:50:10,861 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:50:10,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:50:10,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:50:10,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:50:10,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:50:10,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:50:10,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:50:10,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:50:10,861 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 -> 3ef045eb54c58e8ecfe4972142a43378e1f3b08091dc3d5b7e399cf5703f1724 [2025-02-05 14:50:11,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:50:11,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:50:11,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:50:11,156 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:50:11,156 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:50:11,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/gr2006.i [2025-02-05 14:50:12,468 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc89733e0/5cc74ed32d1940e09b5d131c11a548d4/FLAGb7c3df903 [2025-02-05 14:50:12,695 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:50:12,696 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/gr2006.i [2025-02-05 14:50:12,705 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc89733e0/5cc74ed32d1940e09b5d131c11a548d4/FLAGb7c3df903 [2025-02-05 14:50:13,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc89733e0/5cc74ed32d1940e09b5d131c11a548d4 [2025-02-05 14:50:13,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:50:13,055 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:50:13,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:50:13,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:50:13,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:50:13,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:50:13" (1/1) ... [2025-02-05 14:50:13,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@308812fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:50:13, skipping insertion in model container [2025-02-05 14:50:13,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:50:13" (1/1) ... [2025-02-05 14:50:13,071 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:50:13,200 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/loop-lit/gr2006.i[895,908] [2025-02-05 14:50:13,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:50:13,221 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:50:13,232 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/loop-lit/gr2006.i[895,908] [2025-02-05 14:50:13,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:50:13,248 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:50:13,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:50:13 WrapperNode [2025-02-05 14:50:13,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:50:13,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:50:13,251 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:50:13,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:50:13,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:50:13" (1/1) ... [2025-02-05 14:50:13,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:50:13" (1/1) ... [2025-02-05 14:50:13,276 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2025-02-05 14:50:13,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:50:13,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:50:13,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:50:13,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:50:13,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:50:13" (1/1) ... [2025-02-05 14:50:13,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:50:13" (1/1) ... [2025-02-05 14:50:13,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:50:13" (1/1) ... [2025-02-05 14:50:13,296 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-02-05 14:50:13,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:50:13" (1/1) ... [2025-02-05 14:50:13,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:50:13" (1/1) ... [2025-02-05 14:50:13,299 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:50:13" (1/1) ... [2025-02-05 14:50:13,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:50:13" (1/1) ... [2025-02-05 14:50:13,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:50:13" (1/1) ... [2025-02-05 14:50:13,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:50:13" (1/1) ... [2025-02-05 14:50:13,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:50:13,307 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:50:13,307 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:50:13,307 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:50:13,308 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:50:13" (1/1) ... [2025-02-05 14:50:13,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:50:13,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:50:13,339 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 14:50:13,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 14:50:13,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:50:13,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:50:13,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:50:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:50:13,403 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:50:13,405 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:50:13,495 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-05 14:50:13,496 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:50:13,502 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:50:13,505 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:50:13,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:50:13 BoogieIcfgContainer [2025-02-05 14:50:13,505 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:50:13,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:50:13,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:50:13,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:50:13,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:50:13" (1/3) ... [2025-02-05 14:50:13,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6456106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:50:13, skipping insertion in model container [2025-02-05 14:50:13,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:50:13" (2/3) ... [2025-02-05 14:50:13,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6456106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:50:13, skipping insertion in model container [2025-02-05 14:50:13,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:50:13" (3/3) ... [2025-02-05 14:50:13,515 INFO L128 eAbstractionObserver]: Analyzing ICFG gr2006.i [2025-02-05 14:50:13,528 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:50:13,530 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gr2006.i that has 1 procedures, 13 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 14:50:13,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:50:13,595 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;@779bcfb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:50:13,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:50:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-05 14:50:13,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:50:13,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-05 14:50:13,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:50:13,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:50:13,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1419012791, now seen corresponding path program 1 times [2025-02-05 14:50:13,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:50:13,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908299699] [2025-02-05 14:50:13,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:50:13,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:50:13,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-05 14:50:13,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-05 14:50:13,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:50:13,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:50:13,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:50:13,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908299699] [2025-02-05 14:50:13,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908299699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:50:13,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:50:13,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 14:50:13,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271574199] [2025-02-05 14:50:13,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:50:13,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 14:50:13,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:50:13,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 14:50:13,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 14:50:13,766 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:50:13,777 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2025-02-05 14:50:13,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 14:50:13,778 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-02-05 14:50:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:50:13,785 INFO L225 Difference]: With dead ends: 21 [2025-02-05 14:50:13,786 INFO L226 Difference]: Without dead ends: 9 [2025-02-05 14:50:13,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 14:50:13,794 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:50:13,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:50:13,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-05 14:50:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-02-05 14:50:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2025-02-05 14:50:13,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2025-02-05 14:50:13,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:50:13,825 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2025-02-05 14:50:13,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:13,825 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2025-02-05 14:50:13,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 14:50:13,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:50:13,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:50:13,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:50:13,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:50:13,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:50:13,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2142770011, now seen corresponding path program 1 times [2025-02-05 14:50:13,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:50:13,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550788608] [2025-02-05 14:50:13,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:50:13,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:50:13,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 14:50:13,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 14:50:13,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:50:13,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:50:13,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:50:13,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550788608] [2025-02-05 14:50:13,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550788608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:50:13,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:50:13,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:50:13,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198377920] [2025-02-05 14:50:13,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:50:13,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:50:13,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:50:13,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:50:13,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:50:13,957 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:13,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:50:13,991 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2025-02-05 14:50:13,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:50:13,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-02-05 14:50:13,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:50:13,994 INFO L225 Difference]: With dead ends: 18 [2025-02-05 14:50:13,994 INFO L226 Difference]: Without dead ends: 14 [2025-02-05 14:50:13,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:50:13,995 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:50:13,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 18 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:50:13,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-02-05 14:50:13,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2025-02-05 14:50:14,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-02-05 14:50:14,000 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 8 [2025-02-05 14:50:14,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:50:14,000 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-02-05 14:50:14,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2025-02-05 14:50:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 14:50:14,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:50:14,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:50:14,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:50:14,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:50:14,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:50:14,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2143693532, now seen corresponding path program 1 times [2025-02-05 14:50:14,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:50:14,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86702162] [2025-02-05 14:50:14,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:50:14,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:50:14,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 14:50:14,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 14:50:14,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:50:14,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:14,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:50:14,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:50:14,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86702162] [2025-02-05 14:50:14,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86702162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:50:14,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:50:14,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:50:14,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975091148] [2025-02-05 14:50:14,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:50:14,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:50:14,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:50:14,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:50:14,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:50:14,070 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:14,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:50:14,083 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2025-02-05 14:50:14,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:50:14,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-02-05 14:50:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:50:14,085 INFO L225 Difference]: With dead ends: 22 [2025-02-05 14:50:14,085 INFO L226 Difference]: Without dead ends: 15 [2025-02-05 14:50:14,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:50:14,086 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:50:14,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 13 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:50:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-05 14:50:14,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-02-05 14:50:14,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:14,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-02-05 14:50:14,090 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2025-02-05 14:50:14,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:50:14,090 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-02-05 14:50:14,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2025-02-05 14:50:14,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 14:50:14,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:50:14,091 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:50:14,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:50:14,091 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:50:14,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:50:14,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1145433674, now seen corresponding path program 1 times [2025-02-05 14:50:14,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:50:14,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625005741] [2025-02-05 14:50:14,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:50:14,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:50:14,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 14:50:14,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 14:50:14,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:50:14,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:14,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:50:14,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:50:14,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625005741] [2025-02-05 14:50:14,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625005741] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:50:14,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471686880] [2025-02-05 14:50:14,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:50:14,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:50:14,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:50:14,176 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:50:14,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 14:50:14,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 14:50:14,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 14:50:14,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:50:14,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:14,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 14:50:14,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:50:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:50:14,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:50:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:50:14,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471686880] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:50:14,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:50:14,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 14:50:14,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588654427] [2025-02-05 14:50:14,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:50:14,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:50:14,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:50:14,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:50:14,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:50:14,310 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:50:14,356 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-02-05 14:50:14,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 14:50:14,357 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-05 14:50:14,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:50:14,358 INFO L225 Difference]: With dead ends: 32 [2025-02-05 14:50:14,358 INFO L226 Difference]: Without dead ends: 25 [2025-02-05 14:50:14,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:50:14,360 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:50:14,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 33 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:50:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-05 14:50:14,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-02-05 14:50:14,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2025-02-05 14:50:14,368 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 11 [2025-02-05 14:50:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:50:14,368 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2025-02-05 14:50:14,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2025-02-05 14:50:14,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 14:50:14,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:50:14,369 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:50:14,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 14:50:14,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:50:14,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:50:14,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:50:14,570 INFO L85 PathProgramCache]: Analyzing trace with hash 447118684, now seen corresponding path program 2 times [2025-02-05 14:50:14,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:50:14,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041230017] [2025-02-05 14:50:14,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:50:14,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:50:14,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-05 14:50:14,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 14:50:14,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:50:14,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:50:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:50:14,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041230017] [2025-02-05 14:50:14,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041230017] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:50:14,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212003925] [2025-02-05 14:50:14,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:50:14,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:50:14,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:50:14,745 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:50:14,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 14:50:14,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-05 14:50:14,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 14:50:14,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:50:14,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:14,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 14:50:14,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:50:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:50:14,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:50:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:50:14,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212003925] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:50:14,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:50:14,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-05 14:50:14,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839055308] [2025-02-05 14:50:14,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:50:14,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 14:50:14,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:50:14,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 14:50:14,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-02-05 14:50:14,997 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:50:15,119 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2025-02-05 14:50:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 14:50:15,120 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-05 14:50:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:50:15,121 INFO L225 Difference]: With dead ends: 47 [2025-02-05 14:50:15,121 INFO L226 Difference]: Without dead ends: 40 [2025-02-05 14:50:15,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-02-05 14:50:15,122 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:50:15,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:50:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-05 14:50:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2025-02-05 14:50:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2025-02-05 14:50:15,133 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2025-02-05 14:50:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:50:15,134 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2025-02-05 14:50:15,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2025-02-05 14:50:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 14:50:15,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:50:15,136 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 5, 5, 1, 1, 1, 1, 1, 1] [2025-02-05 14:50:15,142 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-02-05 14:50:15,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:50:15,338 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:50:15,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:50:15,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1565814922, now seen corresponding path program 3 times [2025-02-05 14:50:15,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:50:15,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675687381] [2025-02-05 14:50:15,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 14:50:15,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:50:15,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 10 equivalence classes. [2025-02-05 14:50:15,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 14:50:15,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-05 14:50:15,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 48 proven. 75 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 14:50:15,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:50:15,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675687381] [2025-02-05 14:50:15,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675687381] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:50:15,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92647853] [2025-02-05 14:50:15,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 14:50:15,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:50:15,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:50:15,578 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:50:15,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 14:50:15,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 10 equivalence classes. [2025-02-05 14:50:15,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 14:50:15,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-02-05 14:50:15,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:15,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 14:50:15,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:50:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 9 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:50:15,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:50:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 9 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:50:16,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92647853] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:50:16,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:50:16,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 29 [2025-02-05 14:50:16,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027784023] [2025-02-05 14:50:16,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:50:16,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 14:50:16,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:50:16,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 14:50:16,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=551, Unknown=0, NotChecked=0, Total=812 [2025-02-05 14:50:16,080 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 29 states, 29 states have (on average 3.0344827586206895) internal successors, (88), 29 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:16,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:50:16,586 INFO L93 Difference]: Finished difference Result 123 states and 154 transitions. [2025-02-05 14:50:16,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-05 14:50:16,586 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.0344827586206895) internal successors, (88), 29 states have internal predecessors, (88), 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 35 [2025-02-05 14:50:16,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:50:16,588 INFO L225 Difference]: With dead ends: 123 [2025-02-05 14:50:16,588 INFO L226 Difference]: Without dead ends: 103 [2025-02-05 14:50:16,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=981, Invalid=2325, Unknown=0, NotChecked=0, Total=3306 [2025-02-05 14:50:16,590 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:50:16,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 87 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:50:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-05 14:50:16,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 84. [2025-02-05 14:50:16,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 83 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2025-02-05 14:50:16,600 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 35 [2025-02-05 14:50:16,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:50:16,600 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2025-02-05 14:50:16,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.0344827586206895) internal successors, (88), 29 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2025-02-05 14:50:16,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 14:50:16,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:50:16,604 INFO L218 NwaCegarLoop]: trace histogram [26, 25, 20, 6, 1, 1, 1, 1, 1, 1] [2025-02-05 14:50:16,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 14:50:16,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:50:16,805 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:50:16,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:50:16,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1644872471, now seen corresponding path program 4 times [2025-02-05 14:50:16,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:50:16,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597368361] [2025-02-05 14:50:16,806 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 14:50:16,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:50:16,815 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 83 statements into 2 equivalence classes. [2025-02-05 14:50:16,831 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 14:50:16,832 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 14:50:16,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 281 proven. 672 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 14:50:17,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:50:17,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597368361] [2025-02-05 14:50:17,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597368361] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:50:17,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733459051] [2025-02-05 14:50:17,372 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 14:50:17,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:50:17,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:50:17,376 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:50:17,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 14:50:17,416 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 83 statements into 2 equivalence classes. [2025-02-05 14:50:17,445 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 14:50:17,445 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 14:50:17,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:17,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 14:50:17,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:50:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 330 proven. 610 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 14:50:17,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:50:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 330 proven. 610 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 14:50:18,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733459051] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:50:18,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:50:18,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 45 [2025-02-05 14:50:18,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009729395] [2025-02-05 14:50:18,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:50:18,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-05 14:50:18,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:50:18,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-05 14:50:18,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2025-02-05 14:50:18,298 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:18,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:50:18,465 INFO L93 Difference]: Finished difference Result 180 states and 215 transitions. [2025-02-05 14:50:18,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-02-05 14:50:18,467 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 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 83 [2025-02-05 14:50:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:50:18,468 INFO L225 Difference]: With dead ends: 180 [2025-02-05 14:50:18,468 INFO L226 Difference]: Without dead ends: 157 [2025-02-05 14:50:18,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2025-02-05 14:50:18,472 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:50:18,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:50:18,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-05 14:50:18,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2025-02-05 14:50:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.0460526315789473) internal successors, (159), 152 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 159 transitions. [2025-02-05 14:50:18,493 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 159 transitions. Word has length 83 [2025-02-05 14:50:18,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:50:18,494 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 159 transitions. [2025-02-05 14:50:18,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 159 transitions. [2025-02-05 14:50:18,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 14:50:18,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:50:18,496 INFO L218 NwaCegarLoop]: trace histogram [49, 48, 43, 6, 1, 1, 1, 1, 1, 1] [2025-02-05 14:50:18,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 14:50:18,701 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,SelfDestructingSolverStorable6 [2025-02-05 14:50:18,702 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:50:18,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:50:18,702 INFO L85 PathProgramCache]: Analyzing trace with hash -134617477, now seen corresponding path program 5 times [2025-02-05 14:50:18,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:50:18,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824493740] [2025-02-05 14:50:18,703 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 14:50:18,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:50:18,723 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 152 statements into 49 equivalence classes. [2025-02-05 14:50:18,806 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 14:50:18,806 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2025-02-05 14:50:18,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 698 proven. 2795 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 14:50:20,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:50:20,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824493740] [2025-02-05 14:50:20,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824493740] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:50:20,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061167444] [2025-02-05 14:50:20,407 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 14:50:20,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:50:20,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:50:20,410 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:50:20,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 14:50:20,457 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 152 statements into 49 equivalence classes. [2025-02-05 14:50:20,530 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 14:50:20,530 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2025-02-05 14:50:20,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:20,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-05 14:50:20,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:50:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 698 proven. 2795 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 14:50:20,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:50:21,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 698 proven. 2795 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 14:50:21,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061167444] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:50:21,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:50:21,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 52 [2025-02-05 14:50:21,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679112109] [2025-02-05 14:50:21,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:50:21,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-05 14:50:21,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:50:21,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-05 14:50:21,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2025-02-05 14:50:21,878 INFO L87 Difference]: Start difference. First operand 153 states and 159 transitions. Second operand has 52 states, 52 states have (on average 3.076923076923077) internal successors, (160), 52 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:22,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:50:22,010 INFO L93 Difference]: Finished difference Result 201 states and 220 transitions. [2025-02-05 14:50:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-02-05 14:50:22,011 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.076923076923077) internal successors, (160), 52 states have internal predecessors, (160), 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 152 [2025-02-05 14:50:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:50:22,012 INFO L225 Difference]: With dead ends: 201 [2025-02-05 14:50:22,012 INFO L226 Difference]: Without dead ends: 178 [2025-02-05 14:50:22,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 260 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2025-02-05 14:50:22,014 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:50:22,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:50:22,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-05 14:50:22,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2025-02-05 14:50:22,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.0404624277456647) internal successors, (180), 173 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 180 transitions. [2025-02-05 14:50:22,028 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 180 transitions. Word has length 152 [2025-02-05 14:50:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:50:22,028 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 180 transitions. [2025-02-05 14:50:22,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.076923076923077) internal successors, (160), 52 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 180 transitions. [2025-02-05 14:50:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 14:50:22,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:50:22,034 INFO L218 NwaCegarLoop]: trace histogram [56, 55, 50, 6, 1, 1, 1, 1, 1, 1] [2025-02-05 14:50:22,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 14:50:22,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:50:22,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:50:22,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:50:22,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1504542167, now seen corresponding path program 6 times [2025-02-05 14:50:22,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:50:22,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830596311] [2025-02-05 14:50:22,235 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 14:50:22,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:50:22,244 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 173 statements into 56 equivalence classes. [2025-02-05 14:50:22,271 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) and asserted 110 of 173 statements. [2025-02-05 14:50:22,272 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2025-02-05 14:50:22,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:22,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 1681 proven. 86 refuted. 0 times theorem prover too weak. 2853 trivial. 0 not checked. [2025-02-05 14:50:22,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:50:22,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830596311] [2025-02-05 14:50:22,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830596311] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:50:22,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550658967] [2025-02-05 14:50:22,447 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 14:50:22,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:50:22,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:50:22,450 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:50:22,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 14:50:22,484 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 173 statements into 56 equivalence classes. [2025-02-05 14:50:22,529 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) and asserted 110 of 173 statements. [2025-02-05 14:50:22,529 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2025-02-05 14:50:22,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:22,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 14:50:22,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:50:22,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 1681 proven. 86 refuted. 0 times theorem prover too weak. 2853 trivial. 0 not checked. [2025-02-05 14:50:22,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:50:22,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 1681 proven. 86 refuted. 0 times theorem prover too weak. 2853 trivial. 0 not checked. [2025-02-05 14:50:22,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550658967] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:50:22,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:50:22,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2025-02-05 14:50:22,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940997183] [2025-02-05 14:50:22,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:50:22,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 14:50:22,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:50:22,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 14:50:22,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-05 14:50:22,685 INFO L87 Difference]: Start difference. First operand 174 states and 180 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:50:22,727 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2025-02-05 14:50:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 14:50:22,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2025-02-05 14:50:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:50:22,728 INFO L225 Difference]: With dead ends: 197 [2025-02-05 14:50:22,728 INFO L226 Difference]: Without dead ends: 193 [2025-02-05 14:50:22,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 340 SyntacticMatches, 12 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-05 14:50:22,729 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:50:22,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:50:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-05 14:50:22,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 177. [2025-02-05 14:50:22,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.0454545454545454) internal successors, (184), 176 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 184 transitions. [2025-02-05 14:50:22,741 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 184 transitions. Word has length 173 [2025-02-05 14:50:22,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:50:22,741 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 184 transitions. [2025-02-05 14:50:22,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:22,742 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 184 transitions. [2025-02-05 14:50:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-05 14:50:22,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:50:22,743 INFO L218 NwaCegarLoop]: trace histogram [57, 56, 50, 7, 1, 1, 1, 1, 1, 1] [2025-02-05 14:50:22,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 14:50:22,947 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,SelfDestructingSolverStorable8 [2025-02-05 14:50:22,947 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:50:22,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:50:22,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1849006916, now seen corresponding path program 7 times [2025-02-05 14:50:22,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:50:22,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530558971] [2025-02-05 14:50:22,948 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 14:50:22,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:50:22,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 14:50:22,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 14:50:22,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:50:22,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 1940 proven. 121 refuted. 0 times theorem prover too weak. 2727 trivial. 0 not checked. [2025-02-05 14:50:23,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:50:23,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530558971] [2025-02-05 14:50:23,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530558971] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:50:23,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869635290] [2025-02-05 14:50:23,222 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 14:50:23,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:50:23,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:50:23,224 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:50:23,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 14:50:23,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 14:50:23,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 14:50:23,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:50:23,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:23,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-05 14:50:23,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:50:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 4648 proven. 121 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 14:50:24,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:50:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 4648 proven. 121 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 14:50:25,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869635290] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:50:25,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:50:25,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 53, 53] total 96 [2025-02-05 14:50:25,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675182839] [2025-02-05 14:50:25,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:50:25,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-02-05 14:50:25,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:50:25,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-02-05 14:50:25,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-02-05 14:50:25,825 INFO L87 Difference]: Start difference. First operand 177 states and 184 transitions. Second operand has 96 states, 96 states have (on average 3.1979166666666665) internal successors, (307), 96 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:50:26,373 INFO L93 Difference]: Finished difference Result 1149 states and 1507 transitions. [2025-02-05 14:50:26,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-02-05 14:50:26,374 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 3.1979166666666665) internal successors, (307), 96 states have internal predecessors, (307), 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 176 [2025-02-05 14:50:26,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:50:26,379 INFO L225 Difference]: With dead ends: 1149 [2025-02-05 14:50:26,379 INFO L226 Difference]: Without dead ends: 1145 [2025-02-05 14:50:26,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 259 SyntacticMatches, 14 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4951 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-02-05 14:50:26,382 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:50:26,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 14:50:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-02-05 14:50:26,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 309. [2025-02-05 14:50:26,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.1688311688311688) internal successors, (360), 308 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:26,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 360 transitions. [2025-02-05 14:50:26,420 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 360 transitions. Word has length 176 [2025-02-05 14:50:26,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:50:26,420 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 360 transitions. [2025-02-05 14:50:26,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 3.1979166666666665) internal successors, (307), 96 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:26,421 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 360 transitions. [2025-02-05 14:50:26,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-02-05 14:50:26,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:50:26,424 INFO L218 NwaCegarLoop]: trace histogram [101, 100, 51, 50, 1, 1, 1, 1, 1, 1] [2025-02-05 14:50:26,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 14:50:26,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:50:26,628 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:50:26,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:50:26,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1591373820, now seen corresponding path program 8 times [2025-02-05 14:50:26,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:50:26,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64016945] [2025-02-05 14:50:26,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:50:26,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:50:26,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 308 statements into 2 equivalence classes. [2025-02-05 14:50:26,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 308 of 308 statements. [2025-02-05 14:50:26,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:50:26,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:31,815 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:50:31,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:50:31,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64016945] [2025-02-05 14:50:31,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64016945] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:50:31,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392216388] [2025-02-05 14:50:31,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:50:31,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:50:31,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:50:31,820 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:50:31,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 14:50:31,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 308 statements into 2 equivalence classes. [2025-02-05 14:50:31,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 308 of 308 statements. [2025-02-05 14:50:31,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:50:31,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:31,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 205 conjuncts are in the unsatisfiable core [2025-02-05 14:50:31,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:50:34,790 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:50:34,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:50:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:50:35,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392216388] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:50:35,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:50:35,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 104, 104] total 155 [2025-02-05 14:50:35,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288131516] [2025-02-05 14:50:35,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:50:35,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 155 states [2025-02-05 14:50:35,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:50:35,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2025-02-05 14:50:35,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2858, Invalid=21012, Unknown=0, NotChecked=0, Total=23870 [2025-02-05 14:50:35,224 INFO L87 Difference]: Start difference. First operand 309 states and 360 transitions. Second operand has 155 states, 155 states have (on average 2.967741935483871) internal successors, (460), 155 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:40,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:50:40,563 INFO L93 Difference]: Finished difference Result 4395 states and 5823 transitions. [2025-02-05 14:50:40,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-02-05 14:50:40,564 INFO L78 Accepts]: Start accepts. Automaton has has 155 states, 155 states have (on average 2.967741935483871) internal successors, (460), 155 states have internal predecessors, (460), 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 308 [2025-02-05 14:50:40,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:50:40,581 INFO L225 Difference]: With dead ends: 4395 [2025-02-05 14:50:40,581 INFO L226 Difference]: Without dead ends: 4235 [2025-02-05 14:50:40,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 565 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7702 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2858, Invalid=21012, Unknown=0, NotChecked=0, Total=23870 [2025-02-05 14:50:40,590 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 49 mSDsluCounter, 10172 mSDsCounter, 0 mSdLazyCounter, 17449 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 10327 SdHoareTripleChecker+Invalid, 17502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 17449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-02-05 14:50:40,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 10327 Invalid, 17502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 17449 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-02-05 14:50:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2025-02-05 14:50:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 4186. [2025-02-05 14:50:40,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4186 states, 4185 states have (on average 1.0241338112305853) internal successors, (4286), 4185 states have internal predecessors, (4286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 4286 transitions. [2025-02-05 14:50:40,869 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 4286 transitions. Word has length 308 [2025-02-05 14:50:40,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:50:40,869 INFO L471 AbstractCegarLoop]: Abstraction has 4186 states and 4286 transitions. [2025-02-05 14:50:40,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 155 states, 155 states have (on average 2.967741935483871) internal successors, (460), 155 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 4286 transitions. [2025-02-05 14:50:40,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-02-05 14:50:40,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:50:40,873 INFO L218 NwaCegarLoop]: trace histogram [102, 101, 52, 50, 1, 1, 1, 1, 1, 1] [2025-02-05 14:50:40,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 14:50:41,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:50:41,074 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:50:41,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:50:41,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1543552503, now seen corresponding path program 9 times [2025-02-05 14:50:41,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:50:41,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792442740] [2025-02-05 14:50:41,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 14:50:41,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:50:41,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 311 statements into 102 equivalence classes. [2025-02-05 14:50:41,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 102 check-sat command(s) and asserted 311 of 311 statements. [2025-02-05 14:50:41,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 102 check-sat command(s) [2025-02-05 14:50:41,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7403 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-05 14:50:43,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:50:43,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792442740] [2025-02-05 14:50:43,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792442740] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:50:43,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243765324] [2025-02-05 14:50:43,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 14:50:43,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:50:43,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:50:43,866 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:50:43,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 14:50:43,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 311 statements into 102 equivalence classes. [2025-02-05 14:50:44,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 102 check-sat command(s) and asserted 311 of 311 statements. [2025-02-05 14:50:44,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 102 check-sat command(s) [2025-02-05 14:50:44,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:50:44,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-02-05 14:50:44,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:50:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-05 14:50:44,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:50:46,419 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-05 14:50:46,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243765324] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:50:46,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:50:46,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 55 [2025-02-05 14:50:46,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816818297] [2025-02-05 14:50:46,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:50:46,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-05 14:50:46,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:50:46,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-05 14:50:46,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=1486, Unknown=0, NotChecked=0, Total=2970 [2025-02-05 14:50:46,422 INFO L87 Difference]: Start difference. First operand 4186 states and 4286 transitions. Second operand has 55 states, 55 states have (on average 3.909090909090909) internal successors, (215), 55 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:50:46,689 INFO L93 Difference]: Finished difference Result 4337 states and 4437 transitions. [2025-02-05 14:50:46,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-02-05 14:50:46,690 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.909090909090909) internal successors, (215), 55 states have internal predecessors, (215), 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 311 [2025-02-05 14:50:46,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:50:46,692 INFO L225 Difference]: With dead ends: 4337 [2025-02-05 14:50:46,692 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 14:50:46,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 569 SyntacticMatches, 102 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3338 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1484, Invalid=1486, Unknown=0, NotChecked=0, Total=2970 [2025-02-05 14:50:46,698 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:50:46,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 14:50:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 14:50:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 14:50:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 14:50:46,700 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 311 [2025-02-05 14:50:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:50:46,700 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 14:50:46,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.909090909090909) internal successors, (215), 55 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:50:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 14:50:46,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 14:50:46,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 14:50:46,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 14:50:46,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:50:46,907 INFO L422 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1] [2025-02-05 14:50:46,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 14:50:48,693 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 14:50:48,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 02:50:48 BoogieIcfgContainer [2025-02-05 14:50:48,729 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 14:50:48,730 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 14:50:48,730 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 14:50:48,730 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 14:50:48,731 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:50:13" (3/4) ... [2025-02-05 14:50:48,732 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 14:50:48,744 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-05 14:50:48,744 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 14:50:48,745 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 14:50:48,745 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 14:50:48,811 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 14:50:48,812 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 14:50:48,812 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 14:50:48,812 INFO L158 Benchmark]: Toolchain (without parser) took 35757.47ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 108.0MB in the beginning and 372.7MB in the end (delta: -264.7MB). Peak memory consumption was 320.7MB. Max. memory is 16.1GB. [2025-02-05 14:50:48,813 INFO L158 Benchmark]: CDTParser took 1.45ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:50:48,813 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.97ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 97.1MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:50:48,813 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.20ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 96.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:50:48,813 INFO L158 Benchmark]: Boogie Preprocessor took 28.27ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 94.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:50:48,813 INFO L158 Benchmark]: IcfgBuilder took 198.30ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 84.4MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 14:50:48,813 INFO L158 Benchmark]: TraceAbstraction took 35221.64ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 83.4MB in the beginning and 377.1MB in the end (delta: -293.7MB). Peak memory consumption was 414.0MB. Max. memory is 16.1GB. [2025-02-05 14:50:48,814 INFO L158 Benchmark]: Witness Printer took 82.09ms. Allocated memory is still 729.8MB. Free memory was 377.1MB in the beginning and 372.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:50:48,815 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.45ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.97ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 97.1MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.20ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 96.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.27ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 94.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 198.30ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 84.4MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 35221.64ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 83.4MB in the beginning and 377.1MB in the end (delta: -293.7MB). Peak memory consumption was 414.0MB. Max. memory is 16.1GB. * Witness Printer took 82.09ms. Allocated memory is still 729.8MB. Free memory was 377.1MB in the beginning and 372.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. 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: 19]: 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, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.3s, OverallIterations: 12, TraceHistogramMax: 102, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 11060 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10756 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18876 IncrementalHoareTripleChecker+Invalid, 19056 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 304 mSDtfsCounter, 18876 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2903 GetRequests, 2248 SyntacticMatches, 169 SemanticMatches, 486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17684 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4186occurred in iteration=11, InterpolantAutomatonStates: 390, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 937 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 22.1s InterpolantComputationTime, 2560 NumberOfCodeBlocks, 2434 NumberOfCodeBlocksAsserted, 411 NumberOfCheckSat, 3799 ConstructedInterpolants, 0 QuantifiedInterpolants, 10178 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2943 ConjunctsInSsa, 469 ConjunctsInUnsatCore, 30 InterpolantComputations, 3 PerfectInterpolantSequences, 55132/134046 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: 28]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((2 == y) && (98 == x)) || ((44 == y) && (44 == x))) || ((x == 15) && (y == 15))) || ((y == 39) && (x == 39))) || ((y == 33) && (x == 33))) || ((6 == y) && (6 == x))) || ((35 == y) && (x == 65))) || ((y == 10) && (x == 90))) || ((87 == x) && (y == 13))) || ((x == 1) && (y == 1))) || ((x == 63) && (y == 37))) || ((23 == y) && (23 == x))) || ((x == 86) && (14 == y))) || ((y == 28) && (x == 28))) || ((x == 24) && (y == 24))) || ((x == 13) && (y == 13))) || ((x == 26) && (y == 26))) || ((7 == y) && (7 == x))) || ((23 == y) && (77 == x))) || ((y == 12) && (88 == x))) || ((56 == x) && (44 == y))) || ((x == 25) && (y == 25))) || ((21 == y) && (21 == x))) || ((22 == y) && (x == 78))) || ((40 == y) && (40 == x))) || ((92 == x) && (y == 8))) || ((x == 8) && (y == 8))) || ((x == 34) && (y == 34))) || ((y == 26) && (x == 74))) || ((19 == x) && (19 == y))) || ((x == 36) && (y == 36))) || ((y == 43) && (57 == x))) || ((x == 54) && (46 == y))) || ((x == 11) && (y == 11))) || ((16 == x) && (16 == y))) || ((69 == x) && (31 == y))) || ((49 == x) && (49 == y))) || ((76 == x) && (y == 24))) || ((x == 73) && (y == 27))) || ((47 == y) && (47 == x))) || ((35 == y) && (35 == x))) || ((51 == x) && (49 == y))) || ((y == 18) && (82 == x))) || ((y == 10) && (x == 10))) || ((x == 96) && (y == 4))) || ((x == 58) && (42 == y))) || ((3 == y) && (97 == x))) || ((x == 37) && (y == 37))) || ((x == 75) && (y == 25))) || ((89 == x) && (y == 11))) || ((3 == x) && (3 == y))) || ((5 == x) && (5 == y))) || ((41 == y) && (59 == x))) || ((y == 17) && (x == 17))) || ((y == 28) && (72 == x))) || ((x == 70) && (30 == y))) || ((14 == y) && (14 == x))) || ((y == 39) && (x == 61))) || ((32 == y) && (32 == x))) || ((x == 60) && (40 == y))) || ((22 == y) && (22 == x))) || ((91 == x) && (9 == y))) || ((7 == y) && (x == 93))) || ((31 == x) && (31 == y))) || ((y == 27) && (x == 27))) || ((y == 0) && (x == 0))) || ((y == 12) && (x == 12))) || ((71 == x) && (29 == y))) || ((47 == y) && (53 == x))) || ((2 == x) && (2 == y))) || ((32 == y) && (68 == x))) || ((x == 83) && (y == 17))) || ((9 == x) && (9 == y))) || ((46 == y) && (46 == x))) || ((30 == x) && (30 == y))) || ((y == 34) && (66 == x))) || ((y == 48) && (52 == x))) || ((5 == y) && (95 == x))) || ((y == 20) && (x == 20))) || ((42 == y) && (42 == x))) || ((x == 18) && (y == 18))) || ((y == 45) && (x == 55))) || ((y == 38) && (62 == x))) || ((41 == y) && (41 == x))) || ((y == 20) && (x == 80))) || ((y == 43) && (x == 43))) || ((x == 79) && (21 == y))) || ((29 == x) && (29 == y))) || ((y == 4) && (x == 4))) || ((16 == y) && (84 == x))) || ((x == 85) && (y == 15))) || ((x == 99) && (y == 1))) || ((x == 100) && (y == 0))) || ((y == 50) && (x == 50))) || ((6 == y) && (94 == x))) || ((81 == x) && (19 == y))) || ((y == 45) && (x == 45))) || ((y == 48) && (x == 48))) || ((x == 38) && (y == 38))) || ((64 == x) && (y == 36))) || ((y == 33) && (67 == x))) RESULT: Ultimate proved your program to be correct! [2025-02-05 14:50:48,832 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