./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound5.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/cohencu-ll_unwindbound5.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 173419c809fa8cb7fa094fdfc7b5765802a9a2fdebfe9d0a53cd745fd0c573d2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:01:59,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:01:59,339 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:01:59,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:01:59,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:01:59,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:01:59,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:01:59,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:01:59,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:01:59,363 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:01:59,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:01:59,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:01:59,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:01:59,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:01:59,363 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:01:59,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:01:59,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:01:59,364 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:01:59,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:01:59,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:01:59,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:01:59,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:01:59,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:01:59,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:01:59,365 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:01:59,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:01:59,365 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:01:59,365 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:01:59,365 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:01:59,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:01:59,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:01:59,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:01:59,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:01:59,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:01:59,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:01:59,366 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:01:59,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:01:59,366 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:01:59,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:01:59,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:01:59,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:01:59,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:01:59,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:01:59,367 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 -> 173419c809fa8cb7fa094fdfc7b5765802a9a2fdebfe9d0a53cd745fd0c573d2 [2025-02-05 15:01:59,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:01:59,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:01:59,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:01:59,657 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:01:59,657 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:01:59,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound5.c [2025-02-05 15:02:00,931 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c71bfe9e6/5c17f33ffe4c407da1bffc58a461dde9/FLAGd81bea8db [2025-02-05 15:02:01,210 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:02:01,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound5.c [2025-02-05 15:02:01,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c71bfe9e6/5c17f33ffe4c407da1bffc58a461dde9/FLAGd81bea8db [2025-02-05 15:02:01,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c71bfe9e6/5c17f33ffe4c407da1bffc58a461dde9 [2025-02-05 15:02:01,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:02:01,496 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:02:01,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:02:01,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:02:01,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:02:01,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:02:01" (1/1) ... [2025-02-05 15:02:01,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cfdea61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:02:01, skipping insertion in model container [2025-02-05 15:02:01,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:02:01" (1/1) ... [2025-02-05 15:02:01,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:02:01,652 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/cohencu-ll_unwindbound5.c[588,601] [2025-02-05 15:02:01,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:02:01,692 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:02:01,700 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/cohencu-ll_unwindbound5.c[588,601] [2025-02-05 15:02:01,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:02:01,723 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:02:01,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:02:01 WrapperNode [2025-02-05 15:02:01,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:02:01,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:02:01,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:02:01,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:02:01,730 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:02:01" (1/1) ... [2025-02-05 15:02:01,736 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:02:01" (1/1) ... [2025-02-05 15:02:01,751 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2025-02-05 15:02:01,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:02:01,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:02:01,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:02:01,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:02:01,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:02:01" (1/1) ... [2025-02-05 15:02:01,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:02:01" (1/1) ... [2025-02-05 15:02:01,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:02:01" (1/1) ... [2025-02-05 15:02:01,775 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:02:01,779 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:02:01" (1/1) ... [2025-02-05 15:02:01,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:02:01" (1/1) ... [2025-02-05 15:02:01,782 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:02:01" (1/1) ... [2025-02-05 15:02:01,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:02:01" (1/1) ... [2025-02-05 15:02:01,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:02:01" (1/1) ... [2025-02-05 15:02:01,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:02:01" (1/1) ... [2025-02-05 15:02:01,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:02:01,791 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:02:01,791 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:02:01,791 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:02:01,792 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:02:01" (1/1) ... [2025-02-05 15:02:01,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:02:01,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:02:01,821 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:02:01,825 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:02:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:02:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:02:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:02:01,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:02:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 15:02:01,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 15:02:01,897 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:02:01,898 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:02:02,048 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-02-05 15:02:02,049 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:02:02,056 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:02:02,057 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:02:02,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:02:02 BoogieIcfgContainer [2025-02-05 15:02:02,057 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:02:02,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:02:02,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:02:02,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:02:02,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:02:01" (1/3) ... [2025-02-05 15:02:02,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c52eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:02:02, skipping insertion in model container [2025-02-05 15:02:02,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:02:01" (2/3) ... [2025-02-05 15:02:02,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c52eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:02:02, skipping insertion in model container [2025-02-05 15:02:02,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:02:02" (3/3) ... [2025-02-05 15:02:02,067 INFO L128 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound5.c [2025-02-05 15:02:02,081 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:02:02,083 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohencu-ll_unwindbound5.c that has 2 procedures, 26 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:02:02,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:02:02,147 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;@404a08d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:02:02,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:02:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-05 15:02:02,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-05 15:02:02,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:02,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:02,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:02,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:02,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1331043944, now seen corresponding path program 1 times [2025-02-05 15:02:02,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:02,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469367159] [2025-02-05 15:02:02,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:02,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:02,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-05 15:02:02,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-05 15:02:02,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:02,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:02:02,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:02:02,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469367159] [2025-02-05 15:02:02,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469367159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:02:02,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:02:02,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:02:02,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730353706] [2025-02-05 15:02:02,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:02:02,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:02:02,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:02:02,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:02:02,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:02:02,290 INFO L87 Difference]: Start difference. First operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:02:02,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:02:02,303 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2025-02-05 15:02:02,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:02:02,304 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-05 15:02:02,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:02:02,309 INFO L225 Difference]: With dead ends: 50 [2025-02-05 15:02:02,309 INFO L226 Difference]: Without dead ends: 22 [2025-02-05 15:02:02,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:02:02,317 INFO L435 NwaCegarLoop]: 37 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, 37 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:02:02,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:02:02,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-05 15:02:02,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-05 15:02:02,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 15:02:02,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2025-02-05 15:02:02,350 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 7 [2025-02-05 15:02:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:02:02,350 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2025-02-05 15:02:02,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:02:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2025-02-05 15:02:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 15:02:02,351 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:02,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:02,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:02:02,352 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:02,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:02,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1736523449, now seen corresponding path program 1 times [2025-02-05 15:02:02,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:02,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810349272] [2025-02-05 15:02:02,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:02,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:02,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 15:02:02,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 15:02:02,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:02,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:02,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:02:02,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:02:02,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810349272] [2025-02-05 15:02:02,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810349272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:02:02,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:02:02,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:02:02,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533058394] [2025-02-05 15:02:02,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:02:02,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:02:02,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:02:02,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:02:02,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:02:02,575 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:02:02,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:02:02,650 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2025-02-05 15:02:02,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:02:02,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 15:02:02,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:02:02,651 INFO L225 Difference]: With dead ends: 28 [2025-02-05 15:02:02,651 INFO L226 Difference]: Without dead ends: 26 [2025-02-05 15:02:02,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:02:02,652 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:02:02,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 85 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:02:02,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-05 15:02:02,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-05 15:02:02,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-05 15:02:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2025-02-05 15:02:02,667 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 8 [2025-02-05 15:02:02,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:02:02,668 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2025-02-05 15:02:02,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:02:02,668 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2025-02-05 15:02:02,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 15:02:02,668 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:02,668 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:02,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:02:02,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:02,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:02,669 INFO L85 PathProgramCache]: Analyzing trace with hash 359075189, now seen corresponding path program 1 times [2025-02-05 15:02:02,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:02,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578528636] [2025-02-05 15:02:02,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:02,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:02,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 15:02:02,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 15:02:02,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:02,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:02:02,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [20055564] [2025-02-05 15:02:02,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:02,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:02,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:02:02,703 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:02:02,705 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:02:02,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 15:02:02,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 15:02:02,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:02,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:02,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 15:02:02,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:02:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:02:02,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:02:02,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:02:02,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578528636] [2025-02-05 15:02:02,863 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:02:02,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20055564] [2025-02-05 15:02:02,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20055564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:02:02,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:02:02,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:02:02,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628010667] [2025-02-05 15:02:02,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:02:02,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:02:02,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:02:02,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:02:02,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:02:02,868 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:02:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:02:02,974 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2025-02-05 15:02:02,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:02:02,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-05 15:02:02,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:02:02,976 INFO L225 Difference]: With dead ends: 46 [2025-02-05 15:02:02,976 INFO L226 Difference]: Without dead ends: 44 [2025-02-05 15:02:02,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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:02:02,977 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:02:02,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 108 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:02:02,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-05 15:02:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2025-02-05 15:02:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-05 15:02:02,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2025-02-05 15:02:02,996 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 13 [2025-02-05 15:02:02,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:02:02,997 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2025-02-05 15:02:02,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:02:02,997 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2025-02-05 15:02:02,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 15:02:02,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:02,997 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:03,007 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:02:03,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:03,198 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:03,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:03,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1047704010, now seen corresponding path program 1 times [2025-02-05 15:02:03,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:03,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676853367] [2025-02-05 15:02:03,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:03,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:03,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 15:02:03,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 15:02:03,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:03,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:03,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:02:03,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:02:03,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676853367] [2025-02-05 15:02:03,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676853367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:02:03,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:02:03,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:02:03,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601592334] [2025-02-05 15:02:03,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:02:03,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:02:03,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:02:03,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:02:03,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:02:03,273 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:02:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:02:03,296 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2025-02-05 15:02:03,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:02:03,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-05 15:02:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:02:03,301 INFO L225 Difference]: With dead ends: 50 [2025-02-05 15:02:03,302 INFO L226 Difference]: Without dead ends: 34 [2025-02-05 15:02:03,302 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:02:03,303 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:02:03,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:02:03,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-05 15:02:03,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-05 15:02:03,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-05 15:02:03,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-02-05 15:02:03,321 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 13 [2025-02-05 15:02:03,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:02:03,322 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-02-05 15:02:03,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:02:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-02-05 15:02:03,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 15:02:03,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:03,323 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:03,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:02:03,323 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:03,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:03,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1747981895, now seen corresponding path program 1 times [2025-02-05 15:02:03,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:03,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93291223] [2025-02-05 15:02:03,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:03,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:03,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 15:02:03,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 15:02:03,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:03,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:02:03,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1656771334] [2025-02-05 15:02:03,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:03,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:03,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:02:03,351 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:02:03,354 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:02:03,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 15:02:03,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 15:02:03,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:03,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:03,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 15:02:03,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:02:03,458 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:02:03,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:02:03,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:02:03,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93291223] [2025-02-05 15:02:03,458 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:02:03,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656771334] [2025-02-05 15:02:03,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656771334] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:02:03,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:02:03,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:02:03,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134976469] [2025-02-05 15:02:03,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:02:03,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:02:03,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:02:03,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:02:03,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:02:03,459 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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:02:03,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:02:03,523 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2025-02-05 15:02:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:02:03,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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 18 [2025-02-05 15:02:03,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:02:03,525 INFO L225 Difference]: With dead ends: 50 [2025-02-05 15:02:03,525 INFO L226 Difference]: Without dead ends: 48 [2025-02-05 15:02:03,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:02:03,526 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:02:03,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 123 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:02:03,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-05 15:02:03,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-02-05 15:02:03,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-05 15:02:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2025-02-05 15:02:03,544 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 18 [2025-02-05 15:02:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:02:03,545 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2025-02-05 15:02:03,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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:02:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2025-02-05 15:02:03,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 15:02:03,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:03,546 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:03,553 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:02:03,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:03,747 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:03,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:03,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2013833461, now seen corresponding path program 1 times [2025-02-05 15:02:03,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:03,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239770442] [2025-02-05 15:02:03,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:03,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:03,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 15:02:03,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 15:02:03,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:03,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:02:03,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1949021233] [2025-02-05 15:02:03,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:03,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:03,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:02:03,764 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:02:03,767 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:02:03,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 15:02:03,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 15:02:03,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:03,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:03,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:02:03,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:02:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:02:03,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:02:03,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:02:03,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239770442] [2025-02-05 15:02:03,890 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:02:03,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949021233] [2025-02-05 15:02:03,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949021233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:02:03,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:02:03,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:02:03,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458181025] [2025-02-05 15:02:03,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:02:03,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:02:03,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:02:03,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:02:03,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:02:03,892 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 15:02:03,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:02:03,977 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2025-02-05 15:02:03,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:02:03,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2025-02-05 15:02:03,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:02:03,978 INFO L225 Difference]: With dead ends: 58 [2025-02-05 15:02:03,979 INFO L226 Difference]: Without dead ends: 46 [2025-02-05 15:02:03,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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:02:03,980 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:02:03,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 127 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:02:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-05 15:02:03,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-05 15:02:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 15:02:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2025-02-05 15:02:03,993 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 23 [2025-02-05 15:02:03,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:02:03,994 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-02-05 15:02:03,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 15:02:03,994 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2025-02-05 15:02:03,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 15:02:03,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:03,996 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:04,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:02:04,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:04,197 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:04,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:04,197 INFO L85 PathProgramCache]: Analyzing trace with hash 2015639435, now seen corresponding path program 1 times [2025-02-05 15:02:04,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:04,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738713324] [2025-02-05 15:02:04,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:04,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:04,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 15:02:04,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 15:02:04,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:04,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:02:04,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1482972701] [2025-02-05 15:02:04,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:04,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:04,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:02:04,235 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:02:04,238 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:02:04,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 15:02:04,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 15:02:04,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:04,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:04,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 15:02:04,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:02:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 15:02:04,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:02:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 15:02:04,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:02:04,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738713324] [2025-02-05 15:02:04,617 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:02:04,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482972701] [2025-02-05 15:02:04,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482972701] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:02:04,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:02:04,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-02-05 15:02:04,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362263620] [2025-02-05 15:02:04,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:02:04,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 15:02:04,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:02:04,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 15:02:04,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:02:04,620 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-02-05 15:02:04,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:02:04,922 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2025-02-05 15:02:04,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:02:04,922 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 41 [2025-02-05 15:02:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:02:04,924 INFO L225 Difference]: With dead ends: 70 [2025-02-05 15:02:04,924 INFO L226 Difference]: Without dead ends: 68 [2025-02-05 15:02:04,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:02:04,925 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:02:04,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 164 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:02:04,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-05 15:02:04,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2025-02-05 15:02:04,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 15:02:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-02-05 15:02:04,941 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 41 [2025-02-05 15:02:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:02:04,942 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-02-05 15:02:04,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-02-05 15:02:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-02-05 15:02:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 15:02:04,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:04,943 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:04,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:02:05,144 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:02:05,144 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:05,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:05,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1590699040, now seen corresponding path program 1 times [2025-02-05 15:02:05,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:05,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377462494] [2025-02-05 15:02:05,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:05,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:05,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 15:02:05,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 15:02:05,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:05,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-05 15:02:05,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:02:05,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377462494] [2025-02-05 15:02:05,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377462494] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:02:05,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774344618] [2025-02-05 15:02:05,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:05,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:05,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:02:05,288 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:02:05,290 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:02:05,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 15:02:05,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 15:02:05,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:05,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:05,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 15:02:05,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:02:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 15:02:05,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:02:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-05 15:02:05,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774344618] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:02:05,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:02:05,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-02-05 15:02:05,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045871268] [2025-02-05 15:02:05,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:02:05,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:02:05,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:02:05,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:02:05,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:02:05,475 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:02:05,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:02:05,643 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2025-02-05 15:02:05,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:02:05,643 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 41 [2025-02-05 15:02:05,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:02:05,644 INFO L225 Difference]: With dead ends: 136 [2025-02-05 15:02:05,644 INFO L226 Difference]: Without dead ends: 116 [2025-02-05 15:02:05,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:02:05,645 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 51 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:02:05,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 116 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:02:05,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-05 15:02:05,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2025-02-05 15:02:05,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 59 states have (on average 1.11864406779661) internal successors, (66), 62 states have internal predecessors, (66), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-05 15:02:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2025-02-05 15:02:05,682 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 41 [2025-02-05 15:02:05,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:02:05,683 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2025-02-05 15:02:05,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:02:05,683 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2025-02-05 15:02:05,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 15:02:05,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:05,685 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:05,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:02:05,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:05,887 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:05,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:05,888 INFO L85 PathProgramCache]: Analyzing trace with hash 78105073, now seen corresponding path program 2 times [2025-02-05 15:02:05,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:05,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623210225] [2025-02-05 15:02:05,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:02:05,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:05,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-05 15:02:05,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 15:02:05,912 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:02:05,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:02:05,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1429133938] [2025-02-05 15:02:05,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:02:05,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:05,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:02:05,916 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:02:05,918 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:02:05,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-05 15:02:05,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 15:02:05,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:02:05,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:05,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 15:02:05,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:02:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-05 15:02:06,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:02:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-05 15:02:06,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:02:06,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623210225] [2025-02-05 15:02:06,330 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:02:06,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429133938] [2025-02-05 15:02:06,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429133938] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:02:06,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:02:06,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2025-02-05 15:02:06,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928192712] [2025-02-05 15:02:06,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:02:06,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:02:06,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:02:06,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:02:06,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:02:06,333 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-05 15:02:06,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:02:06,662 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2025-02-05 15:02:06,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:02:06,663 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 46 [2025-02-05 15:02:06,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:02:06,664 INFO L225 Difference]: With dead ends: 127 [2025-02-05 15:02:06,664 INFO L226 Difference]: Without dead ends: 122 [2025-02-05 15:02:06,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-02-05 15:02:06,665 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:02:06,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 190 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:02:06,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-05 15:02:06,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-02-05 15:02:06,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 71 states have internal predecessors, (75), 35 states have call successors, (35), 17 states have call predecessors, (35), 17 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 15:02:06,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2025-02-05 15:02:06,706 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 46 [2025-02-05 15:02:06,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:02:06,707 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2025-02-05 15:02:06,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-05 15:02:06,707 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2025-02-05 15:02:06,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 15:02:06,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:06,708 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:06,716 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:02:06,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-05 15:02:06,909 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:06,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:06,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1836391767, now seen corresponding path program 1 times [2025-02-05 15:02:06,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:06,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958371816] [2025-02-05 15:02:06,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:06,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:06,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 15:02:06,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 15:02:06,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:06,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:02:06,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2001386983] [2025-02-05 15:02:06,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:06,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:06,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:02:06,938 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:02:06,941 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:02:06,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 15:02:06,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 15:02:06,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:06,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:06,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 15:02:06,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:02:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-05 15:02:07,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:02:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-05 15:02:07,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:02:07,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958371816] [2025-02-05 15:02:07,361 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:02:07,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001386983] [2025-02-05 15:02:07,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001386983] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:02:07,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:02:07,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-02-05 15:02:07,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147295873] [2025-02-05 15:02:07,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:02:07,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:02:07,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:02:07,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:02:07,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:02:07,363 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-02-05 15:02:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:02:07,678 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2025-02-05 15:02:07,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:02:07,679 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 67 [2025-02-05 15:02:07,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:02:07,680 INFO L225 Difference]: With dead ends: 135 [2025-02-05 15:02:07,680 INFO L226 Difference]: Without dead ends: 131 [2025-02-05 15:02:07,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:02:07,681 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:02:07,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 206 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:02:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-05 15:02:07,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-02-05 15:02:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 78 states have internal predecessors, (82), 35 states have call successors, (35), 20 states have call predecessors, (35), 19 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 15:02:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2025-02-05 15:02:07,719 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 67 [2025-02-05 15:02:07,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:02:07,720 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2025-02-05 15:02:07,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-02-05 15:02:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2025-02-05 15:02:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 15:02:07,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:07,721 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:07,730 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:02:07,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:07,927 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:07,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:07,927 INFO L85 PathProgramCache]: Analyzing trace with hash 44641509, now seen corresponding path program 1 times [2025-02-05 15:02:07,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:07,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243825509] [2025-02-05 15:02:07,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:07,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:07,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 15:02:07,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 15:02:07,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:07,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:02:07,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2015070245] [2025-02-05 15:02:07,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:07,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:07,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:02:07,948 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:02:07,951 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:02:07,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 15:02:08,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 15:02:08,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:08,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:08,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 15:02:08,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:02:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-02-05 15:02:08,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:02:08,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:02:08,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243825509] [2025-02-05 15:02:08,251 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:02:08,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015070245] [2025-02-05 15:02:08,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015070245] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:02:08,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:02:08,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-02-05 15:02:08,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585693885] [2025-02-05 15:02:08,252 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 15:02:08,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:02:08,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:02:08,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:02:08,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:02:08,254 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:02:08,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:02:08,460 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2025-02-05 15:02:08,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:02:08,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 72 [2025-02-05 15:02:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:02:08,462 INFO L225 Difference]: With dead ends: 137 [2025-02-05 15:02:08,462 INFO L226 Difference]: Without dead ends: 126 [2025-02-05 15:02:08,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:02:08,463 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:02:08,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 152 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:02:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-05 15:02:08,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-02-05 15:02:08,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 74 states have (on average 1.0675675675675675) internal successors, (79), 76 states have internal predecessors, (79), 32 states have call successors, (32), 19 states have call predecessors, (32), 19 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 15:02:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2025-02-05 15:02:08,497 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 72 [2025-02-05 15:02:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:02:08,497 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2025-02-05 15:02:08,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:02:08,498 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2025-02-05 15:02:08,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 15:02:08,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:08,498 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-02-05 15:02:08,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 15:02:08,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:08,699 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:08,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:08,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2133039393, now seen corresponding path program 3 times [2025-02-05 15:02:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:08,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304936755] [2025-02-05 15:02:08,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:02:08,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:08,706 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 7 equivalence classes. [2025-02-05 15:02:08,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 15:02:08,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-05 15:02:08,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:02:08,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068667967] [2025-02-05 15:02:08,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:02:08,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:08,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:02:08,739 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:02:08,741 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:02:08,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 7 equivalence classes. [2025-02-05 15:02:08,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 79 statements. [2025-02-05 15:02:08,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 15:02:08,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:08,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-05 15:02:08,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:02:09,052 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 55 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-05 15:02:09,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:02:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 55 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-05 15:02:09,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:02:09,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304936755] [2025-02-05 15:02:09,399 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:02:09,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068667967] [2025-02-05 15:02:09,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068667967] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:02:09,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:02:09,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2025-02-05 15:02:09,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306963092] [2025-02-05 15:02:09,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:02:09,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 15:02:09,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:02:09,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 15:02:09,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:02:09,400 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2025-02-05 15:02:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:02:10,165 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2025-02-05 15:02:10,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 15:02:10,165 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) Word has length 79 [2025-02-05 15:02:10,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:02:10,167 INFO L225 Difference]: With dead ends: 138 [2025-02-05 15:02:10,167 INFO L226 Difference]: Without dead ends: 129 [2025-02-05 15:02:10,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-02-05 15:02:10,168 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:02:10,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 207 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:02:10,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-05 15:02:10,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2025-02-05 15:02:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 80 states have internal predecessors, (83), 27 states have call successors, (27), 21 states have call predecessors, (27), 20 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 15:02:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2025-02-05 15:02:10,207 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 79 [2025-02-05 15:02:10,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:02:10,208 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2025-02-05 15:02:10,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2025-02-05 15:02:10,208 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2025-02-05 15:02:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 15:02:10,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:10,209 INFO L218 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:10,217 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:02:10,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:10,410 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:10,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:10,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1451410161, now seen corresponding path program 2 times [2025-02-05 15:02:10,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:10,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849420102] [2025-02-05 15:02:10,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:02:10,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:10,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-02-05 15:02:10,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 15:02:10,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:02:10,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:02:10,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1799660735] [2025-02-05 15:02:10,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:02:10,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:10,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:02:10,439 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:02:10,442 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:02:10,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-02-05 15:02:10,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 15:02:10,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:02:10,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:10,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-05 15:02:10,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:02:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 63 proven. 43 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-05 15:02:10,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:02:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 63 proven. 35 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-02-05 15:02:11,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:02:11,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849420102] [2025-02-05 15:02:11,155 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:02:11,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799660735] [2025-02-05 15:02:11,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799660735] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:02:11,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:02:11,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2025-02-05 15:02:11,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247428028] [2025-02-05 15:02:11,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:02:11,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 15:02:11,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:02:11,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 15:02:11,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:02:11,156 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand has 17 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 7 states have call predecessors, (29), 9 states have call successors, (29) [2025-02-05 15:02:11,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:02:11,533 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2025-02-05 15:02:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 15:02:11,534 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 7 states have call predecessors, (29), 9 states have call successors, (29) Word has length 100 [2025-02-05 15:02:11,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:02:11,535 INFO L225 Difference]: With dead ends: 137 [2025-02-05 15:02:11,535 INFO L226 Difference]: Without dead ends: 126 [2025-02-05 15:02:11,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:02:11,536 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:02:11,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 208 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:02:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-05 15:02:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2025-02-05 15:02:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 79 states have internal predecessors, (80), 27 states have call successors, (27), 20 states have call predecessors, (27), 20 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 15:02:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2025-02-05 15:02:11,579 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 100 [2025-02-05 15:02:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:02:11,579 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2025-02-05 15:02:11,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 7 states have call predecessors, (29), 9 states have call successors, (29) [2025-02-05 15:02:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2025-02-05 15:02:11,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:02:11,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:11,580 INFO L218 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:11,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-05 15:02:11,784 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,SelfDestructingSolverStorable12 [2025-02-05 15:02:11,784 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:11,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:11,785 INFO L85 PathProgramCache]: Analyzing trace with hash -7767165, now seen corresponding path program 2 times [2025-02-05 15:02:11,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:11,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603906873] [2025-02-05 15:02:11,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:02:11,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:11,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-02-05 15:02:11,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:02:11,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:02:11,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:02:11,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1866958821] [2025-02-05 15:02:11,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:02:11,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:11,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:02:11,816 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:02:11,819 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:02:11,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-02-05 15:02:11,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:02:11,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:02:11,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:11,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-05 15:02:11,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:02:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 86 proven. 64 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-05 15:02:12,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:02:12,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:02:12,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603906873] [2025-02-05 15:02:12,125 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:02:12,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866958821] [2025-02-05 15:02:12,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866958821] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:02:12,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:02:12,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-02-05 15:02:12,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700190395] [2025-02-05 15:02:12,125 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 15:02:12,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:02:12,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:02:12,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:02:12,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:02:12,127 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-02-05 15:02:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:02:12,426 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2025-02-05 15:02:12,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 15:02:12,426 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 123 [2025-02-05 15:02:12,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:02:12,428 INFO L225 Difference]: With dead ends: 145 [2025-02-05 15:02:12,428 INFO L226 Difference]: Without dead ends: 143 [2025-02-05 15:02:12,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:02:12,429 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:02:12,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 298 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:02:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-05 15:02:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2025-02-05 15:02:12,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 87 states have internal predecessors, (88), 34 states have call successors, (34), 22 states have call predecessors, (34), 22 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-05 15:02:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2025-02-05 15:02:12,462 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 123 [2025-02-05 15:02:12,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:02:12,462 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2025-02-05 15:02:12,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-02-05 15:02:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2025-02-05 15:02:12,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:02:12,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:12,464 INFO L218 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:12,474 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:02:12,668 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,SelfDestructingSolverStorable13 [2025-02-05 15:02:12,668 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:12,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:12,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1120064478, now seen corresponding path program 2 times [2025-02-05 15:02:12,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:12,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150071462] [2025-02-05 15:02:12,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:02:12,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:12,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-02-05 15:02:12,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:02:12,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:02:12,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:12,964 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 15:02:12,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:02:12,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150071462] [2025-02-05 15:02:12,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150071462] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:02:12,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049739920] [2025-02-05 15:02:12,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:02:12,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:12,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:02:12,967 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:02:12,969 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:02:12,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-02-05 15:02:13,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:02:13,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:02:13,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:13,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:02:13,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:02:13,202 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-05 15:02:13,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:02:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 15:02:13,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049739920] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:02:13,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:02:13,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 10 [2025-02-05 15:02:13,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651589425] [2025-02-05 15:02:13,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:02:13,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:02:13,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:02:13,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:02:13,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:02:13,358 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 5 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2025-02-05 15:02:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:02:13,511 INFO L93 Difference]: Finished difference Result 181 states and 193 transitions. [2025-02-05 15:02:13,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:02:13,512 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 5 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) Word has length 125 [2025-02-05 15:02:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:02:13,513 INFO L225 Difference]: With dead ends: 181 [2025-02-05 15:02:13,513 INFO L226 Difference]: Without dead ends: 165 [2025-02-05 15:02:13,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 243 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:02:13,514 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:02:13,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 112 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:02:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-05 15:02:13,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2025-02-05 15:02:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 100 states have (on average 1.04) internal successors, (104), 102 states have internal predecessors, (104), 36 states have call successors, (36), 27 states have call predecessors, (36), 26 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 15:02:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 174 transitions. [2025-02-05 15:02:13,548 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 174 transitions. Word has length 125 [2025-02-05 15:02:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:02:13,548 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 174 transitions. [2025-02-05 15:02:13,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 5 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2025-02-05 15:02:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 174 transitions. [2025-02-05 15:02:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:02:13,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:13,550 INFO L218 NwaCegarLoop]: trace histogram [24, 23, 23, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:13,557 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:02:13,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:13,751 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:13,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:13,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1293998717, now seen corresponding path program 1 times [2025-02-05 15:02:13,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:13,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810637617] [2025-02-05 15:02:13,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:13,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:13,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:02:13,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:02:13,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:13,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:02:13,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [397873882] [2025-02-05 15:02:13,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:02:13,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:13,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:02:13,805 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:02:13,808 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:02:13,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:02:13,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:02:13,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:13,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:13,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-05 15:02:13,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:02:14,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1106 backedges. 45 proven. 115 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 15:02:14,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:02:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1106 backedges. 45 proven. 112 refuted. 3 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 15:02:25,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:02:25,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810637617] [2025-02-05 15:02:25,175 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:02:25,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397873882] [2025-02-05 15:02:25,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397873882] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:02:25,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:02:25,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2025-02-05 15:02:25,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188492706] [2025-02-05 15:02:25,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:02:25,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 15:02:25,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:02:25,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 15:02:25,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=214, Unknown=1, NotChecked=0, Total=272 [2025-02-05 15:02:25,177 INFO L87 Difference]: Start difference. First operand 163 states and 174 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 15 states have internal predecessors, (40), 9 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 8 states have call predecessors, (46), 9 states have call successors, (46) [2025-02-05 15:02:31,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 15:02:31,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:02:31,099 INFO L93 Difference]: Finished difference Result 177 states and 185 transitions. [2025-02-05 15:02:31,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 15:02:31,099 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 15 states have internal predecessors, (40), 9 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 8 states have call predecessors, (46), 9 states have call successors, (46) Word has length 133 [2025-02-05 15:02:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:02:31,100 INFO L225 Difference]: With dead ends: 177 [2025-02-05 15:02:31,100 INFO L226 Difference]: Without dead ends: 151 [2025-02-05 15:02:31,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=76, Invalid=264, Unknown=2, NotChecked=0, Total=342 [2025-02-05 15:02:31,101 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 13 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 15:02:31,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 280 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 15:02:31,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-05 15:02:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-02-05 15:02:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 97 states have internal predecessors, (98), 30 states have call successors, (30), 25 states have call predecessors, (30), 25 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-05 15:02:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 156 transitions. [2025-02-05 15:02:31,136 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 156 transitions. Word has length 133 [2025-02-05 15:02:31,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:02:31,136 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 156 transitions. [2025-02-05 15:02:31,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 15 states have internal predecessors, (40), 9 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 8 states have call predecessors, (46), 9 states have call successors, (46) [2025-02-05 15:02:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 156 transitions. [2025-02-05 15:02:31,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 15:02:31,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:31,138 INFO L218 NwaCegarLoop]: trace histogram [27, 26, 26, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:31,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-05 15:02:31,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:31,342 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:31,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:31,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2137308953, now seen corresponding path program 3 times [2025-02-05 15:02:31,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:31,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964228395] [2025-02-05 15:02:31,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:02:31,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:31,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 151 statements into 13 equivalence classes. [2025-02-05 15:02:31,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 15:02:31,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-02-05 15:02:31,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:02:31,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [360346567] [2025-02-05 15:02:31,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:02:31,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:31,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:02:31,451 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:02:31,453 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:02:31,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 151 statements into 13 equivalence classes. [2025-02-05 15:02:31,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 40 of 151 statements. [2025-02-05 15:02:31,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 15:02:31,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:02:31,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 15:02:31,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:02:31,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 158 proven. 1 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2025-02-05 15:02:31,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:02:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 158 proven. 1 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2025-02-05 15:02:31,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:02:31,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964228395] [2025-02-05 15:02:31,691 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:02:31,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360346567] [2025-02-05 15:02:31,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360346567] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:02:31,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 15:02:31,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2025-02-05 15:02:31,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485307742] [2025-02-05 15:02:31,691 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 15:02:31,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:02:31,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:02:31,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:02:31,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:02:31,693 INFO L87 Difference]: Start difference. First operand 151 states and 156 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:02:31,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:02:31,863 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2025-02-05 15:02:31,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:02:31,863 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 151 [2025-02-05 15:02:31,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:02:31,866 INFO L225 Difference]: With dead ends: 157 [2025-02-05 15:02:31,866 INFO L226 Difference]: Without dead ends: 149 [2025-02-05 15:02:31,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 289 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:02:31,867 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:02:31,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 178 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:02:31,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-05 15:02:31,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-02-05 15:02:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 96 states have internal predecessors, (97), 28 states have call successors, (28), 25 states have call predecessors, (28), 25 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-05 15:02:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 152 transitions. [2025-02-05 15:02:31,921 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 152 transitions. Word has length 151 [2025-02-05 15:02:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:02:31,923 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 152 transitions. [2025-02-05 15:02:31,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:02:31,923 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 152 transitions. [2025-02-05 15:02:31,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 15:02:31,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:02:31,924 INFO L218 NwaCegarLoop]: trace histogram [27, 26, 26, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:31,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-05 15:02:32,129 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,SelfDestructingSolverStorable16 [2025-02-05 15:02:32,129 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:02:32,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:02:32,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1286217160, now seen corresponding path program 3 times [2025-02-05 15:02:32,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:02:32,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968782992] [2025-02-05 15:02:32,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:02:32,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:02:32,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 153 statements into 18 equivalence classes. [2025-02-05 15:02:32,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 15:02:32,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2025-02-05 15:02:32,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:02:32,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1581942479] [2025-02-05 15:02:32,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:02:32,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:02:32,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:02:32,252 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:02:32,254 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:02:32,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 153 statements into 18 equivalence classes. [2025-02-05 15:02:32,360 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 15:02:32,360 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2025-02-05 15:02:32,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:02:32,360 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 15:02:32,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 15:02:32,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 15:02:32,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:02:32,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 15:02:32,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 15:02:32,423 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 15:02:32,424 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:02:32,435 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:02:32,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 15:02:32,628 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:02:32,668 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:02:32,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:02:32 BoogieIcfgContainer [2025-02-05 15:02:32,671 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:02:32,672 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:02:32,672 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:02:32,672 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:02:32,673 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:02:02" (3/4) ... [2025-02-05 15:02:32,673 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 15:02:32,734 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 98. [2025-02-05 15:02:32,825 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:02:32,826 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:02:32,826 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:02:32,826 INFO L158 Benchmark]: Toolchain (without parser) took 31330.53ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 106.2MB in the beginning and 226.9MB in the end (delta: -120.6MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2025-02-05 15:02:32,827 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:02:32,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.97ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 94.6MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:02:32,827 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.83ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 92.5MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:02:32,827 INFO L158 Benchmark]: Boogie Preprocessor took 39.14ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 91.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:02:32,828 INFO L158 Benchmark]: IcfgBuilder took 266.15ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 78.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:02:32,828 INFO L158 Benchmark]: TraceAbstraction took 30611.48ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 78.9MB in the beginning and 239.0MB in the end (delta: -160.1MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2025-02-05 15:02:32,828 INFO L158 Benchmark]: Witness Printer took 153.87ms. Allocated memory is still 335.5MB. Free memory was 239.0MB in the beginning and 226.9MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:02:32,829 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.17ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.97ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 94.6MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.83ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 92.5MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.14ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 91.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 266.15ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 78.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 30611.48ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 78.9MB in the beginning and 239.0MB in the end (delta: -160.1MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * Witness Printer took 153.87ms. Allocated memory is still 335.5MB. Free memory was 239.0MB in the beginning and 226.9MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [a=5, counter=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<5 [L33] EXPR counter++ VAL [a=5, counter=1, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=5, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=5, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=5, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=5, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=5, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=5, counter=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<5 [L33] EXPR counter++ VAL [a=5, counter=2, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=5, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=5, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=5, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=5, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=5, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=5, counter=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<5 [L33] EXPR counter++ VAL [a=5, counter=3, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=5, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=5, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=5, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=5, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=5, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=5, counter=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<5 [L33] EXPR counter++ VAL [a=5, counter=4, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=5, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=5, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=5, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=5, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=5, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=5, counter=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<5 [L33] EXPR counter++ VAL [a=5, counter=5, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=5, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=5, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=5, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=5, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=5, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=5, counter=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<5 [L33] EXPR counter++ VAL [a=5, counter=6, n=5, x=125, y=91, z=36] [L33] COND FALSE !(counter++<5) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=5, counter=6, n=5, x=125, y=91, z=36] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, counter=6] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=6] [L17] reach_error() VAL [\old(cond)=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.5s, OverallIterations: 18, TraceHistogramMax: 27, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 221 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 2680 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2147 mSDsCounter, 317 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2444 IncrementalHoareTripleChecker+Invalid, 2761 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 317 mSolverCounterUnsat, 533 mSDtfsCounter, 2444 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1863 GetRequests, 1682 SyntacticMatches, 9 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 15.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=15, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 40 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 2398 NumberOfCodeBlocks, 2247 NumberOfCodeBlocksAsserted, 97 NumberOfCheckSat, 1981 ConstructedInterpolants, 0 QuantifiedInterpolants, 7600 SizeOfPredicates, 30 NumberOfNonLiveVariables, 2218 ConjunctsInSsa, 285 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 10864/12146 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:02:32,857 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