./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.recount4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.recount4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash d1f3c30f17cc68a40d1b0b31634de48071c9ae3c0808bd553c6c6ce86d938069 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:51:57,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:51:57,182 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:51:57,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:51:57,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:51:57,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:51:57,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:51:57,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:51:57,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:51:57,210 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:51:57,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:51:57,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:51:57,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:51:57,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:51:57,211 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:51:57,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:51:57,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:51:57,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:51:57,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:51:57,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:51:57,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:51:57,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:51:57,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:51:57,216 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:51:57,216 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:51:57,216 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:51:57,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:51:57,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:51:57,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:51:57,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:51:57,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:51:57,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:51:57,217 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:51:57,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:51:57,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:51:57,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:51:57,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:51:57,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:51:57,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:51:57,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:51:57,218 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d1f3c30f17cc68a40d1b0b31634de48071c9ae3c0808bd553c6c6ce86d938069 [2025-02-07 23:51:57,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:51:57,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:51:57,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:51:57,426 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:51:57,426 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:51:57,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.recount4.c [2025-02-07 23:51:58,513 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19de7b9db/c6787225beb64971a544094bd7540eda/FLAG8ee871a9d [2025-02-07 23:51:58,729 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:51:58,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.recount4.c [2025-02-07 23:51:58,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19de7b9db/c6787225beb64971a544094bd7540eda/FLAG8ee871a9d [2025-02-07 23:51:59,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19de7b9db/c6787225beb64971a544094bd7540eda [2025-02-07 23:51:59,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:51:59,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:51:59,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:51:59,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:51:59,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:51:59,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:51:59" (1/1) ... [2025-02-07 23:51:59,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7874dde8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:51:59, skipping insertion in model container [2025-02-07 23:51:59,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:51:59" (1/1) ... [2025-02-07 23:51:59,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:51:59,205 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/hardware-verification-bv/btor2c-lazyMod.recount4.c[1258,1271] [2025-02-07 23:51:59,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:51:59,240 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:51:59,246 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/hardware-verification-bv/btor2c-lazyMod.recount4.c[1258,1271] [2025-02-07 23:51:59,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:51:59,274 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:51:59,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:51:59 WrapperNode [2025-02-07 23:51:59,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:51:59,279 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:51:59,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:51:59,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:51:59,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:51:59" (1/1) ... [2025-02-07 23:51:59,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:51:59" (1/1) ... [2025-02-07 23:51:59,313 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2025-02-07 23:51:59,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:51:59,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:51:59,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:51:59,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:51:59,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:51:59" (1/1) ... [2025-02-07 23:51:59,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:51:59" (1/1) ... [2025-02-07 23:51:59,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:51:59" (1/1) ... [2025-02-07 23:51:59,341 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 23:51:59,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:51:59" (1/1) ... [2025-02-07 23:51:59,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:51:59" (1/1) ... [2025-02-07 23:51:59,346 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:51:59" (1/1) ... [2025-02-07 23:51:59,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:51:59" (1/1) ... [2025-02-07 23:51:59,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:51:59" (1/1) ... [2025-02-07 23:51:59,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:51:59" (1/1) ... [2025-02-07 23:51:59,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:51:59,354 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:51:59,354 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:51:59,354 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:51:59,355 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:51:59" (1/1) ... [2025-02-07 23:51:59,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:51:59,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:51:59,380 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 23:51:59,383 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 23:51:59,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:51:59,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:51:59,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:51:59,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:51:59,445 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:51:59,447 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:51:59,640 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-02-07 23:51:59,640 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:51:59,663 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:51:59,664 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:51:59,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:51:59 BoogieIcfgContainer [2025-02-07 23:51:59,664 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:51:59,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:51:59,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:51:59,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:51:59,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:51:59" (1/3) ... [2025-02-07 23:51:59,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@daf28c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:51:59, skipping insertion in model container [2025-02-07 23:51:59,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:51:59" (2/3) ... [2025-02-07 23:51:59,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@daf28c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:51:59, skipping insertion in model container [2025-02-07 23:51:59,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:51:59" (3/3) ... [2025-02-07 23:51:59,671 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.recount4.c [2025-02-07 23:51:59,681 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:51:59,682 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.recount4.c that has 1 procedures, 24 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:51:59,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:51:59,731 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;@561755b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:51:59,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:51:59,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:51:59,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 23:51:59,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:51:59,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:51:59,740 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:51:59,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:51:59,745 INFO L85 PathProgramCache]: Analyzing trace with hash -594604073, now seen corresponding path program 1 times [2025-02-07 23:51:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:51:59,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840779372] [2025-02-07 23:51:59,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:51:59,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:51:59,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 23:51:59,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 23:51:59,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:51:59,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:00,113 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 23:52:00,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:00,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840779372] [2025-02-07 23:52:00,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840779372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:00,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:52:00,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:52:00,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555735418] [2025-02-07 23:52:00,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:00,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:52:00,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:00,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:52:00,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:52:00,130 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:00,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:00,196 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2025-02-07 23:52:00,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:52:00,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-07 23:52:00,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:00,201 INFO L225 Difference]: With dead ends: 52 [2025-02-07 23:52:00,202 INFO L226 Difference]: Without dead ends: 33 [2025-02-07 23:52:00,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:52:00,205 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 53 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:00,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 23:52:00,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-07 23:52:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2025-02-07 23:52:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:00,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2025-02-07 23:52:00,229 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 10 [2025-02-07 23:52:00,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:00,229 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2025-02-07 23:52:00,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2025-02-07 23:52:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 23:52:00,231 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:00,231 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:52:00,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:52:00,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:00,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:00,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1100617669, now seen corresponding path program 1 times [2025-02-07 23:52:00,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:00,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585677523] [2025-02-07 23:52:00,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:00,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:00,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 23:52:00,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 23:52:00,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:00,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:52:00,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:00,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585677523] [2025-02-07 23:52:00,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585677523] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:52:00,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501919667] [2025-02-07 23:52:00,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:00,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:52:00,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:52:00,522 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 23:52:00,524 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 23:52:00,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 23:52:00,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 23:52:00,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:00,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:00,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-07 23:52:00,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:52:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:52:00,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:52:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:52:00,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501919667] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:52:00,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 23:52:00,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 12 [2025-02-07 23:52:00,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668957690] [2025-02-07 23:52:00,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 23:52:00,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 23:52:00,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:00,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 23:52:00,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-02-07 23:52:00,934 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:01,028 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2025-02-07 23:52:01,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:52:01,028 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-07 23:52:01,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:01,029 INFO L225 Difference]: With dead ends: 46 [2025-02-07 23:52:01,029 INFO L226 Difference]: Without dead ends: 44 [2025-02-07 23:52:01,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-02-07 23:52:01,031 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 42 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:01,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 167 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:52:01,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-07 23:52:01,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2025-02-07 23:52:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2025-02-07 23:52:01,036 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 19 [2025-02-07 23:52:01,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:01,036 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2025-02-07 23:52:01,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2025-02-07 23:52:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 23:52:01,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:01,038 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:52:01,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 23:52:01,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:52:01,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:01,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:01,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1842238713, now seen corresponding path program 1 times [2025-02-07 23:52:01,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:01,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142196119] [2025-02-07 23:52:01,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:01,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:01,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 23:52:01,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 23:52:01,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:01,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:52:01,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:01,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142196119] [2025-02-07 23:52:01,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142196119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:01,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:52:01,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:52:01,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119743107] [2025-02-07 23:52:01,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:01,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:52:01,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:01,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:52:01,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:52:01,526 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:01,689 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2025-02-07 23:52:01,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:52:01,690 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-07 23:52:01,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:01,690 INFO L225 Difference]: With dead ends: 85 [2025-02-07 23:52:01,690 INFO L226 Difference]: Without dead ends: 57 [2025-02-07 23:52:01,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:52:01,691 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 84 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:01,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 60 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:52:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-07 23:52:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2025-02-07 23:52:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2025-02-07 23:52:01,697 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 20 [2025-02-07 23:52:01,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:01,698 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2025-02-07 23:52:01,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2025-02-07 23:52:01,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-07 23:52:01,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:01,698 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:52:01,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:52:01,698 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:01,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:01,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1319843094, now seen corresponding path program 1 times [2025-02-07 23:52:01,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:01,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418058355] [2025-02-07 23:52:01,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:01,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:01,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-07 23:52:01,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 23:52:01,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:01,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:52:02,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:02,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418058355] [2025-02-07 23:52:02,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418058355] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:52:02,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322057356] [2025-02-07 23:52:02,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:02,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:52:02,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:52:02,286 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 23:52:02,287 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 23:52:02,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-07 23:52:02,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 23:52:02,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:02,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:02,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-07 23:52:02,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:52:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:52:02,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:52:02,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322057356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:02,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 23:52:02,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2025-02-07 23:52:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262162280] [2025-02-07 23:52:02,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:02,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:52:02,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:02,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:52:02,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-02-07 23:52:02,650 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:02,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:02,740 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2025-02-07 23:52:02,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:52:02,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-07 23:52:02,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:02,742 INFO L225 Difference]: With dead ends: 81 [2025-02-07 23:52:02,742 INFO L226 Difference]: Without dead ends: 52 [2025-02-07 23:52:02,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2025-02-07 23:52:02,743 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 62 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:02,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 58 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:52:02,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-07 23:52:02,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2025-02-07 23:52:02,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:02,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2025-02-07 23:52:02,749 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 21 [2025-02-07 23:52:02,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:02,749 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2025-02-07 23:52:02,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:02,749 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2025-02-07 23:52:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-07 23:52:02,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:02,749 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:52:02,756 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 23:52:02,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:52:02,950 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:02,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:02,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1441314444, now seen corresponding path program 1 times [2025-02-07 23:52:02,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:02,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3893677] [2025-02-07 23:52:02,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:02,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:02,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-07 23:52:02,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 23:52:02,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:02,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:52:03,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:03,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3893677] [2025-02-07 23:52:03,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3893677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:03,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:52:03,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 23:52:03,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182850450] [2025-02-07 23:52:03,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:03,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:52:03,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:03,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:52:03,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:52:03,268 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:03,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:03,433 INFO L93 Difference]: Finished difference Result 93 states and 125 transitions. [2025-02-07 23:52:03,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:52:03,433 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-07 23:52:03,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:03,433 INFO L225 Difference]: With dead ends: 93 [2025-02-07 23:52:03,433 INFO L226 Difference]: Without dead ends: 65 [2025-02-07 23:52:03,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-02-07 23:52:03,434 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 70 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:03,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 75 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:52:03,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-07 23:52:03,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2025-02-07 23:52:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2025-02-07 23:52:03,440 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2025-02-07 23:52:03,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:03,440 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2025-02-07 23:52:03,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:03,440 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2025-02-07 23:52:03,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 23:52:03,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:03,440 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:52:03,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 23:52:03,441 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:03,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:03,441 INFO L85 PathProgramCache]: Analyzing trace with hash 983591234, now seen corresponding path program 1 times [2025-02-07 23:52:03,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:03,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285787856] [2025-02-07 23:52:03,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:03,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:03,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 23:52:03,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 23:52:03,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:03,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:03,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:52:03,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:03,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285787856] [2025-02-07 23:52:03,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285787856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:03,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:52:03,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:52:03,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116189863] [2025-02-07 23:52:03,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:03,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:52:03,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:03,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:52:03,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:52:03,574 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:03,650 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2025-02-07 23:52:03,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:52:03,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-07 23:52:03,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:03,653 INFO L225 Difference]: With dead ends: 93 [2025-02-07 23:52:03,653 INFO L226 Difference]: Without dead ends: 65 [2025-02-07 23:52:03,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:52:03,654 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:03,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 64 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:52:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-07 23:52:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2025-02-07 23:52:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 52 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2025-02-07 23:52:03,660 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 22 [2025-02-07 23:52:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:03,661 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2025-02-07 23:52:03,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2025-02-07 23:52:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 23:52:03,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:03,661 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:52:03,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 23:52:03,662 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:03,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:03,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1686056965, now seen corresponding path program 1 times [2025-02-07 23:52:03,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:03,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884799160] [2025-02-07 23:52:03,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:03,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:03,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 23:52:03,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 23:52:03,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:03,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:04,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:52:04,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:04,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884799160] [2025-02-07 23:52:04,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884799160] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:52:04,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709839764] [2025-02-07 23:52:04,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:04,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:52:04,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:52:04,038 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 23:52:04,043 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 23:52:04,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 23:52:04,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 23:52:04,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:04,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:04,118 WARN L254 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-07 23:52:04,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:52:04,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:52:04,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:52:07,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:52:07,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709839764] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:52:07,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 23:52:07,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 35 [2025-02-07 23:52:07,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106164740] [2025-02-07 23:52:07,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 23:52:07,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-07 23:52:07,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:07,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-07 23:52:07,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1082, Unknown=0, NotChecked=0, Total=1260 [2025-02-07 23:52:07,512 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand has 36 states, 36 states have (on average 1.75) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:08,331 INFO L93 Difference]: Finished difference Result 169 states and 228 transitions. [2025-02-07 23:52:08,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-07 23:52:08,331 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.75) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-07 23:52:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:08,332 INFO L225 Difference]: With dead ends: 169 [2025-02-07 23:52:08,332 INFO L226 Difference]: Without dead ends: 134 [2025-02-07 23:52:08,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=498, Invalid=2582, Unknown=0, NotChecked=0, Total=3080 [2025-02-07 23:52:08,335 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 314 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:08,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 47 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:52:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-07 23:52:08,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 83. [2025-02-07 23:52:08,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 82 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2025-02-07 23:52:08,343 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 110 transitions. Word has length 22 [2025-02-07 23:52:08,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:08,344 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 110 transitions. [2025-02-07 23:52:08,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.75) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2025-02-07 23:52:08,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-07 23:52:08,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:08,344 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:52:08,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 23:52:08,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:52:08,545 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:08,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:08,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2004499668, now seen corresponding path program 1 times [2025-02-07 23:52:08,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:08,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088201673] [2025-02-07 23:52:08,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:08,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:08,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 23:52:08,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 23:52:08,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:08,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:08,806 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 23:52:08,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:08,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088201673] [2025-02-07 23:52:08,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088201673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:52:08,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:52:08,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 23:52:08,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008771630] [2025-02-07 23:52:08,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:52:08,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:52:08,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:08,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:52:08,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:52:08,809 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:08,879 INFO L93 Difference]: Finished difference Result 156 states and 207 transitions. [2025-02-07 23:52:08,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:52:08,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-02-07 23:52:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:08,880 INFO L225 Difference]: With dead ends: 156 [2025-02-07 23:52:08,880 INFO L226 Difference]: Without dead ends: 106 [2025-02-07 23:52:08,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:52:08,881 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 24 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:08,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 165 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:52:08,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-07 23:52:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2025-02-07 23:52:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2025-02-07 23:52:08,888 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 40 [2025-02-07 23:52:08,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:08,888 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2025-02-07 23:52:08,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2025-02-07 23:52:08,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-07 23:52:08,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:08,889 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:52:08,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 23:52:08,889 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:08,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:08,889 INFO L85 PathProgramCache]: Analyzing trace with hash 826924712, now seen corresponding path program 1 times [2025-02-07 23:52:08,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:08,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480274530] [2025-02-07 23:52:08,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:08,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:08,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-07 23:52:08,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 23:52:08,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:08,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 23:52:09,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:09,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480274530] [2025-02-07 23:52:09,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480274530] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:52:09,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255300372] [2025-02-07 23:52:09,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:09,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:52:09,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:52:09,128 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 23:52:09,128 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 23:52:09,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-07 23:52:09,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 23:52:09,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:09,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:09,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-07 23:52:09,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:52:09,294 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 23:52:09,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:52:09,410 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 23:52:09,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255300372] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:52:09,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 23:52:09,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2025-02-07 23:52:09,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414885466] [2025-02-07 23:52:09,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 23:52:09,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 23:52:09,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:09,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 23:52:09,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:52:09,411 INFO L87 Difference]: Start difference. First operand 88 states and 117 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:09,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:09,633 INFO L93 Difference]: Finished difference Result 181 states and 234 transitions. [2025-02-07 23:52:09,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-07 23:52:09,634 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-02-07 23:52:09,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:09,634 INFO L225 Difference]: With dead ends: 181 [2025-02-07 23:52:09,634 INFO L226 Difference]: Without dead ends: 120 [2025-02-07 23:52:09,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2025-02-07 23:52:09,635 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 49 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:09,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 120 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:52:09,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-07 23:52:09,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 81. [2025-02-07 23:52:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.35) internal successors, (108), 80 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 108 transitions. [2025-02-07 23:52:09,643 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 108 transitions. Word has length 41 [2025-02-07 23:52:09,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:09,643 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 108 transitions. [2025-02-07 23:52:09,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 108 transitions. [2025-02-07 23:52:09,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-07 23:52:09,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:09,643 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:52:09,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 23:52:09,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-07 23:52:09,844 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:09,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:09,844 INFO L85 PathProgramCache]: Analyzing trace with hash -710268125, now seen corresponding path program 1 times [2025-02-07 23:52:09,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:09,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78920698] [2025-02-07 23:52:09,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:09,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:09,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-07 23:52:09,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 23:52:09,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:09,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 27 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:52:10,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:10,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78920698] [2025-02-07 23:52:10,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78920698] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:52:10,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467666182] [2025-02-07 23:52:10,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:10,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:52:10,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:52:10,533 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 23:52:10,535 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 23:52:10,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-07 23:52:10,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 23:52:10,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:10,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:10,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-07 23:52:10,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:52:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 23:52:11,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:52:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 23:52:15,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467666182] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:52:15,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 23:52:15,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 37 [2025-02-07 23:52:15,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611772592] [2025-02-07 23:52:15,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 23:52:15,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-07 23:52:15,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:15,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-07 23:52:15,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1230, Unknown=1, NotChecked=0, Total=1406 [2025-02-07 23:52:15,769 INFO L87 Difference]: Start difference. First operand 81 states and 108 transitions. Second operand has 38 states, 38 states have (on average 2.763157894736842) internal successors, (105), 37 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:16,872 INFO L93 Difference]: Finished difference Result 252 states and 328 transitions. [2025-02-07 23:52:16,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-07 23:52:16,872 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.763157894736842) internal successors, (105), 37 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-02-07 23:52:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:16,873 INFO L225 Difference]: With dead ends: 252 [2025-02-07 23:52:16,873 INFO L226 Difference]: Without dead ends: 199 [2025-02-07 23:52:16,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=890, Invalid=4365, Unknown=1, NotChecked=0, Total=5256 [2025-02-07 23:52:16,875 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 266 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:16,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 50 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:52:16,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-07 23:52:16,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 128. [2025-02-07 23:52:16,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.3543307086614174) internal successors, (172), 127 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:16,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 172 transitions. [2025-02-07 23:52:16,881 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 172 transitions. Word has length 41 [2025-02-07 23:52:16,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:16,881 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 172 transitions. [2025-02-07 23:52:16,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.763157894736842) internal successors, (105), 37 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:16,881 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 172 transitions. [2025-02-07 23:52:16,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 23:52:16,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:16,882 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-07 23:52:16,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-07 23:52:17,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-07 23:52:17,086 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:17,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:17,086 INFO L85 PathProgramCache]: Analyzing trace with hash -858038779, now seen corresponding path program 1 times [2025-02-07 23:52:17,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:17,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052953359] [2025-02-07 23:52:17,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:17,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:17,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 23:52:17,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 23:52:17,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:17,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:52:18,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:18,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052953359] [2025-02-07 23:52:18,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052953359] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:52:18,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854269884] [2025-02-07 23:52:18,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:18,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:52:18,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:52:18,033 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 23:52:18,034 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 23:52:18,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 23:52:18,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 23:52:18,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:18,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:18,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-02-07 23:52:18,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:52:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 23:52:18,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:52:20,659 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 23:52:20,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854269884] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:52:20,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 23:52:20,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 15] total 47 [2025-02-07 23:52:20,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285849662] [2025-02-07 23:52:20,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 23:52:20,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-07 23:52:20,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:20,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-07 23:52:20,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1998, Unknown=0, NotChecked=0, Total=2256 [2025-02-07 23:52:20,661 INFO L87 Difference]: Start difference. First operand 128 states and 172 transitions. Second operand has 48 states, 48 states have (on average 2.5833333333333335) internal successors, (124), 47 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:22,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:22,519 INFO L93 Difference]: Finished difference Result 319 states and 412 transitions. [2025-02-07 23:52:22,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-02-07 23:52:22,520 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.5833333333333335) internal successors, (124), 47 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-02-07 23:52:22,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:22,521 INFO L225 Difference]: With dead ends: 319 [2025-02-07 23:52:22,521 INFO L226 Difference]: Without dead ends: 317 [2025-02-07 23:52:22,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2087 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1178, Invalid=7012, Unknown=0, NotChecked=0, Total=8190 [2025-02-07 23:52:22,523 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 293 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:22,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 84 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:52:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-07 23:52:22,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 134. [2025-02-07 23:52:22,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.3609022556390977) internal successors, (181), 133 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 181 transitions. [2025-02-07 23:52:22,532 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 181 transitions. Word has length 43 [2025-02-07 23:52:22,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:22,532 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 181 transitions. [2025-02-07 23:52:22,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.5833333333333335) internal successors, (124), 47 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:22,532 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 181 transitions. [2025-02-07 23:52:22,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 23:52:22,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:22,533 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-07 23:52:22,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-07 23:52:22,733 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,SelfDestructingSolverStorable10 [2025-02-07 23:52:22,734 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:22,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:22,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1411901151, now seen corresponding path program 2 times [2025-02-07 23:52:22,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:22,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576509234] [2025-02-07 23:52:22,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 23:52:22,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:22,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-02-07 23:52:22,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 23:52:22,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 23:52:22,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:23,879 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:52:23,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:23,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576509234] [2025-02-07 23:52:23,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576509234] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:52:23,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751199030] [2025-02-07 23:52:23,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 23:52:23,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:52:23,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:52:23,881 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 23:52:23,883 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 23:52:23,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-02-07 23:52:23,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 23:52:23,964 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 23:52:23,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:23,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-02-07 23:52:23,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:52:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 23:52:24,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:52:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 23:52:31,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751199030] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:52:31,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 23:52:31,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 16] total 56 [2025-02-07 23:52:31,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708958476] [2025-02-07 23:52:31,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 23:52:31,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-02-07 23:52:31,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:52:31,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-02-07 23:52:31,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2877, Unknown=0, NotChecked=0, Total=3192 [2025-02-07 23:52:31,182 INFO L87 Difference]: Start difference. First operand 134 states and 181 transitions. Second operand has 57 states, 57 states have (on average 2.192982456140351) internal successors, (125), 56 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:52:34,281 INFO L93 Difference]: Finished difference Result 593 states and 785 transitions. [2025-02-07 23:52:34,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-02-07 23:52:34,281 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.192982456140351) internal successors, (125), 56 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-02-07 23:52:34,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:52:34,283 INFO L225 Difference]: With dead ends: 593 [2025-02-07 23:52:34,283 INFO L226 Difference]: Without dead ends: 493 [2025-02-07 23:52:34,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4011 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1743, Invalid=11597, Unknown=0, NotChecked=0, Total=13340 [2025-02-07 23:52:34,286 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 562 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:52:34,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 91 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:52:34,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-02-07 23:52:34,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 168. [2025-02-07 23:52:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.3353293413173652) internal successors, (223), 167 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 223 transitions. [2025-02-07 23:52:34,294 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 223 transitions. Word has length 43 [2025-02-07 23:52:34,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:52:34,294 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 223 transitions. [2025-02-07 23:52:34,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.192982456140351) internal successors, (125), 56 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:52:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 223 transitions. [2025-02-07 23:52:34,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-07 23:52:34,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:52:34,295 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-02-07 23:52:34,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-07 23:52:34,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:52:34,496 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:52:34,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:52:34,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1568644647, now seen corresponding path program 1 times [2025-02-07 23:52:34,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:52:34,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010737821] [2025-02-07 23:52:34,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:34,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:52:34,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 23:52:34,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 23:52:34,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:34,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 27 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:52:36,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:52:36,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010737821] [2025-02-07 23:52:36,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010737821] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:52:36,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960983877] [2025-02-07 23:52:36,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:52:36,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:52:36,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:52:36,294 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 23:52:36,295 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 23:52:36,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-07 23:52:36,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 23:52:36,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:52:36,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:52:36,416 WARN L254 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 172 conjuncts are in the unsatisfiable core [2025-02-07 23:52:36,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:52:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 27 proven. 60 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 23:52:38,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:53:07,792 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 176 DAG size of output: 166 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)