./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4030584521f36b8dc597e2fe097d1241b197ec784cb344ca35f6903bd5f84f17 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:10:37,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:10:37,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:10:37,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:10:37,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:10:37,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:10:37,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:10:37,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:10:37,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:10:37,265 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:10:37,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:10:37,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:10:37,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:10:37,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:10:37,267 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:10:37,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:10:37,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:10:37,267 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:10:37,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:10:37,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:10:37,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:10:37,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:10:37,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:10:37,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:10:37,268 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:10:37,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:10:37,268 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:10:37,268 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:10:37,268 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:10:37,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:10:37,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:10:37,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:10:37,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:10:37,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:10:37,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:10:37,269 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:10:37,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:10:37,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:10:37,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:10:37,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:10:37,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:10:37,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:10:37,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:10:37,270 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 -> 4030584521f36b8dc597e2fe097d1241b197ec784cb344ca35f6903bd5f84f17 [2025-02-05 15:10:37,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:10:37,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:10:37,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:10:37,533 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:10:37,533 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:10:37,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2025-02-05 15:10:38,742 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71bba8c64/c4c53aa27dc04156859a9b6b6919f00b/FLAGc8128c812 [2025-02-05 15:10:39,010 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:10:39,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2025-02-05 15:10:39,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71bba8c64/c4c53aa27dc04156859a9b6b6919f00b/FLAGc8128c812 [2025-02-05 15:10:39,051 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71bba8c64/c4c53aa27dc04156859a9b6b6919f00b [2025-02-05 15:10:39,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:10:39,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:10:39,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:10:39,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:10:39,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:10:39,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:10:39" (1/1) ... [2025-02-05 15:10:39,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e08b7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:39, skipping insertion in model container [2025-02-05 15:10:39,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:10:39" (1/1) ... [2025-02-05 15:10:39,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:10:39,184 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/nla-digbench-scaling/fermat1-ll_unwindbound10.c[535,548] [2025-02-05 15:10:39,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:10:39,222 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:10:39,237 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/nla-digbench-scaling/fermat1-ll_unwindbound10.c[535,548] [2025-02-05 15:10:39,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:10:39,266 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:10:39,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:39 WrapperNode [2025-02-05 15:10:39,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:10:39,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:10:39,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:10:39,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:10:39,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:39" (1/1) ... [2025-02-05 15:10:39,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:39" (1/1) ... [2025-02-05 15:10:39,304 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2025-02-05 15:10:39,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:10:39,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:10:39,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:10:39,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:10:39,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:39" (1/1) ... [2025-02-05 15:10:39,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:39" (1/1) ... [2025-02-05 15:10:39,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:39" (1/1) ... [2025-02-05 15:10:39,317 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 15:10:39,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:39" (1/1) ... [2025-02-05 15:10:39,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:39" (1/1) ... [2025-02-05 15:10:39,318 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:39" (1/1) ... [2025-02-05 15:10:39,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:39" (1/1) ... [2025-02-05 15:10:39,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:39" (1/1) ... [2025-02-05 15:10:39,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:39" (1/1) ... [2025-02-05 15:10:39,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:10:39,321 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:10:39,321 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:10:39,321 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:10:39,322 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:39" (1/1) ... [2025-02-05 15:10:39,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:10:39,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:10:39,354 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 15:10:39,364 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 15:10:39,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:10:39,377 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 15:10:39,378 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 15:10:39,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:10:39,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:10:39,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:10:39,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 15:10:39,378 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 15:10:39,424 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:10:39,426 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:10:39,537 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-05 15:10:39,538 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:10:39,543 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:10:39,544 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:10:39,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:10:39 BoogieIcfgContainer [2025-02-05 15:10:39,544 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:10:39,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:10:39,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:10:39,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:10:39,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:10:39" (1/3) ... [2025-02-05 15:10:39,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27581e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:10:39, skipping insertion in model container [2025-02-05 15:10:39,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:39" (2/3) ... [2025-02-05 15:10:39,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27581e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:10:39, skipping insertion in model container [2025-02-05 15:10:39,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:10:39" (3/3) ... [2025-02-05 15:10:39,551 INFO L128 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound10.c [2025-02-05 15:10:39,561 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:10:39,563 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fermat1-ll_unwindbound10.c that has 3 procedures, 32 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-05 15:10:39,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:10:39,602 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;@7824465e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:10:39,602 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:10:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 15:10:39,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 15:10:39,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:10:39,610 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:10:39,610 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:10:39,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:10:39,613 INFO L85 PathProgramCache]: Analyzing trace with hash -758256744, now seen corresponding path program 1 times [2025-02-05 15:10:39,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:10:39,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669340229] [2025-02-05 15:10:39,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:39,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:10:39,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 15:10:39,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 15:10:39,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:39,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:39,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:10:39,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:10:39,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669340229] [2025-02-05 15:10:39,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669340229] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:10:39,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896359967] [2025-02-05 15:10:39,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:39,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:10:39,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:10:39,736 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 15:10:39,739 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 15:10:39,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 15:10:39,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 15:10:39,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:39,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:39,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:10:39,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:10:39,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:10:39,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:10:39,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896359967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:10:39,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:10:39,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 15:10:39,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130875719] [2025-02-05 15:10:39,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:10:39,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:10:39,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:10:39,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:10:39,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:10:39,824 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:10:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:10:39,835 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2025-02-05 15:10:39,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:10:39,838 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-02-05 15:10:39,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:10:39,843 INFO L225 Difference]: With dead ends: 61 [2025-02-05 15:10:39,843 INFO L226 Difference]: Without dead ends: 28 [2025-02-05 15:10:39,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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 15:10:39,850 INFO L435 NwaCegarLoop]: 41 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, 41 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 15:10:39,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:10:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-05 15:10:39,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-05 15:10:39,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 15:10:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-02-05 15:10:39,871 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2025-02-05 15:10:39,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:10:39,871 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-02-05 15:10:39,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:10:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-02-05 15:10:39,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 15:10:39,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:10:39,872 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:10:39,881 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 15:10:40,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:10:40,076 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:10:40,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:10:40,077 INFO L85 PathProgramCache]: Analyzing trace with hash -766943530, now seen corresponding path program 1 times [2025-02-05 15:10:40,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:10:40,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949435560] [2025-02-05 15:10:40,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:40,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:10:40,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:10:40,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:10:40,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:40,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:10:40,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [460397616] [2025-02-05 15:10:40,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:40,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:10:40,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:10:40,112 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 15:10:40,114 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 15:10:40,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:10:40,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:10:40,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:40,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:40,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:10:40,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:10:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:10:40,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:10:40,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:10:40,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949435560] [2025-02-05 15:10:40,375 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:10:40,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460397616] [2025-02-05 15:10:40,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460397616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:10:40,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:10:40,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:10:40,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286637703] [2025-02-05 15:10:40,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:10:40,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:10:40,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:10:40,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:10:40,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:10:40,377 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:10:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:10:41,954 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2025-02-05 15:10:41,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:10:41,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-02-05 15:10:41,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:10:41,955 INFO L225 Difference]: With dead ends: 47 [2025-02-05 15:10:41,955 INFO L226 Difference]: Without dead ends: 45 [2025-02-05 15:10:41,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:10:41,956 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 15:10:41,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 101 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 15:10:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-05 15:10:41,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-02-05 15:10:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 15:10:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2025-02-05 15:10:41,964 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 19 [2025-02-05 15:10:41,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:10:41,964 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2025-02-05 15:10:41,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:10:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2025-02-05 15:10:41,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 15:10:41,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:10:41,965 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:10:41,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:10:42,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:10:42,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:10:42,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:10:42,170 INFO L85 PathProgramCache]: Analyzing trace with hash -766198755, now seen corresponding path program 1 times [2025-02-05 15:10:42,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:10:42,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768084330] [2025-02-05 15:10:42,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:42,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:10:42,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:10:42,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:10:42,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:42,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:42,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:10:42,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:10:42,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768084330] [2025-02-05 15:10:42,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768084330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:10:42,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:10:42,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:10:42,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218797527] [2025-02-05 15:10:42,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:10:42,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:10:42,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:10:42,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:10:42,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:10:42,261 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:10:42,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:10:42,291 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2025-02-05 15:10:42,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:10:42,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-02-05 15:10:42,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:10:42,293 INFO L225 Difference]: With dead ends: 53 [2025-02-05 15:10:42,296 INFO L226 Difference]: Without dead ends: 46 [2025-02-05 15:10:42,297 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 15:10:42,297 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:10:42,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:10:42,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-05 15:10:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-05 15:10:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 15:10:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2025-02-05 15:10:42,313 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 19 [2025-02-05 15:10:42,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:10:42,313 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2025-02-05 15:10:42,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:10:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2025-02-05 15:10:42,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 15:10:42,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:10:42,313 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:10:42,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:10:42,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:10:42,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:10:42,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1891524392, now seen corresponding path program 1 times [2025-02-05 15:10:42,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:10:42,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901901107] [2025-02-05 15:10:42,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:42,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:10:42,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:10:42,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:10:42,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:42,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:10:42,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:10:42,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901901107] [2025-02-05 15:10:42,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901901107] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:10:42,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400994938] [2025-02-05 15:10:42,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:42,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:10:42,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:10:42,598 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 15:10:42,599 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 15:10:42,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:10:42,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:10:42,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:42,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:42,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:10:42,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:10:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:10:42,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:10:42,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:10:42,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400994938] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:10:42,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:10:42,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2025-02-05 15:10:42,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746955529] [2025-02-05 15:10:42,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:10:42,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:10:42,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:10:42,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:10:42,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:10:42,812 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 15:10:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:10:42,943 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2025-02-05 15:10:42,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:10:42,951 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 25 [2025-02-05 15:10:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:10:42,952 INFO L225 Difference]: With dead ends: 53 [2025-02-05 15:10:42,952 INFO L226 Difference]: Without dead ends: 48 [2025-02-05 15:10:42,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:10:42,953 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:10:42,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 133 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:10:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-05 15:10:42,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2025-02-05 15:10:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 15:10:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-02-05 15:10:42,969 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 25 [2025-02-05 15:10:42,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:10:42,969 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-02-05 15:10:42,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 15:10:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-02-05 15:10:42,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 15:10:42,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:10:42,970 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:10:42,984 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 15:10:43,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:10:43,171 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:10:43,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:10:43,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2058223402, now seen corresponding path program 1 times [2025-02-05 15:10:43,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:10:43,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314348886] [2025-02-05 15:10:43,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:43,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:10:43,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 15:10:43,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 15:10:43,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:43,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:10:43,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:10:43,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314348886] [2025-02-05 15:10:43,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314348886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:10:43,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:10:43,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:10:43,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079182958] [2025-02-05 15:10:43,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:10:43,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:10:43,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:10:43,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:10:43,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:10:43,248 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:10:43,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:10:43,295 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2025-02-05 15:10:43,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:10:43,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2025-02-05 15:10:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:10:43,300 INFO L225 Difference]: With dead ends: 61 [2025-02-05 15:10:43,300 INFO L226 Difference]: Without dead ends: 40 [2025-02-05 15:10:43,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:10:43,300 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:10:43,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 91 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:10:43,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-05 15:10:43,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-05 15:10:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-05 15:10:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-02-05 15:10:43,309 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 31 [2025-02-05 15:10:43,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:10:43,309 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-02-05 15:10:43,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:10:43,309 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2025-02-05 15:10:43,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 15:10:43,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:10:43,310 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:10:43,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:10:43,310 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:10:43,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:10:43,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1717573043, now seen corresponding path program 1 times [2025-02-05 15:10:43,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:10:43,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109937400] [2025-02-05 15:10:43,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:43,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:10:43,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 15:10:43,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 15:10:43,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:43,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 15:10:43,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:10:43,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109937400] [2025-02-05 15:10:43,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109937400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:10:43,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:10:43,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:10:43,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783253601] [2025-02-05 15:10:43,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:10:43,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:10:43,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:10:43,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:10:43,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:10:43,368 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 15:10:43,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:10:43,400 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2025-02-05 15:10:43,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:10:43,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2025-02-05 15:10:43,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:10:43,401 INFO L225 Difference]: With dead ends: 70 [2025-02-05 15:10:43,401 INFO L226 Difference]: Without dead ends: 49 [2025-02-05 15:10:43,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:10:43,402 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 23 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:10:43,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:10:43,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-05 15:10:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-02-05 15:10:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-05 15:10:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-02-05 15:10:43,424 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 37 [2025-02-05 15:10:43,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:10:43,424 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-02-05 15:10:43,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 15:10:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-02-05 15:10:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 15:10:43,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:10:43,425 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:10:43,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:10:43,425 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:10:43,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:10:43,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1141283122, now seen corresponding path program 1 times [2025-02-05 15:10:43,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:10:43,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976840989] [2025-02-05 15:10:43,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:43,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:10:43,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 15:10:43,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 15:10:43,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:43,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 15:10:43,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:10:43,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976840989] [2025-02-05 15:10:43,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976840989] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:10:43,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897830697] [2025-02-05 15:10:43,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:43,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:10:43,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:10:43,502 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 15:10:43,504 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 15:10:43,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 15:10:43,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 15:10:43,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:43,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:43,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 15:10:43,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:10:43,571 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:10:43,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:10:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 15:10:43,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897830697] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:10:43,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:10:43,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-02-05 15:10:43,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575675106] [2025-02-05 15:10:43,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:10:43,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:10:43,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:10:43,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:10:43,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:10:43,625 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-05 15:10:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:10:43,740 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2025-02-05 15:10:43,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 15:10:43,740 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 39 [2025-02-05 15:10:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:10:43,741 INFO L225 Difference]: With dead ends: 125 [2025-02-05 15:10:43,743 INFO L226 Difference]: Without dead ends: 104 [2025-02-05 15:10:43,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:10:43,743 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:10:43,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 141 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:10:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-05 15:10:43,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2025-02-05 15:10:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 68 states have internal predecessors, (82), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 15:10:43,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2025-02-05 15:10:43,769 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 39 [2025-02-05 15:10:43,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:10:43,770 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2025-02-05 15:10:43,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-05 15:10:43,770 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2025-02-05 15:10:43,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 15:10:43,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:10:43,772 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:10:43,778 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 15:10:43,973 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 15:10:43,973 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:10:43,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:10:43,974 INFO L85 PathProgramCache]: Analyzing trace with hash 318935871, now seen corresponding path program 1 times [2025-02-05 15:10:43,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:10:43,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96971277] [2025-02-05 15:10:43,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:43,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:10:43,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 15:10:43,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 15:10:43,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:43,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:44,016 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:10:44,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:10:44,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96971277] [2025-02-05 15:10:44,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96971277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:10:44,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:10:44,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:10:44,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389024523] [2025-02-05 15:10:44,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:10:44,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:10:44,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:10:44,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:10:44,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:10:44,017 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 15:10:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:10:44,056 INFO L93 Difference]: Finished difference Result 154 states and 198 transitions. [2025-02-05 15:10:44,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:10:44,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 43 [2025-02-05 15:10:44,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:10:44,058 INFO L225 Difference]: With dead ends: 154 [2025-02-05 15:10:44,058 INFO L226 Difference]: Without dead ends: 115 [2025-02-05 15:10:44,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:10:44,059 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 20 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:10:44,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 86 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:10:44,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-05 15:10:44,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2025-02-05 15:10:44,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 79 states have internal predecessors, (96), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-05 15:10:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions. [2025-02-05 15:10:44,079 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 43 [2025-02-05 15:10:44,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:10:44,079 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions. [2025-02-05 15:10:44,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 15:10:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2025-02-05 15:10:44,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 15:10:44,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:10:44,080 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:10:44,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:10:44,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:10:44,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:10:44,081 INFO L85 PathProgramCache]: Analyzing trace with hash 191952453, now seen corresponding path program 1 times [2025-02-05 15:10:44,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:10:44,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449411393] [2025-02-05 15:10:44,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:44,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:10:44,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 15:10:44,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 15:10:44,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:44,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:10:44,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:10:44,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449411393] [2025-02-05 15:10:44,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449411393] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:10:44,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472729938] [2025-02-05 15:10:44,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:44,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:10:44,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:10:44,188 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 15:10:44,189 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 15:10:44,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 15:10:44,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 15:10:44,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:44,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:44,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:10:44,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:10:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:10:44,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:10:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:10:44,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472729938] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:10:44,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:10:44,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2025-02-05 15:10:44,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966686126] [2025-02-05 15:10:44,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:10:44,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:10:44,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:10:44,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:10:44,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:10:44,351 INFO L87 Difference]: Start difference. First operand 105 states and 133 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2025-02-05 15:10:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:10:44,502 INFO L93 Difference]: Finished difference Result 215 states and 279 transitions. [2025-02-05 15:10:44,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 15:10:44,502 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 45 [2025-02-05 15:10:44,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:10:44,504 INFO L225 Difference]: With dead ends: 215 [2025-02-05 15:10:44,504 INFO L226 Difference]: Without dead ends: 168 [2025-02-05 15:10:44,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:10:44,504 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 74 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:10:44,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 162 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:10:44,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-05 15:10:44,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 149. [2025-02-05 15:10:44,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 111 states have (on average 1.2432432432432432) internal successors, (138), 112 states have internal predecessors, (138), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-05 15:10:44,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 193 transitions. [2025-02-05 15:10:44,551 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 193 transitions. Word has length 45 [2025-02-05 15:10:44,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:10:44,552 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 193 transitions. [2025-02-05 15:10:44,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2025-02-05 15:10:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 193 transitions. [2025-02-05 15:10:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 15:10:44,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:10:44,552 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:10:44,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:10:44,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:10:44,753 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:10:44,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:10:44,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1202242871, now seen corresponding path program 1 times [2025-02-05 15:10:44,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:10:44,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628160584] [2025-02-05 15:10:44,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:44,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:10:44,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 15:10:44,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 15:10:44,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:44,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:44,953 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:10:44,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:10:44,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628160584] [2025-02-05 15:10:44,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628160584] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:10:44,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639207758] [2025-02-05 15:10:44,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:44,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:10:44,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:10:44,955 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 15:10:44,958 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 15:10:44,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 15:10:44,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 15:10:44,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:44,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:44,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:10:44,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:10:45,054 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:10:45,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:10:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:10:45,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639207758] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:10:45,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:10:45,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2025-02-05 15:10:45,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135629669] [2025-02-05 15:10:45,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:10:45,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:10:45,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:10:45,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:10:45,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:10:45,148 INFO L87 Difference]: Start difference. First operand 149 states and 193 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2025-02-05 15:10:45,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:10:45,377 INFO L93 Difference]: Finished difference Result 207 states and 274 transitions. [2025-02-05 15:10:45,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 15:10:45,377 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) Word has length 51 [2025-02-05 15:10:45,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:10:45,379 INFO L225 Difference]: With dead ends: 207 [2025-02-05 15:10:45,379 INFO L226 Difference]: Without dead ends: 202 [2025-02-05 15:10:45,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2025-02-05 15:10:45,379 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 143 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:10:45,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 171 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:10:45,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-05 15:10:45,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2025-02-05 15:10:45,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 144 states have (on average 1.2361111111111112) internal successors, (178), 148 states have internal predecessors, (178), 38 states have call successors, (38), 12 states have call predecessors, (38), 11 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-05 15:10:45,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 253 transitions. [2025-02-05 15:10:45,411 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 253 transitions. Word has length 51 [2025-02-05 15:10:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:10:45,411 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 253 transitions. [2025-02-05 15:10:45,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2025-02-05 15:10:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 253 transitions. [2025-02-05 15:10:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 15:10:45,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:10:45,412 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:10:45,418 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 15:10:45,617 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,SelfDestructingSolverStorable9 [2025-02-05 15:10:45,617 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:10:45,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:10:45,618 INFO L85 PathProgramCache]: Analyzing trace with hash -760810850, now seen corresponding path program 2 times [2025-02-05 15:10:45,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:10:45,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289412522] [2025-02-05 15:10:45,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:10:45,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:10:45,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-02-05 15:10:45,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 15:10:45,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:10:45,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:45,813 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 18 proven. 98 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-05 15:10:45,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:10:45,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289412522] [2025-02-05 15:10:45,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289412522] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:10:45,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715616208] [2025-02-05 15:10:45,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:10:45,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:10:45,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:10:45,816 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 15:10:45,817 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 15:10:45,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-02-05 15:10:45,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 15:10:45,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:10:45,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:45,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 15:10:45,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:10:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 18 proven. 210 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:10:45,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:10:46,113 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 18 proven. 98 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-05 15:10:46,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715616208] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:10:46,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:10:46,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 14 [2025-02-05 15:10:46,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852141890] [2025-02-05 15:10:46,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:10:46,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:10:46,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:10:46,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:10:46,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:10:46,115 INFO L87 Difference]: Start difference. First operand 194 states and 253 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 11 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) [2025-02-05 15:10:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:10:46,352 INFO L93 Difference]: Finished difference Result 262 states and 344 transitions. [2025-02-05 15:10:46,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 15:10:46,353 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 11 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) Word has length 87 [2025-02-05 15:10:46,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:10:46,354 INFO L225 Difference]: With dead ends: 262 [2025-02-05 15:10:46,354 INFO L226 Difference]: Without dead ends: 204 [2025-02-05 15:10:46,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 164 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:10:46,355 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 116 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:10:46,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 196 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:10:46,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-05 15:10:46,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2025-02-05 15:10:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 151 states have (on average 1.1986754966887416) internal successors, (181), 152 states have internal predecessors, (181), 38 states have call successors, (38), 12 states have call predecessors, (38), 11 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-05 15:10:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 256 transitions. [2025-02-05 15:10:46,389 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 256 transitions. Word has length 87 [2025-02-05 15:10:46,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:10:46,389 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 256 transitions. [2025-02-05 15:10:46,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 11 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) [2025-02-05 15:10:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 256 transitions. [2025-02-05 15:10:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 15:10:46,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:10:46,390 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:10:46,396 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 15:10:46,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:10:46,594 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:10:46,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:10:46,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1449499115, now seen corresponding path program 2 times [2025-02-05 15:10:46,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:10:46,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015294914] [2025-02-05 15:10:46,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:10:46,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:10:46,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-02-05 15:10:46,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 15:10:46,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:10:46,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 112 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-05 15:10:46,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:10:46,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015294914] [2025-02-05 15:10:46,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015294914] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:10:46,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301428993] [2025-02-05 15:10:46,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:10:46,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:10:46,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:10:46,845 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 15:10:46,847 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 15:10:46,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-02-05 15:10:46,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 15:10:46,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:10:46,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:46,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 15:10:46,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:10:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 256 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:10:46,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:10:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 112 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-05 15:10:47,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301428993] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:10:47,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:10:47,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 13 [2025-02-05 15:10:47,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068877195] [2025-02-05 15:10:47,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:10:47,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 15:10:47,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:10:47,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 15:10:47,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:10:47,109 INFO L87 Difference]: Start difference. First operand 201 states and 256 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 11 states have call successors, (23), 12 states have call predecessors, (23), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2025-02-05 15:10:47,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:10:47,277 INFO L93 Difference]: Finished difference Result 245 states and 317 transitions. [2025-02-05 15:10:47,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 15:10:47,277 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 11 states have call successors, (23), 12 states have call predecessors, (23), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 93 [2025-02-05 15:10:47,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:10:47,278 INFO L225 Difference]: With dead ends: 245 [2025-02-05 15:10:47,278 INFO L226 Difference]: Without dead ends: 204 [2025-02-05 15:10:47,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 175 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2025-02-05 15:10:47,279 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 78 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:10:47,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 187 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:10:47,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-05 15:10:47,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-02-05 15:10:47,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 154 states have (on average 1.1818181818181819) internal successors, (182), 154 states have internal predecessors, (182), 38 states have call successors, (38), 12 states have call predecessors, (38), 11 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-05 15:10:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 257 transitions. [2025-02-05 15:10:47,306 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 257 transitions. Word has length 93 [2025-02-05 15:10:47,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:10:47,306 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 257 transitions. [2025-02-05 15:10:47,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 11 states have call successors, (23), 12 states have call predecessors, (23), 11 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2025-02-05 15:10:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 257 transitions. [2025-02-05 15:10:47,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 15:10:47,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:10:47,307 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 8, 8, 8, 8, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:10:47,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 15:10:47,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:10:47,508 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:10:47,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:10:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1311565561, now seen corresponding path program 2 times [2025-02-05 15:10:47,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:10:47,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129091663] [2025-02-05 15:10:47,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:10:47,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:10:47,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-02-05 15:10:47,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:10:47,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:10:47,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-02-05 15:10:47,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:10:47,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129091663] [2025-02-05 15:10:47,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129091663] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:10:47,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554702663] [2025-02-05 15:10:47,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:10:47,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:10:47,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:10:47,707 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 15:10:47,709 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 15:10:47,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-02-05 15:10:47,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:10:47,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:10:47,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:47,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:10:47,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:10:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 48 proven. 1 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-02-05 15:10:47,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:10:49,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554702663] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:10:49,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:10:49,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2025-02-05 15:10:49,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086339933] [2025-02-05 15:10:49,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:10:49,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:10:49,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:10:49,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:10:49,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=124, Unknown=1, NotChecked=0, Total=156 [2025-02-05 15:10:49,623 INFO L87 Difference]: Start difference. First operand 204 states and 257 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:10:49,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:10:49,778 INFO L93 Difference]: Finished difference Result 387 states and 500 transitions. [2025-02-05 15:10:49,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:10:49,779 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2025-02-05 15:10:49,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:10:49,781 INFO L225 Difference]: With dead ends: 387 [2025-02-05 15:10:49,781 INFO L226 Difference]: Without dead ends: 243 [2025-02-05 15:10:49,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=46, Invalid=163, Unknown=1, NotChecked=0, Total=210 [2025-02-05 15:10:49,782 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 28 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:10:49,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 250 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:10:49,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-02-05 15:10:49,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 194. [2025-02-05 15:10:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 146 states have (on average 1.1506849315068493) internal successors, (168), 146 states have internal predecessors, (168), 36 states have call successors, (36), 12 states have call predecessors, (36), 11 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-05 15:10:49,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 239 transitions. [2025-02-05 15:10:49,813 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 239 transitions. Word has length 99 [2025-02-05 15:10:49,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:10:49,814 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 239 transitions. [2025-02-05 15:10:49,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:10:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 239 transitions. [2025-02-05 15:10:49,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 15:10:49,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:10:49,816 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 7, 7, 7, 7, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:10:49,825 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 15:10:50,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:10:50,016 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:10:50,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:10:50,017 INFO L85 PathProgramCache]: Analyzing trace with hash -369859294, now seen corresponding path program 1 times [2025-02-05 15:10:50,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:10:50,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294755515] [2025-02-05 15:10:50,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:50,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:10:50,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:10:50,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:10:50,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:50,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:10:50,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136111790] [2025-02-05 15:10:50,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:50,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:10:50,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:10:50,053 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:10:50,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 15:10:50,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:10:50,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:10:50,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:50,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:10:50,118 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 15:10:50,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:10:50,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:10:50,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:50,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:10:50,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 15:10:50,164 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 15:10:50,165 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:10:50,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 15:10:50,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 15:10:50,369 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:10:50,403 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:10:50,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:10:50 BoogieIcfgContainer [2025-02-05 15:10:50,406 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:10:50,406 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:10:50,406 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:10:50,406 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:10:50,407 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:10:39" (3/4) ... [2025-02-05 15:10:50,407 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 15:10:50,461 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 71. [2025-02-05 15:10:50,533 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:10:50,533 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:10:50,533 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:10:50,534 INFO L158 Benchmark]: Toolchain (without parser) took 11479.63ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 113.3MB in the beginning and 140.0MB in the end (delta: -26.7MB). Peak memory consumption was 93.7MB. Max. memory is 16.1GB. [2025-02-05 15:10:50,534 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory was 124.4MB in the beginning and 124.1MB in the end (delta: 293.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:10:50,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.91ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 101.7MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:10:50,534 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.39ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:10:50,534 INFO L158 Benchmark]: Boogie Preprocessor took 16.07ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.5MB in the end (delta: 916.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:10:50,535 INFO L158 Benchmark]: IcfgBuilder took 223.17ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 87.0MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:10:50,535 INFO L158 Benchmark]: TraceAbstraction took 10860.03ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 86.1MB in the beginning and 56.0MB in the end (delta: 30.1MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2025-02-05 15:10:50,535 INFO L158 Benchmark]: Witness Printer took 127.25ms. Allocated memory is still 176.2MB. Free memory was 56.0MB in the beginning and 140.0MB in the end (delta: -84.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:10:50,540 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory was 124.4MB in the beginning and 124.1MB in the end (delta: 293.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.91ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 101.7MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.39ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.07ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.5MB in the end (delta: 916.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 223.17ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 87.0MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10860.03ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 86.1MB in the beginning and 56.0MB in the end (delta: 30.1MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. * Witness Printer took 127.25ms. Allocated memory is still 176.2MB. Free memory was 56.0MB in the beginning and 140.0MB in the end (delta: -84.0MB). 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 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] CALL assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [A=199, R=15, counter=0] [L27] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L27] RET assume_abort_if_not(A % 2 == 1) VAL [A=199, R=15, counter=0] [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A VAL [A=199, counter=0, r=26, u=31, v=1] [L34] COND TRUE counter++<10 [L34] EXPR counter++ VAL [A=199, counter=1, r=26, u=31, v=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=1, r=26, u=31, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=199, counter=1, r=26, u=31, v=1] [L39] COND TRUE counter++<10 [L39] EXPR counter++ VAL [A=199, counter=2, r=26, u=31, v=1] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=2, r=26, u=31, v=1] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=199, counter=2, r=25, u=31, v=3] [L39] COND TRUE counter++<10 [L39] EXPR counter++ VAL [A=199, counter=3, r=25, u=31, v=3] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=3, r=25, u=31, v=3] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=199, counter=3, r=22, u=31, v=5] [L39] COND TRUE counter++<10 [L39] EXPR counter++ VAL [A=199, counter=4, r=22, u=31, v=5] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=4, r=22, u=31, v=5] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=199, counter=4, r=17, u=31, v=7] [L39] COND TRUE counter++<10 [L39] EXPR counter++ VAL [A=199, counter=5, r=17, u=31, v=7] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=5, r=17, u=31, v=7] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=199, counter=5, r=10, u=31, v=9] [L39] COND TRUE counter++<10 [L39] EXPR counter++ VAL [A=199, counter=6, r=10, u=31, v=9] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=6, r=10, u=31, v=9] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=199, counter=6, r=1, u=31, v=11] [L39] COND TRUE counter++<10 [L39] EXPR counter++ VAL [A=199, counter=7, r=1, u=31, v=11] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=7, r=1, u=31, v=11] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=199, counter=7, r=-10, u=31, v=13] [L39] COND TRUE counter++<10 [L39] EXPR counter++ VAL [A=199, counter=8, r=-10, u=31, v=13] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=8, r=-10, u=31, v=13] [L41] COND TRUE !(r > 0) VAL [A=199, counter=8, r=-10, u=31, v=13] [L47] COND TRUE counter++<10 [L47] EXPR counter++ VAL [A=199, counter=9, r=-10, u=31, v=13] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=9, r=-10, u=31, v=13] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [A=199, counter=9, r=21, u=33, v=13] [L47] COND TRUE counter++<10 [L47] EXPR counter++ VAL [A=199, counter=10, r=21, u=33, v=13] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=199, counter=10, r=21, u=33, v=13] [L49] COND TRUE !(r < 0) VAL [A=199, counter=10, r=21, u=33, v=13] [L34] COND TRUE counter++<10 [L34] EXPR counter++ VAL [A=199, counter=11, r=21, u=33, v=13] [L34] COND FALSE !(counter++<10) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=11] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=11] [L14] reach_error() VAL [\old(cond)=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 14, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 605 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 592 mSDsluCounter, 1745 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1314 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 716 IncrementalHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 431 mSDtfsCounter, 716 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 930 GetRequests, 785 SyntacticMatches, 23 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=12, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 120 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1280 NumberOfCodeBlocks, 1280 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1376 ConstructedInterpolants, 0 QuantifiedInterpolants, 3216 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1258 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 1538/2510 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 RESULT: Ultimate proved your program to be incorrect! [2025-02-05 15:10:50,561 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE