./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.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_unwindbound50.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 ca2134f8a32f49a0943527ee47fd89b4eb01286294fd09a8197c7c707de74c1d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:10:54,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:10:54,338 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:54,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:10:54,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:10:54,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:10:54,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:10:54,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:10:54,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:10:54,376 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:10:54,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:10:54,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:10:54,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:10:54,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:10:54,378 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:10:54,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:10:54,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:10:54,378 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:10:54,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:10:54,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:10:54,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:10:54,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:10:54,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:10:54,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:10:54,380 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:10:54,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:10:54,380 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:10:54,380 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:10:54,380 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:10:54,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:10:54,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:10:54,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:10:54,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:10:54,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:10:54,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:10:54,381 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:10:54,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:10:54,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:10:54,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:10:54,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:10:54,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:10:54,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:10:54,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:10:54,381 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 -> ca2134f8a32f49a0943527ee47fd89b4eb01286294fd09a8197c7c707de74c1d [2025-02-05 15:10:54,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:10:54,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:10:54,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:10:54,684 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:10:54,687 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:10:54,689 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_unwindbound50.c [2025-02-05 15:10:55,987 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31bbab25e/faf7810e3fa94ad4a9ab1f78afd53581/FLAGa13bb9932 [2025-02-05 15:10:56,223 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:10:56,224 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2025-02-05 15:10:56,252 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31bbab25e/faf7810e3fa94ad4a9ab1f78afd53581/FLAGa13bb9932 [2025-02-05 15:10:56,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/31bbab25e/faf7810e3fa94ad4a9ab1f78afd53581 [2025-02-05 15:10:56,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:10:56,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:10:56,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:10:56,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:10:56,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:10:56,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:10:56" (1/1) ... [2025-02-05 15:10:56,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5bc6dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:56, skipping insertion in model container [2025-02-05 15:10:56,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:10:56" (1/1) ... [2025-02-05 15:10:56,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:10:56,413 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_unwindbound50.c[535,548] [2025-02-05 15:10:56,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:10:56,447 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:10:56,455 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_unwindbound50.c[535,548] [2025-02-05 15:10:56,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:10:56,483 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:10:56,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:56 WrapperNode [2025-02-05 15:10:56,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:10:56,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:10:56,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:10:56,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:10:56,493 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:56" (1/1) ... [2025-02-05 15:10:56,498 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:56" (1/1) ... [2025-02-05 15:10:56,511 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2025-02-05 15:10:56,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:10:56,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:10:56,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:10:56,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:10:56,518 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:56" (1/1) ... [2025-02-05 15:10:56,518 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:56" (1/1) ... [2025-02-05 15:10:56,519 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:56" (1/1) ... [2025-02-05 15:10:56,528 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:56,528 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:56" (1/1) ... [2025-02-05 15:10:56,528 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:56" (1/1) ... [2025-02-05 15:10:56,531 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:56" (1/1) ... [2025-02-05 15:10:56,532 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:56" (1/1) ... [2025-02-05 15:10:56,532 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:56" (1/1) ... [2025-02-05 15:10:56,533 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:56" (1/1) ... [2025-02-05 15:10:56,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:10:56,534 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:10:56,535 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:10:56,535 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:10:56,535 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:56" (1/1) ... [2025-02-05 15:10:56,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:10:56,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:10:56,561 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:56,563 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:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:10:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 15:10:56,579 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 15:10:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:10:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:10:56,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:10:56,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 15:10:56,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 15:10:56,629 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:10:56,632 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:10:56,823 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-05 15:10:56,824 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:10:56,832 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:10:56,833 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:10:56,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:10:56 BoogieIcfgContainer [2025-02-05 15:10:56,834 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:10:56,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:10:56,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:10:56,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:10:56,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:10:56" (1/3) ... [2025-02-05 15:10:56,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443c7639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:10:56, skipping insertion in model container [2025-02-05 15:10:56,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:10:56" (2/3) ... [2025-02-05 15:10:56,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443c7639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:10:56, skipping insertion in model container [2025-02-05 15:10:56,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:10:56" (3/3) ... [2025-02-05 15:10:56,844 INFO L128 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound50.c [2025-02-05 15:10:56,856 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:10:56,857 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fermat1-ll_unwindbound50.c that has 3 procedures, 32 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-05 15:10:56,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:10:56,915 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;@13fc5640, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:10:56,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:10:56,920 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:56,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 15:10:56,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:10:56,927 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:56,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:10:56,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:10:56,932 INFO L85 PathProgramCache]: Analyzing trace with hash -758256744, now seen corresponding path program 1 times [2025-02-05 15:10:56,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:10:56,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436411413] [2025-02-05 15:10:56,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:56,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:10:57,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 15:10:57,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 15:10:57,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:57,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:57,052 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:57,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:10:57,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436411413] [2025-02-05 15:10:57,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436411413] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:10:57,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167530414] [2025-02-05 15:10:57,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:57,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:10:57,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:10:57,056 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:57,057 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:57,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 15:10:57,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 15:10:57,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:57,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:57,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:10:57,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:10:57,130 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:57,130 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:10:57,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167530414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:10:57,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:10:57,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 15:10:57,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029310874] [2025-02-05 15:10:57,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:10:57,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:10:57,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:10:57,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:10:57,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:10:57,155 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:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:10:57,170 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2025-02-05 15:10:57,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:10:57,172 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:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:10:57,176 INFO L225 Difference]: With dead ends: 61 [2025-02-05 15:10:57,176 INFO L226 Difference]: Without dead ends: 28 [2025-02-05 15:10:57,180 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:57,183 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:57,183 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:57,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-05 15:10:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-05 15:10:57,204 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:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-02-05 15:10:57,208 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2025-02-05 15:10:57,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:10:57,208 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-02-05 15:10:57,208 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:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-02-05 15:10:57,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 15:10:57,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:10:57,210 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:57,216 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:57,410 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:57,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:10:57,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:10:57,412 INFO L85 PathProgramCache]: Analyzing trace with hash -766943530, now seen corresponding path program 1 times [2025-02-05 15:10:57,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:10:57,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521141889] [2025-02-05 15:10:57,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:57,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:10:57,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:10:57,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:10:57,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:57,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:10:57,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590469499] [2025-02-05 15:10:57,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:57,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:10:57,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:10:57,467 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:57,470 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:57,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:10:57,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:10:57,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:57,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:57,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:10:57,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:10:57,804 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:57,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:10:57,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:10:57,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521141889] [2025-02-05 15:10:57,805 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:10:57,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590469499] [2025-02-05 15:10:57,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590469499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:10:57,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:10:57,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:10:57,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641231333] [2025-02-05 15:10:57,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:10:57,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:10:57,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:10:57,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:10:57,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:10:57,807 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:59,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 15:10:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:10:59,587 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2025-02-05 15:10:59,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:10:59,587 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:59,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:10:59,588 INFO L225 Difference]: With dead ends: 47 [2025-02-05 15:10:59,588 INFO L226 Difference]: Without dead ends: 45 [2025-02-05 15:10:59,588 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:59,589 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:10:59,589 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.7s Time] [2025-02-05 15:10:59,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-05 15:10:59,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-02-05 15:10:59,601 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:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2025-02-05 15:10:59,603 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 19 [2025-02-05 15:10:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:10:59,603 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2025-02-05 15:10:59,603 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:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2025-02-05 15:10:59,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 15:10:59,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:10:59,604 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:59,612 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:59,808 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:59,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:10:59,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:10:59,809 INFO L85 PathProgramCache]: Analyzing trace with hash -766198755, now seen corresponding path program 1 times [2025-02-05 15:10:59,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:10:59,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545923178] [2025-02-05 15:10:59,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:10:59,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:10:59,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 15:10:59,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 15:10:59,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:10:59,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:10:59,951 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:59,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:10:59,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545923178] [2025-02-05 15:10:59,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545923178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:10:59,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:10:59,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:10:59,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745730434] [2025-02-05 15:10:59,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:10:59,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:10:59,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:10:59,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:10:59,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:10:59,953 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:59,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:10:59,983 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2025-02-05 15:10:59,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:10:59,983 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:59,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:10:59,985 INFO L225 Difference]: With dead ends: 53 [2025-02-05 15:10:59,987 INFO L226 Difference]: Without dead ends: 46 [2025-02-05 15:10:59,987 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:59,988 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:59,988 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:59,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-05 15:10:59,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-05 15:10:59,999 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:11:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2025-02-05 15:11:00,001 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 19 [2025-02-05 15:11:00,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:11:00,001 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2025-02-05 15:11:00,001 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:11:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2025-02-05 15:11:00,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 15:11:00,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:11:00,002 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:11:00,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:11:00,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:11:00,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:11:00,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1891524392, now seen corresponding path program 1 times [2025-02-05 15:11:00,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:11:00,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647266346] [2025-02-05 15:11:00,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:11:00,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:11:00,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:11:00,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:11:00,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:11:00,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:00,344 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:11:00,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:11:00,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647266346] [2025-02-05 15:11:00,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647266346] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:11:00,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108436280] [2025-02-05 15:11:00,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:11:00,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:11:00,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:11:00,348 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:11:00,350 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:11:00,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:11:00,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:11:00,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:11:00,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:00,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:11:00,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:11:00,481 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:11:00,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:11:00,650 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:11:00,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108436280] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:11:00,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:11:00,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2025-02-05 15:11:00,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649078804] [2025-02-05 15:11:00,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:11:00,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:11:00,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:11:00,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:11:00,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:11:00,653 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:11:00,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:11:00,776 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2025-02-05 15:11:00,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:11:00,777 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:11:00,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:11:00,780 INFO L225 Difference]: With dead ends: 53 [2025-02-05 15:11:00,780 INFO L226 Difference]: Without dead ends: 48 [2025-02-05 15:11:00,780 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:11:00,781 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:11:00,781 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:11:00,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-05 15:11:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2025-02-05 15:11:00,799 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:11:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-02-05 15:11:00,801 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 25 [2025-02-05 15:11:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:11:00,801 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-02-05 15:11:00,801 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:11:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-02-05 15:11:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 15:11:00,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:11:00,802 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:11:00,811 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:11:01,008 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:11:01,009 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:11:01,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:11:01,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2058223402, now seen corresponding path program 1 times [2025-02-05 15:11:01,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:11:01,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260335274] [2025-02-05 15:11:01,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:11:01,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:11:01,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 15:11:01,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 15:11:01,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:11:01,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:01,098 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:11:01,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:11:01,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260335274] [2025-02-05 15:11:01,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260335274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:11:01,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:11:01,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:11:01,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216479751] [2025-02-05 15:11:01,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:11:01,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:11:01,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:11:01,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:11:01,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:11:01,099 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:11:01,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:11:01,150 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2025-02-05 15:11:01,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:11:01,151 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:11:01,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:11:01,152 INFO L225 Difference]: With dead ends: 61 [2025-02-05 15:11:01,152 INFO L226 Difference]: Without dead ends: 40 [2025-02-05 15:11:01,153 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:11:01,153 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:11:01,153 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:11:01,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-05 15:11:01,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-05 15:11:01,168 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:11:01,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-02-05 15:11:01,169 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 31 [2025-02-05 15:11:01,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:11:01,170 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-02-05 15:11:01,170 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:11:01,170 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2025-02-05 15:11:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 15:11:01,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:11:01,172 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:11:01,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:11:01,172 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:11:01,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:11:01,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1717573043, now seen corresponding path program 1 times [2025-02-05 15:11:01,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:11:01,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921671658] [2025-02-05 15:11:01,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:11:01,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:11:01,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 15:11:01,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 15:11:01,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:11:01,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:01,267 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:11:01,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:11:01,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921671658] [2025-02-05 15:11:01,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921671658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:11:01,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:11:01,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:11:01,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239782093] [2025-02-05 15:11:01,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:11:01,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:11:01,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:11:01,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:11:01,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:11:01,269 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:11:01,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:11:01,315 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2025-02-05 15:11:01,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:11:01,316 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:11:01,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:11:01,317 INFO L225 Difference]: With dead ends: 70 [2025-02-05 15:11:01,317 INFO L226 Difference]: Without dead ends: 49 [2025-02-05 15:11:01,317 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:11:01,318 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:11:01,318 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:11:01,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-05 15:11:01,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-02-05 15:11:01,331 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:11:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-02-05 15:11:01,332 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 37 [2025-02-05 15:11:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:11:01,332 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-02-05 15:11:01,333 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:11:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-02-05 15:11:01,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 15:11:01,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:11:01,334 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:11:01,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:11:01,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:11:01,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:11:01,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1141283122, now seen corresponding path program 1 times [2025-02-05 15:11:01,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:11:01,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645224337] [2025-02-05 15:11:01,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:11:01,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:11:01,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 15:11:01,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 15:11:01,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:11:01,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:01,423 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:11:01,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:11:01,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645224337] [2025-02-05 15:11:01,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645224337] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:11:01,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710045704] [2025-02-05 15:11:01,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:11:01,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:11:01,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:11:01,427 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:11:01,429 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:11:01,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 15:11:01,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 15:11:01,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:11:01,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:01,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 15:11:01,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:11:01,544 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:11:01,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:11:01,624 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:11:01,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710045704] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:11:01,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:11:01,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-02-05 15:11:01,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228447796] [2025-02-05 15:11:01,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:11:01,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:11:01,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:11:01,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:11:01,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:11:01,627 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:11:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:11:01,803 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2025-02-05 15:11:01,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 15:11:01,805 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:11:01,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:11:01,806 INFO L225 Difference]: With dead ends: 125 [2025-02-05 15:11:01,806 INFO L226 Difference]: Without dead ends: 104 [2025-02-05 15:11:01,807 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:11:01,807 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:11:01,807 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:11:01,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-05 15:11:01,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2025-02-05 15:11:01,848 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:11:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2025-02-05 15:11:01,851 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 39 [2025-02-05 15:11:01,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:11:01,851 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2025-02-05 15:11:01,851 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:11:01,851 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2025-02-05 15:11:01,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 15:11:01,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:11:01,852 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:11:01,860 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:11:02,053 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:11:02,053 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:11:02,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:11:02,054 INFO L85 PathProgramCache]: Analyzing trace with hash 318935871, now seen corresponding path program 1 times [2025-02-05 15:11:02,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:11:02,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176800867] [2025-02-05 15:11:02,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:11:02,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:11:02,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 15:11:02,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 15:11:02,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:11:02,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:02,102 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:11:02,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:11:02,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176800867] [2025-02-05 15:11:02,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176800867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:11:02,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:11:02,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:11:02,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602488623] [2025-02-05 15:11:02,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:11:02,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:11:02,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:11:02,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:11:02,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:11:02,105 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:11:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:11:02,163 INFO L93 Difference]: Finished difference Result 154 states and 198 transitions. [2025-02-05 15:11:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:11:02,164 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:11:02,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:11:02,166 INFO L225 Difference]: With dead ends: 154 [2025-02-05 15:11:02,166 INFO L226 Difference]: Without dead ends: 115 [2025-02-05 15:11:02,167 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:11:02,167 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:11:02,168 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:11:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-05 15:11:02,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2025-02-05 15:11:02,198 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:11:02,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions. [2025-02-05 15:11:02,200 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 43 [2025-02-05 15:11:02,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:11:02,200 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions. [2025-02-05 15:11:02,200 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:11:02,201 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2025-02-05 15:11:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 15:11:02,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:11:02,205 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:11:02,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:11:02,205 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:11:02,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:11:02,205 INFO L85 PathProgramCache]: Analyzing trace with hash 191952453, now seen corresponding path program 1 times [2025-02-05 15:11:02,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:11:02,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516269271] [2025-02-05 15:11:02,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:11:02,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:11:02,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 15:11:02,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 15:11:02,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:11:02,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:02,324 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:11:02,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:11:02,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516269271] [2025-02-05 15:11:02,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516269271] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:11:02,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411256561] [2025-02-05 15:11:02,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:11:02,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:11:02,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:11:02,327 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:11:02,329 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:11:02,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 15:11:02,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 15:11:02,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:11:02,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:02,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:11:02,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:11:02,429 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:11:02,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:11:02,530 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:11:02,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411256561] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:11:02,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:11:02,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2025-02-05 15:11:02,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608924941] [2025-02-05 15:11:02,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:11:02,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:11:02,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:11:02,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:11:02,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:11:02,533 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:11:02,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:11:02,758 INFO L93 Difference]: Finished difference Result 215 states and 279 transitions. [2025-02-05 15:11:02,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 15:11:02,759 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:11:02,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:11:02,760 INFO L225 Difference]: With dead ends: 215 [2025-02-05 15:11:02,760 INFO L226 Difference]: Without dead ends: 168 [2025-02-05 15:11:02,761 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:11:02,762 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:11:02,762 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:11:02,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-05 15:11:02,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 149. [2025-02-05 15:11:02,820 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:11:02,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 193 transitions. [2025-02-05 15:11:02,823 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 193 transitions. Word has length 45 [2025-02-05 15:11:02,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:11:02,823 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 193 transitions. [2025-02-05 15:11:02,824 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:11:02,824 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 193 transitions. [2025-02-05 15:11:02,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 15:11:02,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:11:02,826 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:11:02,834 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:11:03,028 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:11:03,028 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:11:03,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:11:03,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1202242871, now seen corresponding path program 1 times [2025-02-05 15:11:03,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:11:03,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675363242] [2025-02-05 15:11:03,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:11:03,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:11:03,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 15:11:03,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 15:11:03,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:11:03,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:03,146 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:11:03,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:11:03,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675363242] [2025-02-05 15:11:03,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675363242] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:11:03,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336835706] [2025-02-05 15:11:03,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:11:03,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:11:03,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:11:03,149 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:11:03,152 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:11:03,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 15:11:03,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 15:11:03,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:11:03,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:03,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:11:03,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:11:03,277 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:11:03,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:11:03,402 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:11:03,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336835706] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:11:03,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:11:03,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2025-02-05 15:11:03,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083054440] [2025-02-05 15:11:03,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:11:03,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:11:03,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:11:03,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:11:03,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:11:03,404 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:11:03,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:11:03,702 INFO L93 Difference]: Finished difference Result 207 states and 274 transitions. [2025-02-05 15:11:03,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 15:11:03,703 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:11:03,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:11:03,704 INFO L225 Difference]: With dead ends: 207 [2025-02-05 15:11:03,704 INFO L226 Difference]: Without dead ends: 202 [2025-02-05 15:11:03,705 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:11:03,705 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.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:11:03,706 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.2s Time] [2025-02-05 15:11:03,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-05 15:11:03,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2025-02-05 15:11:03,750 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:11:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 253 transitions. [2025-02-05 15:11:03,752 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 253 transitions. Word has length 51 [2025-02-05 15:11:03,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:11:03,752 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 253 transitions. [2025-02-05 15:11:03,752 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:11:03,752 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 253 transitions. [2025-02-05 15:11:03,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 15:11:03,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:11:03,754 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:11:03,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:11:03,958 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:11:03,958 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:11:03,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:11:03,959 INFO L85 PathProgramCache]: Analyzing trace with hash -760810850, now seen corresponding path program 2 times [2025-02-05 15:11:03,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:11:03,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079826291] [2025-02-05 15:11:03,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:11:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:11:03,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-02-05 15:11:03,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 15:11:03,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:11:03,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:04,215 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:11:04,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:11:04,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079826291] [2025-02-05 15:11:04,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079826291] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:11:04,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135557091] [2025-02-05 15:11:04,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:11:04,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:11:04,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:11:04,218 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:11:04,220 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:11:04,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-02-05 15:11:04,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 15:11:04,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:11:04,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:04,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 15:11:04,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:11:04,388 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:11:04,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:11:04,616 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:11:04,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135557091] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:11:04,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:11:04,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 22 [2025-02-05 15:11:04,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254985837] [2025-02-05 15:11:04,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:11:04,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 15:11:04,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:11:04,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 15:11:04,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:11:04,620 INFO L87 Difference]: Start difference. First operand 194 states and 253 transitions. Second operand has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 19 states have call successors, (31), 11 states have call predecessors, (31), 10 states have return successors, (30), 18 states have call predecessors, (30), 18 states have call successors, (30) [2025-02-05 15:11:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:11:05,310 INFO L93 Difference]: Finished difference Result 549 states and 749 transitions. [2025-02-05 15:11:05,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-05 15:11:05,311 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 19 states have call successors, (31), 11 states have call predecessors, (31), 10 states have return successors, (30), 18 states have call predecessors, (30), 18 states have call successors, (30) Word has length 87 [2025-02-05 15:11:05,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:11:05,314 INFO L225 Difference]: With dead ends: 549 [2025-02-05 15:11:05,314 INFO L226 Difference]: Without dead ends: 491 [2025-02-05 15:11:05,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=507, Invalid=899, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 15:11:05,316 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 364 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:11:05,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 318 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:11:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-02-05 15:11:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 449. [2025-02-05 15:11:05,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 336 states have (on average 1.2470238095238095) internal successors, (419), 339 states have internal predecessors, (419), 93 states have call successors, (93), 20 states have call predecessors, (93), 19 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:11:05,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 604 transitions. [2025-02-05 15:11:05,473 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 604 transitions. Word has length 87 [2025-02-05 15:11:05,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:11:05,474 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 604 transitions. [2025-02-05 15:11:05,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 19 states have call successors, (31), 11 states have call predecessors, (31), 10 states have return successors, (30), 18 states have call predecessors, (30), 18 states have call successors, (30) [2025-02-05 15:11:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 604 transitions. [2025-02-05 15:11:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 15:11:05,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:11:05,477 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:11:05,484 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:11:05,677 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:11:05,678 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:11:05,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:11:05,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1449499115, now seen corresponding path program 2 times [2025-02-05 15:11:05,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:11:05,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184230301] [2025-02-05 15:11:05,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:11:05,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:11:05,687 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-02-05 15:11:05,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 15:11:05,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:11:05,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:06,062 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:11:06,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:11:06,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184230301] [2025-02-05 15:11:06,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184230301] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:11:06,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369257143] [2025-02-05 15:11:06,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:11:06,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:11:06,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:11:06,065 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:11:06,067 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:11:06,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-02-05 15:11:06,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 15:11:06,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:11:06,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:06,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 15:11:06,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:11:06,286 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:11:06,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:11:06,572 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:11:06,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369257143] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:11:06,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:11:06,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 24 [2025-02-05 15:11:06,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537973468] [2025-02-05 15:11:06,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:11:06,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 15:11:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:11:06,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 15:11:06,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2025-02-05 15:11:06,575 INFO L87 Difference]: Start difference. First operand 449 states and 604 transitions. Second operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) [2025-02-05 15:11:07,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:11:07,357 INFO L93 Difference]: Finished difference Result 746 states and 991 transitions. [2025-02-05 15:11:07,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-05 15:11:07,358 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) Word has length 93 [2025-02-05 15:11:07,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:11:07,361 INFO L225 Difference]: With dead ends: 746 [2025-02-05 15:11:07,361 INFO L226 Difference]: Without dead ends: 486 [2025-02-05 15:11:07,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=584, Invalid=1056, Unknown=0, NotChecked=0, Total=1640 [2025-02-05 15:11:07,365 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 456 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:11:07,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 337 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:11:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-02-05 15:11:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 437. [2025-02-05 15:11:07,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 327 states have (on average 1.2110091743119267) internal successors, (396), 328 states have internal predecessors, (396), 88 states have call successors, (88), 22 states have call predecessors, (88), 21 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2025-02-05 15:11:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 571 transitions. [2025-02-05 15:11:07,470 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 571 transitions. Word has length 93 [2025-02-05 15:11:07,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:11:07,471 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 571 transitions. [2025-02-05 15:11:07,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) [2025-02-05 15:11:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 571 transitions. [2025-02-05 15:11:07,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 15:11:07,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:11:07,474 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:11:07,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 15:11:07,678 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:11:07,678 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:11:07,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:11:07,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1311565561, now seen corresponding path program 2 times [2025-02-05 15:11:07,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:11:07,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376889110] [2025-02-05 15:11:07,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:11:07,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:11:07,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-02-05 15:11:07,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:11:07,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:11:07,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:07,976 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 20 proven. 114 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-02-05 15:11:07,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:11:07,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376889110] [2025-02-05 15:11:07,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376889110] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:11:07,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105698077] [2025-02-05 15:11:07,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:11:07,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:11:07,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:11:07,979 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:11:07,981 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:11:08,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-02-05 15:11:08,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:11:08,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:11:08,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:08,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 15:11:08,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:11:08,169 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 20 proven. 294 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:11:08,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:11:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 20 proven. 114 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-02-05 15:11:08,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105698077] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:11:08,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:11:08,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 26 [2025-02-05 15:11:08,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695416796] [2025-02-05 15:11:08,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:11:08,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 15:11:08,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:11:08,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 15:11:08,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2025-02-05 15:11:08,481 INFO L87 Difference]: Start difference. First operand 437 states and 571 transitions. Second operand has 26 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 26 states have internal predecessors, (112), 23 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 22 states have call predecessors, (36), 22 states have call successors, (36) [2025-02-05 15:11:09,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:11:09,231 INFO L93 Difference]: Finished difference Result 495 states and 652 transitions. [2025-02-05 15:11:09,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-05 15:11:09,231 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 26 states have internal predecessors, (112), 23 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 22 states have call predecessors, (36), 22 states have call successors, (36) Word has length 99 [2025-02-05 15:11:09,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:11:09,236 INFO L225 Difference]: With dead ends: 495 [2025-02-05 15:11:09,236 INFO L226 Difference]: Without dead ends: 490 [2025-02-05 15:11:09,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=670, Invalid=1222, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 15:11:09,239 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 415 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:11:09,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 339 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:11:09,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-02-05 15:11:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 482. [2025-02-05 15:11:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 360 states have (on average 1.1944444444444444) internal successors, (430), 364 states have internal predecessors, (430), 98 states have call successors, (98), 24 states have call predecessors, (98), 23 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 15:11:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 625 transitions. [2025-02-05 15:11:09,350 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 625 transitions. Word has length 99 [2025-02-05 15:11:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:11:09,351 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 625 transitions. [2025-02-05 15:11:09,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 26 states have internal predecessors, (112), 23 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 22 states have call predecessors, (36), 22 states have call successors, (36) [2025-02-05 15:11:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 625 transitions. [2025-02-05 15:11:09,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-05 15:11:09,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:11:09,354 INFO L218 NwaCegarLoop]: trace histogram [21, 20, 20, 20, 19, 19, 19, 19, 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:11:09,362 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:11:09,558 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:11:09,558 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:11:09,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:11:09,558 INFO L85 PathProgramCache]: Analyzing trace with hash -897357250, now seen corresponding path program 3 times [2025-02-05 15:11:09,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:11:09,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305605358] [2025-02-05 15:11:09,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:11:09,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:11:09,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 183 statements into 21 equivalence classes. [2025-02-05 15:11:09,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 15:11:09,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2025-02-05 15:11:09,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 42 proven. 722 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2025-02-05 15:11:10,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:11:10,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305605358] [2025-02-05 15:11:10,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305605358] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:11:10,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340053596] [2025-02-05 15:11:10,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:11:10,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:11:10,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:11:10,520 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:11:10,523 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:11:10,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 183 statements into 21 equivalence classes. [2025-02-05 15:11:10,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 15:11:10,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2025-02-05 15:11:10,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:10,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-05 15:11:10,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:11:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 42 proven. 1482 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:11:11,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:11:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 42 proven. 722 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2025-02-05 15:11:11,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340053596] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:11:11,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:11:11,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 46 [2025-02-05 15:11:11,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873861689] [2025-02-05 15:11:11,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:11:11,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-05 15:11:11,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:11:11,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-05 15:11:11,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2025-02-05 15:11:11,875 INFO L87 Difference]: Start difference. First operand 482 states and 625 transitions. Second operand has 46 states, 46 states have (on average 4.478260869565218) internal successors, (206), 46 states have internal predecessors, (206), 43 states have call successors, (67), 23 states have call predecessors, (67), 22 states have return successors, (66), 42 states have call predecessors, (66), 42 states have call successors, (66) [2025-02-05 15:11:13,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:11:13,928 INFO L93 Difference]: Finished difference Result 1281 states and 1745 transitions. [2025-02-05 15:11:13,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2025-02-05 15:11:13,929 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.478260869565218) internal successors, (206), 46 states have internal predecessors, (206), 43 states have call successors, (67), 23 states have call predecessors, (67), 22 states have return successors, (66), 42 states have call predecessors, (66), 42 states have call successors, (66) Word has length 183 [2025-02-05 15:11:13,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:11:13,936 INFO L225 Difference]: With dead ends: 1281 [2025-02-05 15:11:13,936 INFO L226 Difference]: Without dead ends: 1223 [2025-02-05 15:11:13,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2691, Invalid=4619, Unknown=0, NotChecked=0, Total=7310 [2025-02-05 15:11:13,939 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1042 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 15:11:13,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 628 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 15:11:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2025-02-05 15:11:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1121. [2025-02-05 15:11:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 840 states have (on average 1.2416666666666667) internal successors, (1043), 843 states have internal predecessors, (1043), 237 states have call successors, (237), 44 states have call predecessors, (237), 43 states have return successors, (236), 233 states have call predecessors, (236), 236 states have call successors, (236) [2025-02-05 15:11:14,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1516 transitions. [2025-02-05 15:11:14,123 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1516 transitions. Word has length 183 [2025-02-05 15:11:14,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:11:14,124 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1516 transitions. [2025-02-05 15:11:14,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.478260869565218) internal successors, (206), 46 states have internal predecessors, (206), 43 states have call successors, (67), 23 states have call predecessors, (67), 22 states have return successors, (66), 42 states have call predecessors, (66), 42 states have call successors, (66) [2025-02-05 15:11:14,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1516 transitions. [2025-02-05 15:11:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 15:11:14,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:11:14,127 INFO L218 NwaCegarLoop]: trace histogram [22, 21, 21, 20, 20, 20, 20, 19, 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:11:14,133 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:11:14,328 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:11:14,328 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:11:14,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:11:14,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1642505653, now seen corresponding path program 3 times [2025-02-05 15:11:14,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:11:14,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839048045] [2025-02-05 15:11:14,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:11:14,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:11:14,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 189 statements into 22 equivalence classes. [2025-02-05 15:11:14,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 15:11:14,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2025-02-05 15:11:14,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 44 proven. 760 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2025-02-05 15:11:15,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:11:15,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839048045] [2025-02-05 15:11:15,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839048045] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:11:15,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372874863] [2025-02-05 15:11:15,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:11:15,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:11:15,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:11:15,379 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:11:15,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 15:11:15,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 189 statements into 22 equivalence classes. [2025-02-05 15:11:15,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 15:11:15,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2025-02-05 15:11:15,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:15,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-05 15:11:15,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:11:15,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 44 proven. 1600 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:11:15,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:11:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 44 proven. 760 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2025-02-05 15:11:16,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372874863] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:11:16,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:11:16,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 25] total 49 [2025-02-05 15:11:16,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636549000] [2025-02-05 15:11:16,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:11:16,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-05 15:11:16,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:11:16,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-05 15:11:16,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1065, Invalid=1287, Unknown=0, NotChecked=0, Total=2352 [2025-02-05 15:11:16,695 INFO L87 Difference]: Start difference. First operand 1121 states and 1516 transitions. Second operand has 49 states, 49 states have (on average 4.387755102040816) internal successors, (215), 49 states have internal predecessors, (215), 45 states have call successors, (70), 24 states have call predecessors, (70), 23 states have return successors, (69), 44 states have call predecessors, (69), 44 states have call successors, (69) [2025-02-05 15:11:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:11:19,072 INFO L93 Difference]: Finished difference Result 1766 states and 2359 transitions. [2025-02-05 15:11:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-02-05 15:11:19,072 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 4.387755102040816) internal successors, (215), 49 states have internal predecessors, (215), 45 states have call successors, (70), 24 states have call predecessors, (70), 23 states have return successors, (69), 44 states have call predecessors, (69), 44 states have call successors, (69) Word has length 189 [2025-02-05 15:11:19,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:11:19,079 INFO L225 Difference]: With dead ends: 1766 [2025-02-05 15:11:19,079 INFO L226 Difference]: Without dead ends: 1122 [2025-02-05 15:11:19,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2064 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3744, Invalid=8028, Unknown=0, NotChecked=0, Total=11772 [2025-02-05 15:11:19,084 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1325 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 15:11:19,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 569 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 15:11:19,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-02-05 15:11:19,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1013. [2025-02-05 15:11:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 759 states have (on average 1.2015810276679841) internal successors, (912), 760 states have internal predecessors, (912), 208 states have call successors, (208), 46 states have call predecessors, (208), 45 states have return successors, (207), 206 states have call predecessors, (207), 207 states have call successors, (207) [2025-02-05 15:11:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1327 transitions. [2025-02-05 15:11:19,240 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1327 transitions. Word has length 189 [2025-02-05 15:11:19,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:11:19,240 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1327 transitions. [2025-02-05 15:11:19,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 4.387755102040816) internal successors, (215), 49 states have internal predecessors, (215), 45 states have call successors, (70), 24 states have call predecessors, (70), 23 states have return successors, (69), 44 states have call predecessors, (69), 44 states have call successors, (69) [2025-02-05 15:11:19,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1327 transitions. [2025-02-05 15:11:19,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 15:11:19,244 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:11:19,244 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 20, 20, 20, 20, 19, 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:11:19,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 15:11:19,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 15:11:19,448 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:11:19,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:11:19,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1181146969, now seen corresponding path program 3 times [2025-02-05 15:11:19,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:11:19,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132215974] [2025-02-05 15:11:19,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:11:19,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:11:19,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 195 statements into 23 equivalence classes. [2025-02-05 15:11:19,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 195 statements. [2025-02-05 15:11:19,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 15:11:19,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 1625 trivial. 0 not checked. [2025-02-05 15:11:19,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:11:19,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132215974] [2025-02-05 15:11:19,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132215974] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:11:19,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787004543] [2025-02-05 15:11:19,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:11:19,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:11:19,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:11:19,575 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:11:19,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 15:11:19,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 195 statements into 23 equivalence classes. [2025-02-05 15:11:19,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 195 statements. [2025-02-05 15:11:19,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 15:11:19,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:19,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 15:11:19,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:11:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 111 proven. 1 refuted. 0 times theorem prover too weak. 1622 trivial. 0 not checked. [2025-02-05 15:11:28,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:11:32,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787004543] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:11:32,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:11:32,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 16 [2025-02-05 15:11:32,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99359734] [2025-02-05 15:11:32,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:11:32,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 15:11:32,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:11:32,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 15:11:32,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=253, Unknown=1, NotChecked=0, Total=306 [2025-02-05 15:11:32,492 INFO L87 Difference]: Start difference. First operand 1013 states and 1327 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 15:11:33,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:11:33,157 INFO L93 Difference]: Finished difference Result 2447 states and 3173 transitions. [2025-02-05 15:11:33,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:11:33,159 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 195 [2025-02-05 15:11:33,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:11:33,167 INFO L225 Difference]: With dead ends: 2447 [2025-02-05 15:11:33,168 INFO L226 Difference]: Without dead ends: 1205 [2025-02-05 15:11:33,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=70, Invalid=309, Unknown=1, NotChecked=0, Total=380 [2025-02-05 15:11:33,174 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 64 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:11:33,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 367 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:11:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2025-02-05 15:11:33,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 879. [2025-02-05 15:11:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 658 states have (on average 1.1732522796352585) internal successors, (772), 661 states have internal predecessors, (772), 174 states have call successors, (174), 47 states have call predecessors, (174), 46 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-02-05 15:11:33,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1119 transitions. [2025-02-05 15:11:33,357 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1119 transitions. Word has length 195 [2025-02-05 15:11:33,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:11:33,358 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1119 transitions. [2025-02-05 15:11:33,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 15:11:33,358 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1119 transitions. [2025-02-05 15:11:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 15:11:33,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:11:33,362 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 19, 19, 19, 19, 18, 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:11:33,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-05 15:11:33,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:11:33,567 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:11:33,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:11:33,568 INFO L85 PathProgramCache]: Analyzing trace with hash -239440702, now seen corresponding path program 1 times [2025-02-05 15:11:33,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:11:33,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109495567] [2025-02-05 15:11:33,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:11:33,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:11:33,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 15:11:33,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 15:11:33,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:11:33,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1662 backedges. 44 proven. 690 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2025-02-05 15:11:34,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:11:34,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109495567] [2025-02-05 15:11:34,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109495567] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:11:34,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753283862] [2025-02-05 15:11:34,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:11:34,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:11:34,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:11:34,543 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:11:34,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 15:11:34,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 15:11:34,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 15:11:34,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:11:34,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:34,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-05 15:11:34,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:11:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1662 backedges. 44 proven. 1614 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:11:34,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:11:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1662 backedges. 44 proven. 690 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2025-02-05 15:11:35,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753283862] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:11:35,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:11:35,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 26] total 50 [2025-02-05 15:11:35,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571918092] [2025-02-05 15:11:35,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:11:35,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-05 15:11:35,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:11:35,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-05 15:11:35,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2025-02-05 15:11:35,699 INFO L87 Difference]: Start difference. First operand 879 states and 1119 transitions. Second operand has 50 states, 50 states have (on average 4.4) internal successors, (220), 50 states have internal predecessors, (220), 47 states have call successors, (73), 25 states have call predecessors, (73), 24 states have return successors, (72), 46 states have call predecessors, (72), 46 states have call successors, (72) [2025-02-05 15:11:37,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:11:37,621 INFO L93 Difference]: Finished difference Result 928 states and 1185 transitions. [2025-02-05 15:11:37,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-02-05 15:11:37,622 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.4) internal successors, (220), 50 states have internal predecessors, (220), 47 states have call successors, (73), 25 states have call predecessors, (73), 24 states have return successors, (72), 46 states have call predecessors, (72), 46 states have call successors, (72) Word has length 195 [2025-02-05 15:11:37,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:11:37,627 INFO L225 Difference]: With dead ends: 928 [2025-02-05 15:11:37,627 INFO L226 Difference]: Without dead ends: 923 [2025-02-05 15:11:37,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3046, Invalid=5326, Unknown=0, NotChecked=0, Total=8372 [2025-02-05 15:11:37,630 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1037 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 560 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:11:37,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 584 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [560 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 15:11:37,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-02-05 15:11:37,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 917. [2025-02-05 15:11:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 686 states have (on average 1.1457725947521866) internal successors, (786), 691 states have internal predecessors, (786), 182 states have call successors, (182), 49 states have call predecessors, (182), 48 states have return successors, (181), 176 states have call predecessors, (181), 181 states have call successors, (181) [2025-02-05 15:11:37,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1149 transitions. [2025-02-05 15:11:37,791 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1149 transitions. Word has length 195 [2025-02-05 15:11:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:11:37,792 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1149 transitions. [2025-02-05 15:11:37,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.4) internal successors, (220), 50 states have internal predecessors, (220), 47 states have call successors, (73), 25 states have call predecessors, (73), 24 states have return successors, (72), 46 states have call predecessors, (72), 46 states have call successors, (72) [2025-02-05 15:11:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1149 transitions. [2025-02-05 15:11:37,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-05 15:11:37,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:11:37,798 INFO L218 NwaCegarLoop]: trace histogram [45, 44, 44, 44, 43, 43, 43, 43, 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:11:37,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-05 15:11:37,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 15:11:37,999 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:11:37,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:11:37,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1195497854, now seen corresponding path program 4 times [2025-02-05 15:11:38,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:11:38,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268991124] [2025-02-05 15:11:38,000 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:11:38,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:11:38,016 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 375 statements into 2 equivalence classes. [2025-02-05 15:11:38,189 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 375 of 375 statements. [2025-02-05 15:11:38,190 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:11:38,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 7576 backedges. 88 proven. 3700 refuted. 0 times theorem prover too weak. 3788 trivial. 0 not checked. [2025-02-05 15:11:41,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:11:41,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268991124] [2025-02-05 15:11:41,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268991124] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:11:41,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480103993] [2025-02-05 15:11:41,060 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:11:41,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:11:41,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:11:41,063 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:11:41,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-05 15:11:41,117 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 375 statements into 2 equivalence classes. [2025-02-05 15:11:41,223 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 375 of 375 statements. [2025-02-05 15:11:41,223 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:11:41,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:41,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-02-05 15:11:41,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:11:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 7576 backedges. 90 proven. 7482 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:11:41,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:11:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7576 backedges. 90 proven. 3698 refuted. 0 times theorem prover too weak. 3788 trivial. 0 not checked. [2025-02-05 15:11:42,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480103993] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:11:42,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:11:42,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 47, 48] total 55 [2025-02-05 15:11:42,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614647978] [2025-02-05 15:11:42,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:11:42,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-05 15:11:42,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:11:42,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-05 15:11:42,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=1637, Unknown=0, NotChecked=0, Total=2970 [2025-02-05 15:11:42,943 INFO L87 Difference]: Start difference. First operand 917 states and 1149 transitions. Second operand has 55 states, 55 states have (on average 5.6909090909090905) internal successors, (313), 55 states have internal predecessors, (313), 51 states have call successors, (101), 47 states have call predecessors, (101), 46 states have return successors, (100), 50 states have call predecessors, (100), 50 states have call successors, (100) [2025-02-05 15:11:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:11:45,942 INFO L93 Difference]: Finished difference Result 1129 states and 1432 transitions. [2025-02-05 15:11:45,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2025-02-05 15:11:45,943 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 5.6909090909090905) internal successors, (313), 55 states have internal predecessors, (313), 51 states have call successors, (101), 47 states have call predecessors, (101), 46 states have return successors, (100), 50 states have call predecessors, (100), 50 states have call successors, (100) Word has length 375 [2025-02-05 15:11:45,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:11:45,949 INFO L225 Difference]: With dead ends: 1129 [2025-02-05 15:11:45,949 INFO L226 Difference]: Without dead ends: 1065 [2025-02-05 15:11:45,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 703 SyntacticMatches, 42 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5315 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5984, Invalid=15478, Unknown=0, NotChecked=0, Total=21462 [2025-02-05 15:11:45,955 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1207 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 795 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 795 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:11:45,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 629 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [795 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 15:11:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-02-05 15:11:46,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1046. [2025-02-05 15:11:46,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 782 states have (on average 1.1534526854219949) internal successors, (902), 790 states have internal predecessors, (902), 208 states have call successors, (208), 56 states have call predecessors, (208), 55 states have return successors, (207), 199 states have call predecessors, (207), 207 states have call successors, (207) [2025-02-05 15:11:46,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1317 transitions. [2025-02-05 15:11:46,155 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1317 transitions. Word has length 375 [2025-02-05 15:11:46,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:11:46,156 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1317 transitions. [2025-02-05 15:11:46,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.6909090909090905) internal successors, (313), 55 states have internal predecessors, (313), 51 states have call successors, (101), 47 states have call predecessors, (101), 46 states have return successors, (100), 50 states have call predecessors, (100), 50 states have call successors, (100) [2025-02-05 15:11:46,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1317 transitions. [2025-02-05 15:11:46,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-02-05 15:11:46,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:11:46,163 INFO L218 NwaCegarLoop]: trace histogram [47, 46, 46, 45, 45, 45, 45, 44, 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:11:46,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-05 15:11:46,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 15:11:46,364 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:11:46,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:11:46,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1489275117, now seen corresponding path program 4 times [2025-02-05 15:11:46,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:11:46,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307777222] [2025-02-05 15:11:46,365 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:11:46,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:11:46,378 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 389 statements into 2 equivalence classes. [2025-02-05 15:11:46,535 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 389 of 389 statements. [2025-02-05 15:11:46,535 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:11:46,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8198 backedges. 92 proven. 3962 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2025-02-05 15:11:49,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:11:49,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307777222] [2025-02-05 15:11:49,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307777222] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:11:49,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413070466] [2025-02-05 15:11:49,502 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 15:11:49,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:11:49,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:11:49,504 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:11:49,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-05 15:11:49,552 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 389 statements into 2 equivalence classes. [2025-02-05 15:11:49,651 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 389 of 389 statements. [2025-02-05 15:11:49,652 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 15:11:49,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:49,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-02-05 15:11:49,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:11:50,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8198 backedges. 94 proven. 8100 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:11:50,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:11:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 8198 backedges. 94 proven. 3960 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2025-02-05 15:11:51,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413070466] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:11:51,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:11:51,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 49, 50] total 55 [2025-02-05 15:11:51,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774072557] [2025-02-05 15:11:51,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:11:51,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-05 15:11:51,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:11:51,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-05 15:11:51,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=1637, Unknown=0, NotChecked=0, Total=2970 [2025-02-05 15:11:51,165 INFO L87 Difference]: Start difference. First operand 1046 states and 1317 transitions. Second operand has 55 states, 55 states have (on average 5.763636363636364) internal successors, (317), 55 states have internal predecessors, (317), 51 states have call successors, (103), 49 states have call predecessors, (103), 48 states have return successors, (102), 50 states have call predecessors, (102), 50 states have call successors, (102) [2025-02-05 15:11:54,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:11:54,211 INFO L93 Difference]: Finished difference Result 1157 states and 1459 transitions. [2025-02-05 15:11:54,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2025-02-05 15:11:54,212 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 5.763636363636364) internal successors, (317), 55 states have internal predecessors, (317), 51 states have call successors, (103), 49 states have call predecessors, (103), 48 states have return successors, (102), 50 states have call predecessors, (102), 50 states have call successors, (102) Word has length 389 [2025-02-05 15:11:54,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:11:54,216 INFO L225 Difference]: With dead ends: 1157 [2025-02-05 15:11:54,217 INFO L226 Difference]: Without dead ends: 1008 [2025-02-05 15:11:54,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 729 SyntacticMatches, 45 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5409 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5936, Invalid=15526, Unknown=0, NotChecked=0, Total=21462 [2025-02-05 15:11:54,219 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1352 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 955 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 955 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 15:11:54,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 560 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [955 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 15:11:54,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2025-02-05 15:11:54,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1002. [2025-02-05 15:11:54,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 751 states have (on average 1.1398135818908122) internal successors, (856), 753 states have internal predecessors, (856), 198 states have call successors, (198), 53 states have call predecessors, (198), 52 states have return successors, (197), 195 states have call predecessors, (197), 197 states have call successors, (197) [2025-02-05 15:11:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1251 transitions. [2025-02-05 15:11:54,394 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1251 transitions. Word has length 389 [2025-02-05 15:11:54,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:11:54,397 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1251 transitions. [2025-02-05 15:11:54,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.763636363636364) internal successors, (317), 55 states have internal predecessors, (317), 51 states have call successors, (103), 49 states have call predecessors, (103), 48 states have return successors, (102), 50 states have call predecessors, (102), 50 states have call successors, (102) [2025-02-05 15:11:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1251 transitions. [2025-02-05 15:11:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-02-05 15:11:54,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:11:54,402 INFO L218 NwaCegarLoop]: trace histogram [49, 48, 48, 45, 45, 45, 45, 44, 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:11:54,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-05 15:11:54,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:11:54,603 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:11:54,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:11:54,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2069587982, now seen corresponding path program 2 times [2025-02-05 15:11:54,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:11:54,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885433256] [2025-02-05 15:11:54,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:11:54,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:11:54,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 403 statements into 2 equivalence classes. [2025-02-05 15:11:54,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 403 of 403 statements. [2025-02-05 15:11:54,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:11:54,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 8578 backedges. 96 proven. 3966 refuted. 0 times theorem prover too weak. 4516 trivial. 0 not checked. [2025-02-05 15:11:57,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:11:57,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885433256] [2025-02-05 15:11:57,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885433256] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:11:57,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940026176] [2025-02-05 15:11:57,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:11:57,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:11:57,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:11:57,336 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:11:57,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-05 15:11:57,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 403 statements into 2 equivalence classes. [2025-02-05 15:11:57,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 403 of 403 statements. [2025-02-05 15:11:57,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:11:57,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:11:57,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-02-05 15:11:57,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:11:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 8578 backedges. 96 proven. 8478 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:11:57,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:11:59,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8578 backedges. 96 proven. 3966 refuted. 0 times theorem prover too weak. 4516 trivial. 0 not checked. [2025-02-05 15:11:59,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940026176] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:11:59,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:11:59,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 52] total 54 [2025-02-05 15:11:59,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617690796] [2025-02-05 15:11:59,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:11:59,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-02-05 15:11:59,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:11:59,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-02-05 15:11:59,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2025-02-05 15:11:59,011 INFO L87 Difference]: Start difference. First operand 1002 states and 1251 transitions. Second operand has 54 states, 54 states have (on average 5.944444444444445) internal successors, (321), 54 states have internal predecessors, (321), 51 states have call successors, (106), 51 states have call predecessors, (106), 50 states have return successors, (105), 50 states have call predecessors, (105), 50 states have call successors, (105) [2025-02-05 15:12:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:12:01,060 INFO L93 Difference]: Finished difference Result 1009 states and 1258 transitions. [2025-02-05 15:12:01,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-02-05 15:12:01,060 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.944444444444445) internal successors, (321), 54 states have internal predecessors, (321), 51 states have call successors, (106), 51 states have call predecessors, (106), 50 states have return successors, (105), 50 states have call predecessors, (105), 50 states have call successors, (105) Word has length 403 [2025-02-05 15:12:01,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:12:01,065 INFO L225 Difference]: With dead ends: 1009 [2025-02-05 15:12:01,066 INFO L226 Difference]: Without dead ends: 1004 [2025-02-05 15:12:01,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 756 SyntacticMatches, 48 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2308 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3634, Invalid=6266, Unknown=0, NotChecked=0, Total=9900 [2025-02-05 15:12:01,068 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 991 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 619 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 619 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:12:01,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 600 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [619 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 15:12:01,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2025-02-05 15:12:01,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 1004. [2025-02-05 15:12:01,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 753 states have (on average 1.1381142098273573) internal successors, (857), 755 states have internal predecessors, (857), 198 states have call successors, (198), 53 states have call predecessors, (198), 52 states have return successors, (197), 195 states have call predecessors, (197), 197 states have call successors, (197) [2025-02-05 15:12:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1252 transitions. [2025-02-05 15:12:01,270 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1252 transitions. Word has length 403 [2025-02-05 15:12:01,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:12:01,271 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1252 transitions. [2025-02-05 15:12:01,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.944444444444445) internal successors, (321), 54 states have internal predecessors, (321), 51 states have call successors, (106), 51 states have call predecessors, (106), 50 states have return successors, (105), 50 states have call predecessors, (105), 50 states have call successors, (105) [2025-02-05 15:12:01,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1252 transitions. [2025-02-05 15:12:01,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2025-02-05 15:12:01,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:12:01,275 INFO L218 NwaCegarLoop]: trace histogram [51, 50, 50, 47, 47, 47, 47, 46, 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:12:01,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-05 15:12:01,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:12:01,477 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:12:01,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:12:01,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1612229662, now seen corresponding path program 3 times [2025-02-05 15:12:01,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:12:01,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969798434] [2025-02-05 15:12:01,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:12:01,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:12:01,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 419 statements into 51 equivalence classes. [2025-02-05 15:12:01,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) and asserted 419 of 419 statements. [2025-02-05 15:12:01,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2025-02-05 15:12:01,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:12:01,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [679391410] [2025-02-05 15:12:01,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:12:01,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:12:01,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:12:01,701 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:12:01,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-05 15:12:01,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 419 statements into 51 equivalence classes. [2025-02-05 15:12:02,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) and asserted 419 of 419 statements. [2025-02-05 15:12:02,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2025-02-05 15:12:02,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:12:02,600 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 15:12:02,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-02-05 15:12:02,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-02-05 15:12:02,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:12:02,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:12:02,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 15:12:02,805 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 15:12:02,806 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:12:02,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-05 15:12:03,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:12:03,011 INFO L422 BasicCegarLoop]: Path program histogram: [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:12:03,112 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:12:03,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:12:03 BoogieIcfgContainer [2025-02-05 15:12:03,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:12:03,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:12:03,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:12:03,115 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:12:03,116 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:56" (3/4) ... [2025-02-05 15:12:03,117 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 15:12:03,282 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 311. [2025-02-05 15:12:03,511 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:12:03,512 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:12:03,512 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:12:03,513 INFO L158 Benchmark]: Toolchain (without parser) took 67235.77ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 73.7MB in the end (delta: 33.2MB). Peak memory consumption was 202.9MB. Max. memory is 16.1GB. [2025-02-05 15:12:03,513 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:12:03,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.57ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 95.5MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:12:03,514 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.68ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 94.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:12:03,514 INFO L158 Benchmark]: Boogie Preprocessor took 21.63ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 93.3MB in the end (delta: 818.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:12:03,517 INFO L158 Benchmark]: IcfgBuilder took 299.20ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 80.7MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:12:03,518 INFO L158 Benchmark]: TraceAbstraction took 66277.96ms. Allocated memory was 142.6MB in the beginning and 981.5MB in the end (delta: 838.9MB). Free memory was 80.0MB in the beginning and 742.0MB in the end (delta: -662.0MB). Peak memory consumption was 177.6MB. Max. memory is 16.1GB. [2025-02-05 15:12:03,518 INFO L158 Benchmark]: Witness Printer took 397.25ms. Allocated memory was 981.5MB in the beginning and 142.6MB in the end (delta: -838.9MB). Free memory was 742.0MB in the beginning and 73.7MB in the end (delta: 668.2MB). Peak memory consumption was 66.0kB. Max. memory is 16.1GB. [2025-02-05 15:12:03,518 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.34ms. Allocated memory is still 201.3MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.57ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 95.5MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.68ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 94.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.63ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 93.3MB in the end (delta: 818.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 299.20ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 80.7MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 66277.96ms. Allocated memory was 142.6MB in the beginning and 981.5MB in the end (delta: 838.9MB). Free memory was 80.0MB in the beginning and 742.0MB in the end (delta: -662.0MB). Peak memory consumption was 177.6MB. Max. memory is 16.1GB. * Witness Printer took 397.25ms. Allocated memory was 981.5MB in the beginning and 142.6MB in the end (delta: -838.9MB). Free memory was 742.0MB in the beginning and 73.7MB in the end (delta: 668.2MB). Peak memory consumption was 66.0kB. 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=1028199, R=1015, 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=1028199, R=1015, counter=0] [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A VAL [A=1028199, counter=0, r=2026, u=2031, v=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1028199, counter=1, r=2026, u=2031, v=1] [L34] COND TRUE counter++<50 [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=1028199, counter=1, r=2026, u=2031, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=1028199, counter=1, r=2026, u=2031, v=1] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=2, r=2026, u=2031, v=1] [L39] COND TRUE counter++<50 [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=1028199, counter=2, r=2026, u=2031, v=1] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=2, r=2025, u=2031, v=3] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=3, r=2025, u=2031, v=3] [L39] COND TRUE counter++<50 [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=1028199, counter=3, r=2025, u=2031, v=3] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=3, r=2022, u=2031, v=5] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=4, r=2022, u=2031, v=5] [L39] COND TRUE counter++<50 [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=1028199, counter=4, r=2022, u=2031, v=5] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=4, r=2017, u=2031, v=7] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=5, r=2017, u=2031, v=7] [L39] COND TRUE counter++<50 [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=1028199, counter=5, r=2017, u=2031, v=7] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=5, r=2010, u=2031, v=9] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=6, r=2010, u=2031, v=9] [L39] COND TRUE counter++<50 [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=1028199, counter=6, r=2010, u=2031, v=9] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=6, r=2001, u=2031, v=11] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=7, r=2001, u=2031, v=11] [L39] COND TRUE counter++<50 [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=1028199, counter=7, r=2001, u=2031, v=11] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=7, r=1990, u=2031, v=13] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=8, r=1990, u=2031, v=13] [L39] COND TRUE counter++<50 [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=1028199, counter=8, r=1990, u=2031, v=13] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=8, r=1977, u=2031, v=15] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=9, r=1977, u=2031, v=15] [L39] COND TRUE counter++<50 [L40] 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] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=9, r=1977, u=2031, v=15] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=9, r=1962, u=2031, v=17] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=10, r=1962, u=2031, v=17] [L39] COND TRUE counter++<50 [L40] 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] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=10, r=1962, u=2031, v=17] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=10, r=1945, u=2031, v=19] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=11, r=1945, u=2031, v=19] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=11, r=1945, u=2031, v=19] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=11, r=1926, u=2031, v=21] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=12, r=1926, u=2031, v=21] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=12, r=1926, u=2031, v=21] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=12, r=1905, u=2031, v=23] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=13, r=1905, u=2031, v=23] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=13, r=1905, u=2031, v=23] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=13, r=1882, u=2031, v=25] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=14, r=1882, u=2031, v=25] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=14, r=1882, u=2031, v=25] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=14, r=1857, u=2031, v=27] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=15, r=1857, u=2031, v=27] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=15, r=1857, u=2031, v=27] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=15, r=1830, u=2031, v=29] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=16, r=1830, u=2031, v=29] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=16, r=1830, u=2031, v=29] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=16, r=1801, u=2031, v=31] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=17, r=1801, u=2031, v=31] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=17, r=1801, u=2031, v=31] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=17, r=1770, u=2031, v=33] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=18, r=1770, u=2031, v=33] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=18, r=1770, u=2031, v=33] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=18, r=1737, u=2031, v=35] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=19, r=1737, u=2031, v=35] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=19, r=1737, u=2031, v=35] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=19, r=1702, u=2031, v=37] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=20, r=1702, u=2031, v=37] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=20, r=1702, u=2031, v=37] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=20, r=1665, u=2031, v=39] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=21, r=1665, u=2031, v=39] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=21] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=21, r=1665, u=2031, v=39] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=21, r=1626, u=2031, v=41] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=22, r=1626, u=2031, v=41] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=22] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=22, r=1626, u=2031, v=41] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=22, r=1585, u=2031, v=43] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=23, r=1585, u=2031, v=43] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=23] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=23, r=1585, u=2031, v=43] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=23, r=1542, u=2031, v=45] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=24, r=1542, u=2031, v=45] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=24] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=24, r=1542, u=2031, v=45] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=24, r=1497, u=2031, v=47] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=25, r=1497, u=2031, v=47] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=25] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=25, r=1497, u=2031, v=47] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=25, r=1450, u=2031, v=49] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=26, r=1450, u=2031, v=49] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=26] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=26, r=1450, u=2031, v=49] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=26, r=1401, u=2031, v=51] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=27, r=1401, u=2031, v=51] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=27] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=27, r=1401, u=2031, v=51] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=27, r=1350, u=2031, v=53] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=28, r=1350, u=2031, v=53] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=28] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=28, r=1350, u=2031, v=53] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=28, r=1297, u=2031, v=55] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=29, r=1297, u=2031, v=55] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=29] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=29, r=1297, u=2031, v=55] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=29, r=1242, u=2031, v=57] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=30, r=1242, u=2031, v=57] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=30] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=30, r=1242, u=2031, v=57] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=30, r=1185, u=2031, v=59] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=31, r=1185, u=2031, v=59] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=31] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=31, r=1185, u=2031, v=59] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=31, r=1126, u=2031, v=61] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=32, r=1126, u=2031, v=61] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=32] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=32, r=1126, u=2031, v=61] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=32, r=1065, u=2031, v=63] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=33, r=1065, u=2031, v=63] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=33] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=33, r=1065, u=2031, v=63] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=33, r=1002, u=2031, v=65] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=34, r=1002, u=2031, v=65] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=34] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=34, r=1002, u=2031, v=65] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=34, r=937, u=2031, v=67] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=35, r=937, u=2031, v=67] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=35] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=35, r=937, u=2031, v=67] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=35, r=870, u=2031, v=69] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=36, r=870, u=2031, v=69] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=36] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=36, r=870, u=2031, v=69] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=36, r=801, u=2031, v=71] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=37, r=801, u=2031, v=71] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=37] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=37, r=801, u=2031, v=71] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=37, r=730, u=2031, v=73] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=38, r=730, u=2031, v=73] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=38] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=38, r=730, u=2031, v=73] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=38, r=657, u=2031, v=75] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=39, r=657, u=2031, v=75] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=39] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=39, r=657, u=2031, v=75] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=39, r=582, u=2031, v=77] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=40, r=582, u=2031, v=77] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=40] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=40, r=582, u=2031, v=77] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=40, r=505, u=2031, v=79] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=41, r=505, u=2031, v=79] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=41] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=41, r=505, u=2031, v=79] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=41, r=426, u=2031, v=81] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=42, r=426, u=2031, v=81] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=42] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=42, r=426, u=2031, v=81] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=42, r=345, u=2031, v=83] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=43, r=345, u=2031, v=83] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=43] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=43, r=345, u=2031, v=83] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=43, r=262, u=2031, v=85] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=44, r=262, u=2031, v=85] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=44] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=44, r=262, u=2031, v=85] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=44, r=177, u=2031, v=87] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=45, r=177, u=2031, v=87] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=45] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=45, r=177, u=2031, v=87] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=45, r=90, u=2031, v=89] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=46, r=90, u=2031, v=89] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=46] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=46, r=90, u=2031, v=89] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=46, r=1, u=2031, v=91] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=47, r=1, u=2031, v=91] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=47] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=47, r=1, u=2031, v=91] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=47, r=-90, u=2031, v=93] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=48, r=-90, u=2031, v=93] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=48] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=48, r=-90, u=2031, v=93] [L41] COND TRUE !(r > 0) VAL [A=1028199, counter=48, r=-90, u=2031, v=93] [L47] COND TRUE counter++<50 [L47] EXPR counter++ VAL [A=1028199, counter=49, r=-90, u=2031, v=93] [L47] COND TRUE counter++<50 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=49] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=49, r=-90, u=2031, v=93] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [A=1028199, counter=49, r=1941, u=2033, v=93] [L47] COND TRUE counter++<50 [L47] EXPR counter++ VAL [A=1028199, counter=50, r=1941, u=2033, v=93] [L47] COND TRUE counter++<50 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=50] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=50, r=1941, u=2033, v=93] [L49] COND TRUE !(r < 0) VAL [A=1028199, counter=50, r=1941, u=2033, v=93] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1028199, counter=51, r=1941, u=2033, v=93] [L34] COND FALSE !(counter++<50) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=51] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=51] [L14] reach_error() VAL [\old(cond)=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.1s, OverallIterations: 21, TraceHistogramMax: 51, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8635 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8623 mSDsluCounter, 6043 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5380 mSDsCounter, 4701 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4266 IncrementalHoareTripleChecker+Invalid, 8967 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4701 mSolverCounterUnsat, 663 mSDtfsCounter, 4266 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5328 GetRequests, 4316 SyntacticMatches, 137 SemanticMatches, 875 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18029 ImplicationChecksByTransitivity, 22.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1121occurred in iteration=14, InterpolantAutomatonStates: 887, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 735 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 35.8s InterpolantComputationTime, 5778 NumberOfCodeBlocks, 5458 NumberOfCodeBlocksAsserted, 236 NumberOfCheckSat, 7046 ConstructedInterpolants, 0 QuantifiedInterpolants, 16644 SizeOfPredicates, 241 NumberOfNonLiveVariables, 5544 ConjunctsInSsa, 548 ConjunctsInUnsatCore, 48 InterpolantComputations, 6 PerfectInterpolantSequences, 36023/93866 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:12:03,553 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