./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/bresenham-ll_unwindbound10.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d8ee33f278cd93a3b1e0d551730c6407889b70e338ebc3c857541220d9b0f75f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:26:43,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:26:43,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:26:43,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:26:43,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:26:43,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:26:43,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:26:43,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:26:43,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:26:43,422 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:26:43,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:26:43,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:26:43,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:26:43,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:26:43,423 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:26:43,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:26:43,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:26:43,425 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:26:43,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:26:43,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:26:43,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:26:43,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:26:43,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:26:43,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:26:43,425 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:26:43,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:26:43,426 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:26:43,426 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:26:43,426 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:26:43,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:26:43,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:26:43,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:26:43,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:26:43,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:26:43,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:26:43,427 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:26:43,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:26:43,428 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:26:43,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:26:43,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:26:43,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:26:43,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:26:43,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:26:43,428 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 -> d8ee33f278cd93a3b1e0d551730c6407889b70e338ebc3c857541220d9b0f75f [2025-02-07 20:26:43,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:26:43,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:26:43,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:26:43,713 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:26:43,713 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:26:43,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound10.c [2025-02-07 20:26:44,971 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1cad3c8cf/f19cc1a703684c2db039c948f5e7efee/FLAG01ec62dac [2025-02-07 20:26:45,213 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:26:45,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound10.c [2025-02-07 20:26:45,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1cad3c8cf/f19cc1a703684c2db039c948f5e7efee/FLAG01ec62dac [2025-02-07 20:26:45,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1cad3c8cf/f19cc1a703684c2db039c948f5e7efee [2025-02-07 20:26:45,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:26:45,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:26:45,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:26:45,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:26:45,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:26:45,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:26:45" (1/1) ... [2025-02-07 20:26:45,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51965bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:45, skipping insertion in model container [2025-02-07 20:26:45,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:26:45" (1/1) ... [2025-02-07 20:26:45,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:26:45,369 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/bresenham-ll_unwindbound10.c[597,610] [2025-02-07 20:26:45,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:26:45,392 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:26:45,401 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/bresenham-ll_unwindbound10.c[597,610] [2025-02-07 20:26:45,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:26:45,427 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:26:45,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:45 WrapperNode [2025-02-07 20:26:45,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:26:45,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:26:45,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:26:45,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:26:45,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:45" (1/1) ... [2025-02-07 20:26:45,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:45" (1/1) ... [2025-02-07 20:26:45,452 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2025-02-07 20:26:45,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:26:45,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:26:45,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:26:45,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:26:45,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:45" (1/1) ... [2025-02-07 20:26:45,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:45" (1/1) ... [2025-02-07 20:26:45,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:45" (1/1) ... [2025-02-07 20:26:45,466 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-07 20:26:45,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:45" (1/1) ... [2025-02-07 20:26:45,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:45" (1/1) ... [2025-02-07 20:26:45,469 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:45" (1/1) ... [2025-02-07 20:26:45,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:45" (1/1) ... [2025-02-07 20:26:45,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:45" (1/1) ... [2025-02-07 20:26:45,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:45" (1/1) ... [2025-02-07 20:26:45,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:26:45,472 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:26:45,472 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:26:45,472 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:26:45,473 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:45" (1/1) ... [2025-02-07 20:26:45,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:26:45,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:45,503 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-07 20:26:45,505 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-07 20:26:45,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:26:45,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:26:45,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:26:45,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:26:45,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 20:26:45,525 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 20:26:45,573 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:26:45,575 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:26:45,750 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-02-07 20:26:45,751 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:26:45,759 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:26:45,760 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:26:45,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:26:45 BoogieIcfgContainer [2025-02-07 20:26:45,761 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:26:45,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:26:45,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:26:45,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:26:45,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:26:45" (1/3) ... [2025-02-07 20:26:45,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2ed88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:26:45, skipping insertion in model container [2025-02-07 20:26:45,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:26:45" (2/3) ... [2025-02-07 20:26:45,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2ed88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:26:45, skipping insertion in model container [2025-02-07 20:26:45,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:26:45" (3/3) ... [2025-02-07 20:26:45,770 INFO L128 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound10.c [2025-02-07 20:26:45,783 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:26:45,785 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bresenham-ll_unwindbound10.c that has 2 procedures, 18 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 20:26:45,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:26:45,845 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;@791f2242, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:26:45,845 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:26:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:26:45,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 20:26:45,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:45,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:45,853 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:45,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:45,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1740476856, now seen corresponding path program 1 times [2025-02-07 20:26:45,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:45,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833181793] [2025-02-07 20:26:45,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:45,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:45,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:26:45,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:26:45,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:45,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:26:45,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186122548] [2025-02-07 20:26:45,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:45,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:45,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:45,977 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-07 20:26:45,979 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-07 20:26:46,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 20:26:46,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 20:26:46,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:46,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:46,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-07 20:26:46,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:26:46,232 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-07 20:26:46,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:26:46,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:46,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833181793] [2025-02-07 20:26:46,234 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:26:46,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186122548] [2025-02-07 20:26:46,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186122548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:26:46,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:26:46,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:26:46,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155744251] [2025-02-07 20:26:46,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:26:46,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:26:46,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:46,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:26:46,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:26:46,255 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 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-07 20:26:46,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:26:46,374 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2025-02-07 20:26:46,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:26:46,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 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-07 20:26:46,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:26:46,381 INFO L225 Difference]: With dead ends: 48 [2025-02-07 20:26:46,381 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 20:26:46,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:26:46,389 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:26:46,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 54 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:26:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 20:26:46,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2025-02-07 20:26:46,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:26:46,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-02-07 20:26:46,421 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 7 [2025-02-07 20:26:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:26:46,421 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-02-07 20:26:46,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 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-07 20:26:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-02-07 20:26:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 20:26:46,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:46,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:46,432 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-07 20:26:46,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-07 20:26:46,628 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:46,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:46,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1829983731, now seen corresponding path program 1 times [2025-02-07 20:26:46,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:46,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692212657] [2025-02-07 20:26:46,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:46,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:46,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 20:26:46,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 20:26:46,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:46,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:46,735 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-07 20:26:46,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:46,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692212657] [2025-02-07 20:26:46,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692212657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:26:46,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:26:46,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:26:46,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158850677] [2025-02-07 20:26:46,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:26:46,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:26:46,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:46,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:26:46,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:26:46,737 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-07 20:26:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:26:46,758 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2025-02-07 20:26:46,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:26:46,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-07 20:26:46,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:26:46,760 INFO L225 Difference]: With dead ends: 30 [2025-02-07 20:26:46,760 INFO L226 Difference]: Without dead ends: 22 [2025-02-07 20:26:46,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-07 20:26:46,762 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 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-07 20:26:46,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:26:46,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-07 20:26:46,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-07 20:26:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:26:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-02-07 20:26:46,772 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 8 [2025-02-07 20:26:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:26:46,772 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-02-07 20:26:46,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-07 20:26:46,772 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-02-07 20:26:46,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 20:26:46,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:46,773 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:46,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:26:46,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:46,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:46,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1884708792, now seen corresponding path program 1 times [2025-02-07 20:26:46,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:46,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33777490] [2025-02-07 20:26:46,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:46,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:46,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:26:46,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:26:46,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:46,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:26:46,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [849683893] [2025-02-07 20:26:46,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:46,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:46,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:46,803 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-07 20:26:46,805 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-07 20:26:46,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:26:46,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:26:46,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:46,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:46,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-07 20:26:46,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:26:46,982 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-07 20:26:46,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:26:46,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:46,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33777490] [2025-02-07 20:26:46,983 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:26:46,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849683893] [2025-02-07 20:26:46,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849683893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:26:46,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:26:46,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:26:46,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653646902] [2025-02-07 20:26:46,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:26:46,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:26:46,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:46,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:26:46,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:26:46,987 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 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-07 20:26:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:26:47,066 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2025-02-07 20:26:47,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 20:26:47,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 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 14 [2025-02-07 20:26:47,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:26:47,067 INFO L225 Difference]: With dead ends: 32 [2025-02-07 20:26:47,067 INFO L226 Difference]: Without dead ends: 24 [2025-02-07 20:26:47,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:26:47,068 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:26:47,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 42 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:26:47,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-07 20:26:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2025-02-07 20:26:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:26:47,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-02-07 20:26:47,072 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2025-02-07 20:26:47,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:26:47,073 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-02-07 20:26:47,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 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-07 20:26:47,073 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-02-07 20:26:47,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-07 20:26:47,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:47,074 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:47,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 20:26:47,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:47,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:47,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:47,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1620531377, now seen corresponding path program 1 times [2025-02-07 20:26:47,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:47,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992048405] [2025-02-07 20:26:47,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:47,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:47,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 20:26:47,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:26:47,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:47,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:26:47,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2044709080] [2025-02-07 20:26:47,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:47,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:47,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:47,316 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-07 20:26:47,318 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-07 20:26:47,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-07 20:26:47,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 20:26:47,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:47,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:47,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-07 20:26:47,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:26:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:26:47,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:26:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:26:47,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:47,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992048405] [2025-02-07 20:26:47,650 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:26:47,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044709080] [2025-02-07 20:26:47,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044709080] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:26:47,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:26:47,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2025-02-07 20:26:47,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687248195] [2025-02-07 20:26:47,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:26:47,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 20:26:47,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:47,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 20:26:47,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:26:47,652 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:26:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:26:47,879 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2025-02-07 20:26:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 20:26:47,880 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2025-02-07 20:26:47,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:26:47,880 INFO L225 Difference]: With dead ends: 40 [2025-02-07 20:26:47,881 INFO L226 Difference]: Without dead ends: 36 [2025-02-07 20:26:47,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-02-07 20:26:47,882 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:26:47,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 85 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:26:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-07 20:26:47,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2025-02-07 20:26:47,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:26:47,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2025-02-07 20:26:47,889 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2025-02-07 20:26:47,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:26:47,889 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2025-02-07 20:26:47,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-07 20:26:47,889 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2025-02-07 20:26:47,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 20:26:47,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:47,890 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:47,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 20:26:48,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:48,094 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:48,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:48,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1352943446, now seen corresponding path program 1 times [2025-02-07 20:26:48,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:48,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514953387] [2025-02-07 20:26:48,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:48,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:48,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:26:48,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:26:48,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:48,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:48,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:26:48,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:48,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514953387] [2025-02-07 20:26:48,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514953387] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:26:48,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754136596] [2025-02-07 20:26:48,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:48,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:48,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:48,266 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-07 20:26:48,275 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-07 20:26:48,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 20:26:48,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 20:26:48,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:48,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:48,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 20:26:48,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:26:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:26:48,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:26:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:26:48,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754136596] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:26:48,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:26:48,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-02-07 20:26:48,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040090783] [2025-02-07 20:26:48,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:26:48,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 20:26:48,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:48,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 20:26:48,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:26:48,381 INFO L87 Difference]: Start difference. First operand 25 states and 27 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 20:26:48,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:26:48,445 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2025-02-07 20:26:48,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 20:26:48,446 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2025-02-07 20:26:48,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:26:48,446 INFO L225 Difference]: With dead ends: 67 [2025-02-07 20:26:48,446 INFO L226 Difference]: Without dead ends: 61 [2025-02-07 20:26:48,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-07 20:26:48,447 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:26:48,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 94 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:26:48,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-07 20:26:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2025-02-07 20:26:48,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:26:48,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-02-07 20:26:48,464 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 18 [2025-02-07 20:26:48,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:26:48,464 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-02-07 20:26:48,465 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 20:26:48,465 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-02-07 20:26:48,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 20:26:48,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:48,466 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:48,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 20:26:48,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:48,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:48,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:48,672 INFO L85 PathProgramCache]: Analyzing trace with hash -281748033, now seen corresponding path program 1 times [2025-02-07 20:26:48,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:48,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070673339] [2025-02-07 20:26:48,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:48,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:48,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 20:26:48,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 20:26:48,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:48,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:26:48,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [369664007] [2025-02-07 20:26:48,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:48,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:48,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:48,704 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-07 20:26:48,706 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-07 20:26:48,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 20:26:48,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 20:26:48,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:48,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:48,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-07 20:26:48,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:26:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 20:26:48,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:26:49,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 20:26:49,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:49,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070673339] [2025-02-07 20:26:49,054 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:26:49,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369664007] [2025-02-07 20:26:49,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369664007] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:26:49,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:26:49,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2025-02-07 20:26:49,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35642647] [2025-02-07 20:26:49,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:26:49,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 20:26:49,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:49,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 20:26:49,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-07 20:26:49,055 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 14 states, 10 states have (on average 2.3) internal successors, (23), 13 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 20:26:49,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:26:49,230 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2025-02-07 20:26:49,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 20:26:49,230 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.3) internal successors, (23), 13 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2025-02-07 20:26:49,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:26:49,231 INFO L225 Difference]: With dead ends: 78 [2025-02-07 20:26:49,231 INFO L226 Difference]: Without dead ends: 72 [2025-02-07 20:26:49,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-02-07 20:26:49,232 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:26:49,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 70 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:26:49,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-07 20:26:49,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-02-07 20:26:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 20:26:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2025-02-07 20:26:49,258 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 24 [2025-02-07 20:26:49,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:26:49,259 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2025-02-07 20:26:49,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.3) internal successors, (23), 13 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 20:26:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2025-02-07 20:26:49,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 20:26:49,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:49,261 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:49,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 20:26:49,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:49,461 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:49,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:49,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1225803776, now seen corresponding path program 1 times [2025-02-07 20:26:49,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:49,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353738709] [2025-02-07 20:26:49,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:49,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:49,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 20:26:49,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 20:26:49,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:49,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:26:49,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [950918995] [2025-02-07 20:26:49,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:49,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:49,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:49,481 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-07 20:26:49,485 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-07 20:26:49,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 20:26:49,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 20:26:49,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:49,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:49,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-07 20:26:49,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:26:49,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:26:49,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:26:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:26:50,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:50,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353738709] [2025-02-07 20:26:50,282 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:26:50,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950918995] [2025-02-07 20:26:50,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950918995] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:26:50,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:26:50,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2025-02-07 20:26:50,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533604271] [2025-02-07 20:26:50,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:26:50,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-07 20:26:50,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:50,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-07 20:26:50,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-02-07 20:26:50,284 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 22 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:26:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:26:51,104 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2025-02-07 20:26:51,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-07 20:26:51,105 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2025-02-07 20:26:51,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:26:51,106 INFO L225 Difference]: With dead ends: 88 [2025-02-07 20:26:51,106 INFO L226 Difference]: Without dead ends: 80 [2025-02-07 20:26:51,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2025-02-07 20:26:51,107 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 20:26:51,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 101 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 20:26:51,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-07 20:26:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2025-02-07 20:26:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.171875) internal successors, (75), 64 states have internal predecessors, (75), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-07 20:26:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2025-02-07 20:26:51,133 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 24 [2025-02-07 20:26:51,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:26:51,133 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2025-02-07 20:26:51,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:26:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2025-02-07 20:26:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-07 20:26:51,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:51,136 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:51,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-07 20:26:51,340 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,SelfDestructingSolverStorable6 [2025-02-07 20:26:51,340 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:51,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:51,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1337727854, now seen corresponding path program 1 times [2025-02-07 20:26:51,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:51,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038706750] [2025-02-07 20:26:51,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:51,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:51,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-07 20:26:51,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 20:26:51,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:51,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:26:51,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:51,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038706750] [2025-02-07 20:26:51,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038706750] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:26:51,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716905447] [2025-02-07 20:26:51,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:26:51,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:51,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:51,642 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-07 20:26:51,645 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-07 20:26:51,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-07 20:26:51,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 20:26:51,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:26:51,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:51,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-07 20:26:51,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:26:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:26:51,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:26:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:26:52,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716905447] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:26:52,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:26:52,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-02-07 20:26:52,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023730225] [2025-02-07 20:26:52,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:26:52,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 20:26:52,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:52,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 20:26:52,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-02-07 20:26:52,197 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-07 20:26:52,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:26:52,413 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2025-02-07 20:26:52,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 20:26:52,416 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 44 [2025-02-07 20:26:52,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:26:52,417 INFO L225 Difference]: With dead ends: 104 [2025-02-07 20:26:52,417 INFO L226 Difference]: Without dead ends: 98 [2025-02-07 20:26:52,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-02-07 20:26:52,418 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:26:52,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 110 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:26:52,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-07 20:26:52,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2025-02-07 20:26:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.173913043478261) internal successors, (81), 69 states have internal predecessors, (81), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 20:26:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2025-02-07 20:26:52,441 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 44 [2025-02-07 20:26:52,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:26:52,442 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2025-02-07 20:26:52,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-07 20:26:52,443 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2025-02-07 20:26:52,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-07 20:26:52,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:52,444 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:52,452 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-07 20:26:52,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:52,644 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:52,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:52,645 INFO L85 PathProgramCache]: Analyzing trace with hash 845450798, now seen corresponding path program 2 times [2025-02-07 20:26:52,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:52,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350032371] [2025-02-07 20:26:52,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:26:52,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:52,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-07 20:26:52,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 20:26:52,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:26:52,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:26:52,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:52,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350032371] [2025-02-07 20:26:52,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350032371] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:26:52,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051219657] [2025-02-07 20:26:52,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:26:52,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:52,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:52,766 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-07 20:26:52,768 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-07 20:26:52,792 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-07 20:26:52,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 20:26:52,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:26:52,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:52,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 20:26:52,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:26:52,836 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 20:26:52,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:26:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:26:52,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051219657] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:26:52,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:26:52,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-02-07 20:26:52,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107809195] [2025-02-07 20:26:52,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:26:52,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:26:52,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:52,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:26:52,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:26:52,927 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-07 20:26:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:26:53,003 INFO L93 Difference]: Finished difference Result 119 states and 144 transitions. [2025-02-07 20:26:53,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:26:53,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2025-02-07 20:26:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:26:53,005 INFO L225 Difference]: With dead ends: 119 [2025-02-07 20:26:53,005 INFO L226 Difference]: Without dead ends: 95 [2025-02-07 20:26:53,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:26:53,006 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:26:53,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 68 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:26:53,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-07 20:26:53,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2025-02-07 20:26:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 76 states have internal predecessors, (89), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-07 20:26:53,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2025-02-07 20:26:53,031 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 44 [2025-02-07 20:26:53,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:26:53,032 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2025-02-07 20:26:53,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-07 20:26:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2025-02-07 20:26:53,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-07 20:26:53,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:26:53,034 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:26:53,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-07 20:26:53,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:53,235 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:26:53,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:26:53,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1231758545, now seen corresponding path program 3 times [2025-02-07 20:26:53,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:26:53,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245662039] [2025-02-07 20:26:53,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:26:53,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:26:53,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-02-07 20:26:53,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 20:26:53,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 20:26:53,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:53,408 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:26:53,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:26:53,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245662039] [2025-02-07 20:26:53,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245662039] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:26:53,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172274307] [2025-02-07 20:26:53,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:26:53,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:26:53,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:26:53,411 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-07 20:26:53,415 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-07 20:26:53,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-02-07 20:26:53,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 44 statements. [2025-02-07 20:26:53,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-07 20:26:53,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:26:53,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-07 20:26:53,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:26:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:26:54,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:26:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-07 20:26:54,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172274307] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:26:54,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:26:54,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 30 [2025-02-07 20:26:54,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535393946] [2025-02-07 20:26:54,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:26:54,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-07 20:26:54,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:26:54,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-07 20:26:54,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2025-02-07 20:26:54,758 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand has 30 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-07 20:27:01,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-07 20:27:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:27:01,573 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2025-02-07 20:27:01,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-07 20:27:01,574 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 44 [2025-02-07 20:27:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:27:01,574 INFO L225 Difference]: With dead ends: 117 [2025-02-07 20:27:01,574 INFO L226 Difference]: Without dead ends: 107 [2025-02-07 20:27:01,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=472, Invalid=2498, Unknown=0, NotChecked=0, Total=2970 [2025-02-07 20:27:01,576 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 53 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:27:01,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 230 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 570 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-02-07 20:27:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-07 20:27:01,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2025-02-07 20:27:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-07 20:27:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2025-02-07 20:27:01,596 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 44 [2025-02-07 20:27:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:27:01,597 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2025-02-07 20:27:01,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 10 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-07 20:27:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2025-02-07 20:27:01,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-07 20:27:01,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:27:01,598 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-07 20:27:01,603 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-07 20:27:01,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:27:01,803 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:27:01,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:27:01,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1266660273, now seen corresponding path program 2 times [2025-02-07 20:27:01,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:27:01,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070214614] [2025-02-07 20:27:01,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:27:01,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:27:01,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-07 20:27:01,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 20:27:01,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:27:01,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:27:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:27:02,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:27:02,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070214614] [2025-02-07 20:27:02,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070214614] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:27:02,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165986019] [2025-02-07 20:27:02,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:27:02,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:27:02,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:27:02,035 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-07 20:27:02,037 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-07 20:27:02,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-07 20:27:02,089 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 20:27:02,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:27:02,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:27:02,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 20:27:02,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:27:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:27:02,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:27:02,256 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:27:02,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165986019] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:27:02,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:27:02,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 17 [2025-02-07 20:27:02,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729972409] [2025-02-07 20:27:02,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:27:02,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 20:27:02,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:27:02,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 20:27:02,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-02-07 20:27:02,259 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-07 20:27:02,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:27:02,441 INFO L93 Difference]: Finished difference Result 139 states and 160 transitions. [2025-02-07 20:27:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-07 20:27:02,442 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 48 [2025-02-07 20:27:02,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:27:02,443 INFO L225 Difference]: With dead ends: 139 [2025-02-07 20:27:02,443 INFO L226 Difference]: Without dead ends: 133 [2025-02-07 20:27:02,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=215, Invalid=385, Unknown=0, NotChecked=0, Total=600 [2025-02-07 20:27:02,445 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:27:02,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 140 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:27:02,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-07 20:27:02,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-02-07 20:27:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.1214953271028036) internal successors, (120), 107 states have internal predecessors, (120), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-07 20:27:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 149 transitions. [2025-02-07 20:27:02,477 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 149 transitions. Word has length 48 [2025-02-07 20:27:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:27:02,477 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 149 transitions. [2025-02-07 20:27:02,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 9 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-02-07 20:27:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2025-02-07 20:27:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-07 20:27:02,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:27:02,479 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-07 20:27:02,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-07 20:27:02,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:27:02,679 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:27:02,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:27:02,680 INFO L85 PathProgramCache]: Analyzing trace with hash 399062873, now seen corresponding path program 3 times [2025-02-07 20:27:02,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:27:02,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329596203] [2025-02-07 20:27:02,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:27:02,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:27:02,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 108 statements into 11 equivalence classes. [2025-02-07 20:27:02,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 108 of 108 statements. [2025-02-07 20:27:02,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-07 20:27:02,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:27:02,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1401066086] [2025-02-07 20:27:02,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:27:02,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:27:02,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:27:02,768 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-07 20:27:02,771 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-07 20:27:02,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 108 statements into 11 equivalence classes. [2025-02-07 20:27:02,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 108 statements. [2025-02-07 20:27:02,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-07 20:27:02,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:27:02,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-07 20:27:02,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:27:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 102 proven. 1 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2025-02-07 20:27:03,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:27:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 46 proven. 57 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2025-02-07 20:27:03,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:27:03,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329596203] [2025-02-07 20:27:03,174 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:27:03,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401066086] [2025-02-07 20:27:03,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401066086] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:27:03,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:27:03,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2025-02-07 20:27:03,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119802183] [2025-02-07 20:27:03,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:27:03,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 20:27:03,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:27:03,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 20:27:03,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-02-07 20:27:03,176 INFO L87 Difference]: Start difference. First operand 133 states and 149 transitions. Second operand has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 16 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 20:27:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:27:03,352 INFO L93 Difference]: Finished difference Result 226 states and 249 transitions. [2025-02-07 20:27:03,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 20:27:03,353 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 16 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 108 [2025-02-07 20:27:03,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:27:03,355 INFO L225 Difference]: With dead ends: 226 [2025-02-07 20:27:03,355 INFO L226 Difference]: Without dead ends: 220 [2025-02-07 20:27:03,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-02-07 20:27:03,355 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:27:03,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 79 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:27:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-07 20:27:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2025-02-07 20:27:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 174 states have (on average 1.1206896551724137) internal successors, (195), 174 states have internal predecessors, (195), 23 states have call successors, (23), 20 states have call predecessors, (23), 19 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-07 20:27:03,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 240 transitions. [2025-02-07 20:27:03,406 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 240 transitions. Word has length 108 [2025-02-07 20:27:03,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:27:03,407 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 240 transitions. [2025-02-07 20:27:03,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 16 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 20:27:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 240 transitions. [2025-02-07 20:27:03,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-07 20:27:03,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:27:03,409 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:27:03,417 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-07 20:27:03,609 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,SelfDestructingSolverStorable11 [2025-02-07 20:27:03,610 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:27:03,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:27:03,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1408391590, now seen corresponding path program 1 times [2025-02-07 20:27:03,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:27:03,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439709038] [2025-02-07 20:27:03,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:27:03,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:27:03,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-07 20:27:03,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-07 20:27:03,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:27:03,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:27:03,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2033745489] [2025-02-07 20:27:03,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:27:03,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:27:03,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:27:03,648 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-07 20:27:03,650 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-07 20:27:03,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-07 20:27:03,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-07 20:27:03,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:27:03,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:27:03,721 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 20:27:03,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-07 20:27:03,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-07 20:27:03,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:27:03,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:27:03,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 20:27:03,815 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 20:27:03,816 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 20:27:03,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-07 20:27:04,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:27:04,021 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:27:04,070 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:27:04,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:27:04 BoogieIcfgContainer [2025-02-07 20:27:04,075 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:27:04,076 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:27:04,076 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:27:04,077 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:27:04,077 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:26:45" (3/4) ... [2025-02-07 20:27:04,078 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 20:27:04,162 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 75. [2025-02-07 20:27:04,259 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:27:04,260 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:27:04,260 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:27:04,260 INFO L158 Benchmark]: Toolchain (without parser) took 19023.75ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.5MB in the beginning and 76.1MB in the end (delta: 36.5MB). Peak memory consumption was 67.3MB. Max. memory is 16.1GB. [2025-02-07 20:27:04,261 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:27:04,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.41ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 101.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:27:04,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.81ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 100.2MB in the end (delta: 981.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:27:04,262 INFO L158 Benchmark]: Boogie Preprocessor took 18.47ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 98.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:27:04,262 INFO L158 Benchmark]: IcfgBuilder took 288.96ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 87.3MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 20:27:04,263 INFO L158 Benchmark]: TraceAbstraction took 18312.03ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 86.9MB in the beginning and 86.2MB in the end (delta: 652.4kB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2025-02-07 20:27:04,263 INFO L158 Benchmark]: Witness Printer took 183.22ms. Allocated memory is still 176.2MB. Free memory was 86.2MB in the beginning and 76.1MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:27:04,266 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.26ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.41ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 101.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.81ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 100.2MB in the end (delta: 981.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.47ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 98.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 288.96ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 87.3MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18312.03ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 86.9MB in the beginning and 86.2MB in the end (delta: 652.4kB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. * Witness Printer took 183.22ms. Allocated memory is still 176.2MB. Free memory was 86.2MB in the beginning and 76.1MB in the end (delta: 10.2MB). 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: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [X=20, Y=1, counter=0, v=-18, x=0, y=0] [L31] COND TRUE counter++<10 [L31] EXPR counter++ VAL [X=20, Y=1, counter=1, v=-18, x=0, y=0] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, counter=1, v=-18, x=0, xy=0, y=0, yx=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, counter=1, v=-18, x=0, xy=0, y=0, yx=0] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, counter=1, v=-18, x=0, xy=0, y=0, yx=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=20, Y=1, counter=1, v=-16, x=0, xy=0, y=0, yx=0] [L45] x++ VAL [X=20, Y=1, counter=1, v=-16, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<10 [L31] EXPR counter++ VAL [X=20, Y=1, counter=2, v=-16, x=1, xy=0, y=0, yx=0] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, counter=2, v=-16, x=1, xy=0, y=0, yx=1] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, counter=2, v=-16, x=1, xy=0, y=0, yx=1] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, counter=2, v=-16, x=1, xy=0, y=0, yx=1] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=20, Y=1, counter=2, v=-14, x=1, xy=0, y=0, yx=1] [L45] x++ VAL [X=20, Y=1, counter=2, v=-14, x=2, xy=0, y=0, yx=1] [L31] COND TRUE counter++<10 [L31] EXPR counter++ VAL [X=20, Y=1, counter=3, v=-14, x=2, xy=0, y=0, yx=1] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, counter=3, v=-14, x=2, xy=0, y=0, yx=2] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, counter=3, v=-14, x=2, xy=0, y=0, yx=2] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, counter=3, v=-14, x=2, xy=0, y=0, yx=2] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=20, Y=1, counter=3, v=-12, x=2, xy=0, y=0, yx=2] [L45] x++ VAL [X=20, Y=1, counter=3, v=-12, x=3, xy=0, y=0, yx=2] [L31] COND TRUE counter++<10 [L31] EXPR counter++ VAL [X=20, Y=1, counter=4, v=-12, x=3, xy=0, y=0, yx=2] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, counter=4, v=-12, x=3, xy=0, y=0, yx=3] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, counter=4, v=-12, x=3, xy=0, y=0, yx=3] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, counter=4, v=-12, x=3, xy=0, y=0, yx=3] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=20, Y=1, counter=4, v=-10, x=3, xy=0, y=0, yx=3] [L45] x++ VAL [X=20, Y=1, counter=4, v=-10, x=4, xy=0, y=0, yx=3] [L31] COND TRUE counter++<10 [L31] EXPR counter++ VAL [X=20, Y=1, counter=5, v=-10, x=4, xy=0, y=0, yx=3] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, counter=5, v=-10, x=4, xy=0, y=0, yx=4] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, counter=5, v=-10, x=4, xy=0, y=0, yx=4] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, counter=5, v=-10, x=4, xy=0, y=0, yx=4] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=20, Y=1, counter=5, v=-8, x=4, xy=0, y=0, yx=4] [L45] x++ VAL [X=20, Y=1, counter=5, v=-8, x=5, xy=0, y=0, yx=4] [L31] COND TRUE counter++<10 [L31] EXPR counter++ VAL [X=20, Y=1, counter=6, v=-8, x=5, xy=0, y=0, yx=4] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, counter=6, v=-8, x=5, xy=0, y=0, yx=5] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, counter=6, v=-8, x=5, xy=0, y=0, yx=5] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, counter=6, v=-8, x=5, xy=0, y=0, yx=5] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=20, Y=1, counter=6, v=-6, x=5, xy=0, y=0, yx=5] [L45] x++ VAL [X=20, Y=1, counter=6, v=-6, x=6, xy=0, y=0, yx=5] [L31] COND TRUE counter++<10 [L31] EXPR counter++ VAL [X=20, Y=1, counter=7, v=-6, x=6, xy=0, y=0, yx=5] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, counter=7, v=-6, x=6, xy=0, y=0, yx=6] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, counter=7, v=-6, x=6, xy=0, y=0, yx=6] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, counter=7, v=-6, x=6, xy=0, y=0, yx=6] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=20, Y=1, counter=7, v=-4, x=6, xy=0, y=0, yx=6] [L45] x++ VAL [X=20, Y=1, counter=7, v=-4, x=7, xy=0, y=0, yx=6] [L31] COND TRUE counter++<10 [L31] EXPR counter++ VAL [X=20, Y=1, counter=8, v=-4, x=7, xy=0, y=0, yx=6] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, counter=8, v=-4, x=7, xy=0, y=0, yx=7] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, counter=8, v=-4, x=7, xy=0, y=0, yx=7] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, counter=8, v=-4, x=7, xy=0, y=0, yx=7] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=20, Y=1, counter=8, v=-2, x=7, xy=0, y=0, yx=7] [L45] x++ VAL [X=20, Y=1, counter=8, v=-2, x=8, xy=0, y=0, yx=7] [L31] COND TRUE counter++<10 [L31] EXPR counter++ VAL [X=20, Y=1, counter=9, v=-2, x=8, xy=0, y=0, yx=7] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, counter=9, v=-2, x=8, xy=0, y=0, yx=8] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, counter=9, v=-2, x=8, xy=0, y=0, yx=8] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, counter=9, v=-2, x=8, xy=0, y=0, yx=8] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=20, Y=1, counter=9, v=0, x=8, xy=0, y=0, yx=8] [L45] x++ VAL [X=20, Y=1, counter=9, v=0, x=9, xy=0, y=0, yx=8] [L31] COND TRUE counter++<10 [L31] EXPR counter++ VAL [X=20, Y=1, counter=10, v=0, x=9, xy=0, y=0, yx=8] [L31] COND TRUE counter++<10 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=20, Y=1, counter=10, v=0, x=9, xy=0, y=0, yx=9] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=20, Y=1, counter=10, v=0, x=9, xy=0, y=0, yx=9] [L35] COND FALSE !(!(x <= X)) VAL [X=20, Y=1, counter=10, v=0, x=9, xy=0, y=0, yx=9] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=20, Y=1, counter=10, v=-38, x=9, xy=0, y=1, yx=9] [L45] x++ VAL [X=20, Y=1, counter=10, v=-38, x=10, xy=0, y=1, yx=9] [L31] COND TRUE counter++<10 [L31] EXPR counter++ VAL [X=20, Y=1, counter=11, v=-38, x=10, xy=0, y=1, yx=9] [L31] COND FALSE !(counter++<10) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=20, Y=1, counter=11, v=-38, xy=10, y=1, yx=10] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=11] [L14] COND TRUE !(cond) VAL [\old(cond)=0, counter=11] [L16] reach_error() VAL [\old(cond)=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.2s, OverallIterations: 13, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 224 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 219 mSDsluCounter, 1118 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 953 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1537 IncrementalHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 165 mSDtfsCounter, 1537 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 849 GetRequests, 636 SyntacticMatches, 13 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=12, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 86 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1008 NumberOfCodeBlocks, 898 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 943 ConstructedInterpolants, 6 QuantifiedInterpolants, 4464 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1035 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 26 InterpolantComputations, 3 PerfectInterpolantSequences, 1433/1838 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-07 20:27:04,290 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