./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_palu.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.vis_arrays_palu.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 7bfb32b49701ea1484553c69a9c6c976094bd0d4ca4d5ea9d4d30cdc2f2571dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:13:43,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:13:43,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:13:43,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:13:43,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:13:43,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:13:43,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:13:43,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:13:43,598 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:13:43,598 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:13:43,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:13:43,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:13:43,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:13:43,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:13:43,599 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:13:43,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:13:43,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:13:43,599 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:13:43,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:13:43,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:13:43,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:13:43,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:13:43,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:13:43,599 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:13:43,599 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:13:43,600 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:13:43,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:13:43,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:13:43,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:13:43,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:13:43,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:13:43,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:13:43,601 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:13:43,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:13:43,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:13:43,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:13:43,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:13:43,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:13:43,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:13:43,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:13:43,601 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 -> 7bfb32b49701ea1484553c69a9c6c976094bd0d4ca4d5ea9d4d30cdc2f2571dd [2025-02-08 00:13:43,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:13:43,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:13:43,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:13:43,838 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:13:43,838 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:13:43,839 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.vis_arrays_palu.c [2025-02-08 00:13:45,013 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80da558f8/6025843f6f7843d486d3a394df78025b/FLAG72aa8c067 [2025-02-08 00:13:45,249 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:13:45,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_palu.c [2025-02-08 00:13:45,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80da558f8/6025843f6f7843d486d3a394df78025b/FLAG72aa8c067 [2025-02-08 00:13:45,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80da558f8/6025843f6f7843d486d3a394df78025b [2025-02-08 00:13:45,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:13:45,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:13:45,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:13:45,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:13:45,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:13:45,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:13:45" (1/1) ... [2025-02-08 00:13:45,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474c63f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:45, skipping insertion in model container [2025-02-08 00:13:45,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:13:45" (1/1) ... [2025-02-08 00:13:45,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:13:45,399 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.vis_arrays_palu.c[1255,1268] [2025-02-08 00:13:45,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:13:45,567 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:13:45,576 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.vis_arrays_palu.c[1255,1268] [2025-02-08 00:13:45,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:13:45,642 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:13:45,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:45 WrapperNode [2025-02-08 00:13:45,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:13:45,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:13:45,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:13:45,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:13:45,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:45" (1/1) ... [2025-02-08 00:13:45,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:45" (1/1) ... [2025-02-08 00:13:45,778 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1243 [2025-02-08 00:13:45,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:13:45,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:13:45,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:13:45,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:13:45,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:45" (1/1) ... [2025-02-08 00:13:45,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:45" (1/1) ... [2025-02-08 00:13:45,798 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:45" (1/1) ... [2025-02-08 00:13:45,823 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-08 00:13:45,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:45" (1/1) ... [2025-02-08 00:13:45,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:45" (1/1) ... [2025-02-08 00:13:45,847 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:45" (1/1) ... [2025-02-08 00:13:45,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:45" (1/1) ... [2025-02-08 00:13:45,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:45" (1/1) ... [2025-02-08 00:13:45,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:45" (1/1) ... [2025-02-08 00:13:45,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:13:45,874 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:13:45,874 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:13:45,874 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:13:45,875 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:45" (1/1) ... [2025-02-08 00:13:45,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:13:45,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:13:45,905 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-08 00:13:45,910 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-08 00:13:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:13:45,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:13:45,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:13:45,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:13:46,073 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:13:46,075 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:13:47,116 INFO L? ?]: Removed 680 outVars from TransFormulas that were not future-live. [2025-02-08 00:13:47,116 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:13:47,176 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:13:47,176 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:13:47,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:13:47 BoogieIcfgContainer [2025-02-08 00:13:47,176 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:13:47,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:13:47,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:13:47,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:13:47,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:13:45" (1/3) ... [2025-02-08 00:13:47,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a312aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:13:47, skipping insertion in model container [2025-02-08 00:13:47,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:13:45" (2/3) ... [2025-02-08 00:13:47,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a312aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:13:47, skipping insertion in model container [2025-02-08 00:13:47,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:13:47" (3/3) ... [2025-02-08 00:13:47,184 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_palu.c [2025-02-08 00:13:47,194 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:13:47,195 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_palu.c that has 1 procedures, 360 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:13:47,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:13:47,249 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;@761b824e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:13:47,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:13:47,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 360 states, 358 states have (on average 1.5) internal successors, (537), 359 states have internal predecessors, (537), 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-08 00:13:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 00:13:47,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:47,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:13:47,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:47,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:47,263 INFO L85 PathProgramCache]: Analyzing trace with hash -26266346, now seen corresponding path program 1 times [2025-02-08 00:13:47,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:47,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209783458] [2025-02-08 00:13:47,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:47,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:47,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 00:13:47,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 00:13:47,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:47,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:47,975 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-08 00:13:47,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:47,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209783458] [2025-02-08 00:13:47,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209783458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:47,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:47,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:13:47,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239124832] [2025-02-08 00:13:47,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:47,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:13:47,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:47,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:13:47,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:48,000 INFO L87 Difference]: Start difference. First operand has 360 states, 358 states have (on average 1.5) internal successors, (537), 359 states have internal predecessors, (537), 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 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-08 00:13:48,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:48,255 INFO L93 Difference]: Finished difference Result 679 states and 1015 transitions. [2025-02-08 00:13:48,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:13:48,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2025-02-08 00:13:48,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:48,267 INFO L225 Difference]: With dead ends: 679 [2025-02-08 00:13:48,272 INFO L226 Difference]: Without dead ends: 360 [2025-02-08 00:13:48,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:48,281 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 0 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:48,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1327 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:13:48,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-08 00:13:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-02-08 00:13:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.4930362116991645) internal successors, (536), 359 states have internal predecessors, (536), 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-08 00:13:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 536 transitions. [2025-02-08 00:13:48,330 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 536 transitions. Word has length 50 [2025-02-08 00:13:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:48,331 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 536 transitions. [2025-02-08 00:13:48,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-08 00:13:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 536 transitions. [2025-02-08 00:13:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 00:13:48,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:48,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:13:48,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:13:48,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:48,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash -809577128, now seen corresponding path program 1 times [2025-02-08 00:13:48,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:48,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112562075] [2025-02-08 00:13:48,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:48,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:48,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 00:13:48,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 00:13:48,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:48,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:48,575 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-08 00:13:48,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:48,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112562075] [2025-02-08 00:13:48,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112562075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:48,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:48,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:13:48,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291461975] [2025-02-08 00:13:48,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:48,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:13:48,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:48,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:13:48,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:48,580 INFO L87 Difference]: Start difference. First operand 360 states and 536 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-08 00:13:48,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:48,769 INFO L93 Difference]: Finished difference Result 681 states and 1014 transitions. [2025-02-08 00:13:48,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:13:48,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2025-02-08 00:13:48,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:48,771 INFO L225 Difference]: With dead ends: 681 [2025-02-08 00:13:48,773 INFO L226 Difference]: Without dead ends: 362 [2025-02-08 00:13:48,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:48,776 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 0 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:48,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1324 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:13:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-02-08 00:13:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-02-08 00:13:48,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.4903047091412742) internal successors, (538), 361 states have internal predecessors, (538), 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-08 00:13:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 538 transitions. [2025-02-08 00:13:48,794 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 538 transitions. Word has length 51 [2025-02-08 00:13:48,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:48,794 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 538 transitions. [2025-02-08 00:13:48,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-08 00:13:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 538 transitions. [2025-02-08 00:13:48,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 00:13:48,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:48,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:13:48,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:13:48,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:48,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:48,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1690544815, now seen corresponding path program 1 times [2025-02-08 00:13:48,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:48,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930900790] [2025-02-08 00:13:48,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:48,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:48,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 00:13:48,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 00:13:48,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:48,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:49,119 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-08 00:13:49,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:49,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930900790] [2025-02-08 00:13:49,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930900790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:49,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:49,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:13:49,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725479106] [2025-02-08 00:13:49,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:49,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:13:49,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:49,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:13:49,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:49,121 INFO L87 Difference]: Start difference. First operand 362 states and 538 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-08 00:13:49,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:49,289 INFO L93 Difference]: Finished difference Result 685 states and 1018 transitions. [2025-02-08 00:13:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:13:49,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2025-02-08 00:13:49,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:49,291 INFO L225 Difference]: With dead ends: 685 [2025-02-08 00:13:49,292 INFO L226 Difference]: Without dead ends: 364 [2025-02-08 00:13:49,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:13:49,293 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 0 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:49,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1324 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:13:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-02-08 00:13:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2025-02-08 00:13:49,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 1.487603305785124) internal successors, (540), 363 states have internal predecessors, (540), 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-08 00:13:49,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 540 transitions. [2025-02-08 00:13:49,304 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 540 transitions. Word has length 52 [2025-02-08 00:13:49,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:49,304 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 540 transitions. [2025-02-08 00:13:49,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-08 00:13:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 540 transitions. [2025-02-08 00:13:49,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 00:13:49,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:49,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:13:49,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:13:49,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:49,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:49,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1021081245, now seen corresponding path program 1 times [2025-02-08 00:13:49,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:49,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764560658] [2025-02-08 00:13:49,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:49,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:49,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 00:13:49,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 00:13:49,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:49,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:49,473 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-08 00:13:49,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:49,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764560658] [2025-02-08 00:13:49,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764560658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:49,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:49,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:13:49,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122690171] [2025-02-08 00:13:49,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:49,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:13:49,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:49,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:13:49,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:49,475 INFO L87 Difference]: Start difference. First operand 364 states and 540 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-08 00:13:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:49,664 INFO L93 Difference]: Finished difference Result 717 states and 1064 transitions. [2025-02-08 00:13:49,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:13:49,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2025-02-08 00:13:49,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:49,666 INFO L225 Difference]: With dead ends: 717 [2025-02-08 00:13:49,666 INFO L226 Difference]: Without dead ends: 394 [2025-02-08 00:13:49,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:13:49,667 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 28 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:49,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1762 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:13:49,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-02-08 00:13:49,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-02-08 00:13:49,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 1.4860050890585241) internal successors, (584), 393 states have internal predecessors, (584), 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-08 00:13:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 584 transitions. [2025-02-08 00:13:49,674 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 584 transitions. Word has length 53 [2025-02-08 00:13:49,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:49,674 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 584 transitions. [2025-02-08 00:13:49,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-08 00:13:49,674 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 584 transitions. [2025-02-08 00:13:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 00:13:49,675 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:49,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:13:49,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:13:49,675 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:49,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:49,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1653223337, now seen corresponding path program 1 times [2025-02-08 00:13:49,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:49,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536187555] [2025-02-08 00:13:49,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:49,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:49,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 00:13:49,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 00:13:49,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:49,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:50,070 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-08 00:13:50,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:50,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536187555] [2025-02-08 00:13:50,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536187555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:50,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:50,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:13:50,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928045506] [2025-02-08 00:13:50,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:50,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:13:50,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:50,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:13:50,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:13:50,072 INFO L87 Difference]: Start difference. First operand 394 states and 584 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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-08 00:13:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:50,343 INFO L93 Difference]: Finished difference Result 753 states and 1116 transitions. [2025-02-08 00:13:50,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:13:50,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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 54 [2025-02-08 00:13:50,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:50,345 INFO L225 Difference]: With dead ends: 753 [2025-02-08 00:13:50,345 INFO L226 Difference]: Without dead ends: 400 [2025-02-08 00:13:50,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:13:50,346 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 523 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:50,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 2200 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:13:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-02-08 00:13:50,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-02-08 00:13:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 1.4837092731829573) internal successors, (592), 399 states have internal predecessors, (592), 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-08 00:13:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 592 transitions. [2025-02-08 00:13:50,357 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 592 transitions. Word has length 54 [2025-02-08 00:13:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:50,357 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 592 transitions. [2025-02-08 00:13:50,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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-08 00:13:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 592 transitions. [2025-02-08 00:13:50,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 00:13:50,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:50,361 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:13:50,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:13:50,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:50,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:50,361 INFO L85 PathProgramCache]: Analyzing trace with hash 785055271, now seen corresponding path program 1 times [2025-02-08 00:13:50,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:50,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111771362] [2025-02-08 00:13:50,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:50,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:50,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 00:13:50,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 00:13:50,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:50,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:50,674 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-08 00:13:50,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:50,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111771362] [2025-02-08 00:13:50,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111771362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:50,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:50,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:13:50,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356982213] [2025-02-08 00:13:50,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:50,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:13:50,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:50,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:13:50,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:13:50,680 INFO L87 Difference]: Start difference. First operand 400 states and 592 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 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-08 00:13:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:51,363 INFO L93 Difference]: Finished difference Result 1056 states and 1563 transitions. [2025-02-08 00:13:51,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:13:51,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 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 55 [2025-02-08 00:13:51,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:51,366 INFO L225 Difference]: With dead ends: 1056 [2025-02-08 00:13:51,366 INFO L226 Difference]: Without dead ends: 697 [2025-02-08 00:13:51,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:13:51,367 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 1410 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1410 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:51,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1410 Valid, 947 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:13:51,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-02-08 00:13:51,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 402. [2025-02-08 00:13:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 1.4812967581047383) internal successors, (594), 401 states have internal predecessors, (594), 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-08 00:13:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 594 transitions. [2025-02-08 00:13:51,376 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 594 transitions. Word has length 55 [2025-02-08 00:13:51,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:51,376 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 594 transitions. [2025-02-08 00:13:51,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 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-08 00:13:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 594 transitions. [2025-02-08 00:13:51,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-08 00:13:51,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:51,381 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:13:51,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:13:51,381 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:51,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:51,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1442101131, now seen corresponding path program 1 times [2025-02-08 00:13:51,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:51,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440795298] [2025-02-08 00:13:51,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:51,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:51,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-08 00:13:51,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-08 00:13:51,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:51,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:52,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:52,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440795298] [2025-02-08 00:13:52,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440795298] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:13:52,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881347420] [2025-02-08 00:13:52,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:52,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:13:52,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:13:52,093 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-08 00:13:52,095 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-08 00:13:52,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-08 00:13:52,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-08 00:13:52,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:52,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:52,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 1431 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 00:13:52,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:13:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:52,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:13:53,092 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:53,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881347420] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:13:53,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:13:53,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 00:13:53,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665902627] [2025-02-08 00:13:53,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:13:53,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 00:13:53,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:53,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 00:13:53,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:13:53,094 INFO L87 Difference]: Start difference. First operand 402 states and 594 transitions. Second operand has 11 states, 11 states have (on average 49.81818181818182) internal successors, (548), 10 states have internal predecessors, (548), 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-08 00:13:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:53,740 INFO L93 Difference]: Finished difference Result 1518 states and 2250 transitions. [2025-02-08 00:13:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 00:13:53,741 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 49.81818181818182) internal successors, (548), 10 states have internal predecessors, (548), 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 214 [2025-02-08 00:13:53,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:53,744 INFO L225 Difference]: With dead ends: 1518 [2025-02-08 00:13:53,744 INFO L226 Difference]: Without dead ends: 700 [2025-02-08 00:13:53,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-02-08 00:13:53,745 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 4486 mSDsluCounter, 2009 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4486 SdHoareTripleChecker+Valid, 2458 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:53,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4486 Valid, 2458 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:13:53,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-02-08 00:13:53,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 698. [2025-02-08 00:13:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.4791965566714491) internal successors, (1031), 697 states have internal predecessors, (1031), 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-08 00:13:53,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1031 transitions. [2025-02-08 00:13:53,766 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1031 transitions. Word has length 214 [2025-02-08 00:13:53,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:53,767 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1031 transitions. [2025-02-08 00:13:53,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.81818181818182) internal successors, (548), 10 states have internal predecessors, (548), 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-08 00:13:53,767 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1031 transitions. [2025-02-08 00:13:53,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-08 00:13:53,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:53,768 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:13:53,779 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-08 00:13:53,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:13:53,969 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:53,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:53,970 INFO L85 PathProgramCache]: Analyzing trace with hash 725373914, now seen corresponding path program 1 times [2025-02-08 00:13:53,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:53,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519333656] [2025-02-08 00:13:53,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:53,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:54,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 00:13:54,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 00:13:54,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:54,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:55,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:55,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519333656] [2025-02-08 00:13:55,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519333656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:55,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:13:55,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:13:55,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524462139] [2025-02-08 00:13:55,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:55,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:13:55,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:55,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:13:55,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:13:55,149 INFO L87 Difference]: Start difference. First operand 698 states and 1031 transitions. Second operand has 8 states, 8 states have (on average 27.0) internal successors, (216), 7 states have internal predecessors, (216), 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-08 00:13:56,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:56,085 INFO L93 Difference]: Finished difference Result 1403 states and 2074 transitions. [2025-02-08 00:13:56,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:13:56,086 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.0) internal successors, (216), 7 states have internal predecessors, (216), 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 216 [2025-02-08 00:13:56,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:56,089 INFO L225 Difference]: With dead ends: 1403 [2025-02-08 00:13:56,091 INFO L226 Difference]: Without dead ends: 1044 [2025-02-08 00:13:56,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:13:56,093 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 1088 mSDsluCounter, 2229 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 2820 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:56,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 2820 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1807 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 00:13:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2025-02-08 00:13:56,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 702. [2025-02-08 00:13:56,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 701 states have (on average 1.4764621968616263) internal successors, (1035), 701 states have internal predecessors, (1035), 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-08 00:13:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1035 transitions. [2025-02-08 00:13:56,108 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1035 transitions. Word has length 216 [2025-02-08 00:13:56,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:56,109 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1035 transitions. [2025-02-08 00:13:56,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.0) internal successors, (216), 7 states have internal predecessors, (216), 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-08 00:13:56,109 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1035 transitions. [2025-02-08 00:13:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-08 00:13:56,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:56,111 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:13:56,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:13:56,112 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:56,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:56,112 INFO L85 PathProgramCache]: Analyzing trace with hash 177576917, now seen corresponding path program 1 times [2025-02-08 00:13:56,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:56,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195913383] [2025-02-08 00:13:56,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:56,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:56,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-08 00:13:56,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-08 00:13:56,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:56,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 00:13:57,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:57,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195913383] [2025-02-08 00:13:57,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195913383] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:13:57,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377420763] [2025-02-08 00:13:57,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:57,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:13:57,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:13:57,345 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-08 00:13:57,347 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-08 00:13:57,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-08 00:13:57,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-08 00:13:57,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:57,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:57,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 1438 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-08 00:13:57,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:13:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:13:57,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:13:57,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377420763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:13:57,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 00:13:57,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-02-08 00:13:57,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195325701] [2025-02-08 00:13:57,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:13:57,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:13:57,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:13:57,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:13:57,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:13:57,950 INFO L87 Difference]: Start difference. First operand 702 states and 1035 transitions. Second operand has 5 states, 5 states have (on average 43.4) internal successors, (217), 4 states have internal predecessors, (217), 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-08 00:13:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:13:58,327 INFO L93 Difference]: Finished difference Result 1315 states and 1944 transitions. [2025-02-08 00:13:58,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:13:58,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 4 states have internal predecessors, (217), 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 217 [2025-02-08 00:13:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:13:58,330 INFO L225 Difference]: With dead ends: 1315 [2025-02-08 00:13:58,330 INFO L226 Difference]: Without dead ends: 702 [2025-02-08 00:13:58,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:13:58,331 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 611 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:13:58,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 947 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:13:58,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-02-08 00:13:58,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2025-02-08 00:13:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 701 states have (on average 1.4750356633380886) internal successors, (1034), 701 states have internal predecessors, (1034), 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-08 00:13:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1034 transitions. [2025-02-08 00:13:58,343 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1034 transitions. Word has length 217 [2025-02-08 00:13:58,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:13:58,344 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1034 transitions. [2025-02-08 00:13:58,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 4 states have internal predecessors, (217), 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-08 00:13:58,344 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1034 transitions. [2025-02-08 00:13:58,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-08 00:13:58,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:13:58,349 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:13:58,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 00:13:58,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:13:58,550 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:13:58,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:13:58,551 INFO L85 PathProgramCache]: Analyzing trace with hash -344889435, now seen corresponding path program 1 times [2025-02-08 00:13:58,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:13:58,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010478212] [2025-02-08 00:13:58,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:58,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:13:58,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-08 00:13:58,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-08 00:13:58,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:58,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:13:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 00:13:59,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:13:59,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010478212] [2025-02-08 00:13:59,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010478212] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:13:59,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103201938] [2025-02-08 00:13:59,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:13:59,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:13:59,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:13:59,465 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-08 00:13:59,467 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-08 00:13:59,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-08 00:13:59,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-08 00:13:59,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:13:59,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:00,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 00:14:00,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:14:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:00,793 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:14:00,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103201938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:00,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 00:14:00,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-02-08 00:14:00,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011944445] [2025-02-08 00:14:00,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:00,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:14:00,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:00,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:14:00,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:14:00,796 INFO L87 Difference]: Start difference. First operand 702 states and 1034 transitions. Second operand has 5 states, 5 states have (on average 43.6) internal successors, (218), 4 states have internal predecessors, (218), 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-08 00:14:01,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:01,308 INFO L93 Difference]: Finished difference Result 1067 states and 1572 transitions. [2025-02-08 00:14:01,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:14:01,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 4 states have internal predecessors, (218), 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 218 [2025-02-08 00:14:01,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:01,310 INFO L225 Difference]: With dead ends: 1067 [2025-02-08 00:14:01,310 INFO L226 Difference]: Without dead ends: 704 [2025-02-08 00:14:01,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:14:01,311 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 1235 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:01,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 934 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:14:01,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-02-08 00:14:01,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 703. [2025-02-08 00:14:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 702 states have (on average 1.4743589743589745) internal successors, (1035), 702 states have internal predecessors, (1035), 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-08 00:14:01,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1035 transitions. [2025-02-08 00:14:01,322 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1035 transitions. Word has length 218 [2025-02-08 00:14:01,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:01,322 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 1035 transitions. [2025-02-08 00:14:01,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 4 states have internal predecessors, (218), 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-08 00:14:01,322 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1035 transitions. [2025-02-08 00:14:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-08 00:14:01,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:01,324 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:01,334 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-08 00:14:01,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:14:01,525 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:01,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:01,525 INFO L85 PathProgramCache]: Analyzing trace with hash 609219749, now seen corresponding path program 1 times [2025-02-08 00:14:01,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:01,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582063827] [2025-02-08 00:14:01,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:01,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:01,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-08 00:14:01,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-08 00:14:01,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:01,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:02,420 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 00:14:02,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:02,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582063827] [2025-02-08 00:14:02,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582063827] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:14:02,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222147884] [2025-02-08 00:14:02,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:02,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:14:02,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:14:02,425 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-08 00:14:02,448 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-08 00:14:02,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-08 00:14:02,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-08 00:14:02,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:02,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:02,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-08 00:14:02,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:14:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:03,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:14:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:04,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222147884] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:14:04,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:14:04,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 9] total 21 [2025-02-08 00:14:04,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836304470] [2025-02-08 00:14:04,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:14:04,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 00:14:04,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:04,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 00:14:04,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-02-08 00:14:04,663 INFO L87 Difference]: Start difference. First operand 703 states and 1035 transitions. Second operand has 22 states, 22 states have (on average 28.863636363636363) internal successors, (635), 21 states have internal predecessors, (635), 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-08 00:14:06,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:06,018 INFO L93 Difference]: Finished difference Result 1351 states and 1987 transitions. [2025-02-08 00:14:06,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 00:14:06,019 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 28.863636363636363) internal successors, (635), 21 states have internal predecessors, (635), 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 219 [2025-02-08 00:14:06,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:06,021 INFO L225 Difference]: With dead ends: 1351 [2025-02-08 00:14:06,021 INFO L226 Difference]: Without dead ends: 724 [2025-02-08 00:14:06,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2025-02-08 00:14:06,022 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 1937 mSDsluCounter, 3511 mSDsCounter, 0 mSdLazyCounter, 2846 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1937 SdHoareTripleChecker+Valid, 3820 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:06,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1937 Valid, 3820 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2846 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 00:14:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-02-08 00:14:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 712. [2025-02-08 00:14:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 711 states have (on average 1.4725738396624473) internal successors, (1047), 711 states have internal predecessors, (1047), 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-08 00:14:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1047 transitions. [2025-02-08 00:14:06,032 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1047 transitions. Word has length 219 [2025-02-08 00:14:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:06,033 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 1047 transitions. [2025-02-08 00:14:06,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 28.863636363636363) internal successors, (635), 21 states have internal predecessors, (635), 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-08 00:14:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1047 transitions. [2025-02-08 00:14:06,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-08 00:14:06,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:06,034 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:06,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 00:14:06,239 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,SelfDestructingSolverStorable10 [2025-02-08 00:14:06,239 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:06,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:06,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1692562941, now seen corresponding path program 1 times [2025-02-08 00:14:06,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:06,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375570673] [2025-02-08 00:14:06,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:06,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:06,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-08 00:14:06,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-08 00:14:06,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:06,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:06,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:06,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375570673] [2025-02-08 00:14:06,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375570673] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:14:06,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056014786] [2025-02-08 00:14:06,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:06,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:14:06,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:14:06,758 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-08 00:14:06,761 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-08 00:14:07,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-08 00:14:07,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-08 00:14:07,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:07,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:07,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 00:14:07,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:14:07,777 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:07,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:14:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:08,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056014786] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:14:08,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:14:08,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2025-02-08 00:14:08,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681586717] [2025-02-08 00:14:08,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:14:08,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 00:14:08,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:08,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 00:14:08,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-02-08 00:14:08,165 INFO L87 Difference]: Start difference. First operand 712 states and 1047 transitions. Second operand has 20 states, 20 states have (on average 30.15) internal successors, (603), 19 states have internal predecessors, (603), 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-08 00:14:09,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:09,276 INFO L93 Difference]: Finished difference Result 1437 states and 2106 transitions. [2025-02-08 00:14:09,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 00:14:09,277 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 30.15) internal successors, (603), 19 states have internal predecessors, (603), 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 221 [2025-02-08 00:14:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:09,279 INFO L225 Difference]: With dead ends: 1437 [2025-02-08 00:14:09,279 INFO L226 Difference]: Without dead ends: 770 [2025-02-08 00:14:09,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2025-02-08 00:14:09,281 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 3214 mSDsluCounter, 2795 mSDsCounter, 0 mSdLazyCounter, 2230 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3214 SdHoareTripleChecker+Valid, 3106 SdHoareTripleChecker+Invalid, 2236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:09,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3214 Valid, 3106 Invalid, 2236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2230 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 00:14:09,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-02-08 00:14:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 726. [2025-02-08 00:14:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 1.466206896551724) internal successors, (1063), 725 states have internal predecessors, (1063), 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-08 00:14:09,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1063 transitions. [2025-02-08 00:14:09,289 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1063 transitions. Word has length 221 [2025-02-08 00:14:09,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:09,290 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1063 transitions. [2025-02-08 00:14:09,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 30.15) internal successors, (603), 19 states have internal predecessors, (603), 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-08 00:14:09,290 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1063 transitions. [2025-02-08 00:14:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-02-08 00:14:09,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:09,293 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:09,303 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-08 00:14:09,493 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,SelfDestructingSolverStorable11 [2025-02-08 00:14:09,493 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:09,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:09,494 INFO L85 PathProgramCache]: Analyzing trace with hash -945175247, now seen corresponding path program 1 times [2025-02-08 00:14:09,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:09,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164865762] [2025-02-08 00:14:09,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:09,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:09,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-02-08 00:14:09,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-02-08 00:14:09,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:09,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:10,852 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-02-08 00:14:10,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:10,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164865762] [2025-02-08 00:14:10,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164865762] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:14:10,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627261983] [2025-02-08 00:14:10,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:10,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:14:10,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:14:10,859 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-08 00:14:10,860 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-08 00:14:11,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-02-08 00:14:11,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-02-08 00:14:11,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:11,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:11,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 2478 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 00:14:11,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:14:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 185 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:12,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:14:12,875 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 185 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:12,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627261983] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:14:12,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:14:12,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-02-08 00:14:12,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154329039] [2025-02-08 00:14:12,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:14:12,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 00:14:12,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:12,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 00:14:12,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2025-02-08 00:14:12,878 INFO L87 Difference]: Start difference. First operand 726 states and 1063 transitions. Second operand has 20 states, 20 states have (on average 39.9) internal successors, (798), 19 states have internal predecessors, (798), 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-08 00:14:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:14,170 INFO L93 Difference]: Finished difference Result 1475 states and 2160 transitions. [2025-02-08 00:14:14,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 00:14:14,171 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 39.9) internal successors, (798), 19 states have internal predecessors, (798), 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 381 [2025-02-08 00:14:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:14,174 INFO L225 Difference]: With dead ends: 1475 [2025-02-08 00:14:14,174 INFO L226 Difference]: Without dead ends: 815 [2025-02-08 00:14:14,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=1609, Unknown=0, NotChecked=0, Total=1892 [2025-02-08 00:14:14,175 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 3642 mSDsluCounter, 3667 mSDsCounter, 0 mSdLazyCounter, 2372 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3642 SdHoareTripleChecker+Valid, 4032 SdHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:14,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3642 Valid, 4032 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2372 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 00:14:14,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2025-02-08 00:14:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 805. [2025-02-08 00:14:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 804 states have (on average 1.4539800995024876) internal successors, (1169), 804 states have internal predecessors, (1169), 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-08 00:14:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1169 transitions. [2025-02-08 00:14:14,187 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1169 transitions. Word has length 381 [2025-02-08 00:14:14,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:14,187 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1169 transitions. [2025-02-08 00:14:14,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 39.9) internal successors, (798), 19 states have internal predecessors, (798), 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-08 00:14:14,187 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1169 transitions. [2025-02-08 00:14:14,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-02-08 00:14:14,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:14,191 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:14,204 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-08 00:14:14,392 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,SelfDestructingSolverStorable12 [2025-02-08 00:14:14,392 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:14,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:14,394 INFO L85 PathProgramCache]: Analyzing trace with hash -953026886, now seen corresponding path program 1 times [2025-02-08 00:14:14,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:14,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449474927] [2025-02-08 00:14:14,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:14,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:14,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-02-08 00:14:15,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-02-08 00:14:15,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:15,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 00:14:16,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:16,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449474927] [2025-02-08 00:14:16,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449474927] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:16,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:14:16,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:14:16,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838774500] [2025-02-08 00:14:16,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:16,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:14:16,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:16,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:14:16,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:14:16,108 INFO L87 Difference]: Start difference. First operand 805 states and 1169 transitions. Second operand has 8 states, 8 states have (on average 45.375) internal successors, (363), 7 states have internal predecessors, (363), 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-08 00:14:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:16,836 INFO L93 Difference]: Finished difference Result 1677 states and 2433 transitions. [2025-02-08 00:14:16,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:14:16,836 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 45.375) internal successors, (363), 7 states have internal predecessors, (363), 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 382 [2025-02-08 00:14:16,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:16,840 INFO L225 Difference]: With dead ends: 1677 [2025-02-08 00:14:16,840 INFO L226 Difference]: Without dead ends: 1236 [2025-02-08 00:14:16,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:14:16,841 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 1063 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:16,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 2876 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1859 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:14:16,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2025-02-08 00:14:16,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 805. [2025-02-08 00:14:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 804 states have (on average 1.4539800995024876) internal successors, (1169), 804 states have internal predecessors, (1169), 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-08 00:14:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1169 transitions. [2025-02-08 00:14:16,851 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1169 transitions. Word has length 382 [2025-02-08 00:14:16,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:16,852 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1169 transitions. [2025-02-08 00:14:16,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.375) internal successors, (363), 7 states have internal predecessors, (363), 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-08 00:14:16,852 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1169 transitions. [2025-02-08 00:14:16,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-02-08 00:14:16,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:16,854 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:16,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 00:14:16,854 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:16,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:16,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1502280975, now seen corresponding path program 1 times [2025-02-08 00:14:16,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:16,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501638851] [2025-02-08 00:14:16,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:16,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:16,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-02-08 00:14:17,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-02-08 00:14:17,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:17,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2025-02-08 00:14:18,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:18,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501638851] [2025-02-08 00:14:18,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501638851] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:14:18,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989094655] [2025-02-08 00:14:18,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:18,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:14:18,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:14:18,515 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-08 00:14:18,517 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-08 00:14:18,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-02-08 00:14:19,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-02-08 00:14:19,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:19,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:19,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 2482 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-02-08 00:14:19,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:14:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 19 proven. 169 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 00:14:21,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:14:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 9 proven. 43 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-02-08 00:14:23,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989094655] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:14:23,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:14:23,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 12] total 33 [2025-02-08 00:14:23,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849169835] [2025-02-08 00:14:23,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:14:23,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-08 00:14:23,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:23,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-08 00:14:23,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 00:14:23,299 INFO L87 Difference]: Start difference. First operand 805 states and 1169 transitions. Second operand has 34 states, 34 states have (on average 23.470588235294116) internal successors, (798), 33 states have internal predecessors, (798), 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-08 00:14:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:25,934 INFO L93 Difference]: Finished difference Result 1594 states and 2311 transitions. [2025-02-08 00:14:25,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 00:14:25,934 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 23.470588235294116) internal successors, (798), 33 states have internal predecessors, (798), 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 383 [2025-02-08 00:14:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:25,938 INFO L225 Difference]: With dead ends: 1594 [2025-02-08 00:14:25,938 INFO L226 Difference]: Without dead ends: 875 [2025-02-08 00:14:25,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 739 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=1856, Unknown=0, NotChecked=0, Total=2162 [2025-02-08 00:14:25,944 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 1208 mSDsluCounter, 5258 mSDsCounter, 0 mSdLazyCounter, 5948 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 5547 SdHoareTripleChecker+Invalid, 5955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 5948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:25,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 5547 Invalid, 5955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 5948 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-08 00:14:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-02-08 00:14:25,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 805. [2025-02-08 00:14:25,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 804 states have (on average 1.4539800995024876) internal successors, (1169), 804 states have internal predecessors, (1169), 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-08 00:14:25,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1169 transitions. [2025-02-08 00:14:25,971 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1169 transitions. Word has length 383 [2025-02-08 00:14:25,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:25,972 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1169 transitions. [2025-02-08 00:14:25,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 23.470588235294116) internal successors, (798), 33 states have internal predecessors, (798), 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-08 00:14:25,972 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1169 transitions. [2025-02-08 00:14:25,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-02-08 00:14:25,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:25,979 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:25,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 00:14:26,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:14:26,180 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:26,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:26,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1993679858, now seen corresponding path program 1 times [2025-02-08 00:14:26,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:26,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987709873] [2025-02-08 00:14:26,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:26,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:26,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-02-08 00:14:26,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-02-08 00:14:26,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:26,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 81 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:27,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:27,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987709873] [2025-02-08 00:14:27,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987709873] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:14:27,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827274604] [2025-02-08 00:14:27,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:27,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:14:27,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:14:27,804 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-08 00:14:27,806 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-08 00:14:28,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-02-08 00:14:29,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-02-08 00:14:29,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:29,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:29,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 2483 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-02-08 00:14:29,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:14:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 187 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:30,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:14:31,870 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 150 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:31,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827274604] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:14:31,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:14:31,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 13] total 26 [2025-02-08 00:14:31,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58285826] [2025-02-08 00:14:31,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:14:31,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 00:14:31,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:31,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 00:14:31,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2025-02-08 00:14:31,873 INFO L87 Difference]: Start difference. First operand 805 states and 1169 transitions. Second operand has 27 states, 27 states have (on average 41.407407407407405) internal successors, (1118), 26 states have internal predecessors, (1118), 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-08 00:14:35,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:35,421 INFO L93 Difference]: Finished difference Result 1884 states and 2724 transitions. [2025-02-08 00:14:35,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-08 00:14:35,421 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 41.407407407407405) internal successors, (1118), 26 states have internal predecessors, (1118), 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 384 [2025-02-08 00:14:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:35,425 INFO L225 Difference]: With dead ends: 1884 [2025-02-08 00:14:35,425 INFO L226 Difference]: Without dead ends: 1497 [2025-02-08 00:14:35,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 820 GetRequests, 752 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=570, Invalid=4260, Unknown=0, NotChecked=0, Total=4830 [2025-02-08 00:14:35,427 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 5900 mSDsluCounter, 8726 mSDsCounter, 0 mSdLazyCounter, 7121 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5900 SdHoareTripleChecker+Valid, 9327 SdHoareTripleChecker+Invalid, 7138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 7121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:35,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5900 Valid, 9327 Invalid, 7138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 7121 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-08 00:14:35,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2025-02-08 00:14:35,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1487. [2025-02-08 00:14:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 1486 states have (on average 1.440107671601615) internal successors, (2140), 1486 states have internal predecessors, (2140), 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-08 00:14:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2140 transitions. [2025-02-08 00:14:35,444 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 2140 transitions. Word has length 384 [2025-02-08 00:14:35,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:35,445 INFO L471 AbstractCegarLoop]: Abstraction has 1487 states and 2140 transitions. [2025-02-08 00:14:35,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 41.407407407407405) internal successors, (1118), 26 states have internal predecessors, (1118), 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-08 00:14:35,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2140 transitions. [2025-02-08 00:14:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-02-08 00:14:35,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:35,448 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:35,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 00:14:35,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 00:14:35,652 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:35,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:35,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1739625714, now seen corresponding path program 1 times [2025-02-08 00:14:35,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:35,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433240329] [2025-02-08 00:14:35,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:35,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:35,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-02-08 00:14:37,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-02-08 00:14:37,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:37,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 88 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:37,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:37,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433240329] [2025-02-08 00:14:37,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433240329] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:14:37,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003814198] [2025-02-08 00:14:37,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:37,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:14:37,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:14:37,925 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:14:37,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 00:14:38,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-02-08 00:14:39,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-02-08 00:14:39,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:39,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:39,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 00:14:39,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:14:39,726 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:14:39,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:14:39,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003814198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:39,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 00:14:39,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2025-02-08 00:14:39,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027638081] [2025-02-08 00:14:39,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:39,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:14:39,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:39,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:14:39,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:14:39,729 INFO L87 Difference]: Start difference. First operand 1487 states and 2140 transitions. Second operand has 6 states, 6 states have (on average 64.16666666666667) internal successors, (385), 6 states have internal predecessors, (385), 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-08 00:14:40,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:40,219 INFO L93 Difference]: Finished difference Result 2908 states and 4195 transitions. [2025-02-08 00:14:40,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:14:40,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 64.16666666666667) internal successors, (385), 6 states have internal predecessors, (385), 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 385 [2025-02-08 00:14:40,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:40,224 INFO L225 Difference]: With dead ends: 2908 [2025-02-08 00:14:40,224 INFO L226 Difference]: Without dead ends: 1898 [2025-02-08 00:14:40,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 384 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-08 00:14:40,225 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 679 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:40,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 1285 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:14:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2025-02-08 00:14:40,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2025-02-08 00:14:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1895 states have (on average 1.4406332453825859) internal successors, (2730), 1895 states have internal predecessors, (2730), 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-08 00:14:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2730 transitions. [2025-02-08 00:14:40,247 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2730 transitions. Word has length 385 [2025-02-08 00:14:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:40,247 INFO L471 AbstractCegarLoop]: Abstraction has 1896 states and 2730 transitions. [2025-02-08 00:14:40,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.16666666666667) internal successors, (385), 6 states have internal predecessors, (385), 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-08 00:14:40,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2730 transitions. [2025-02-08 00:14:40,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-02-08 00:14:40,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:40,251 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:40,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 00:14:40,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:14:40,452 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:40,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:40,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1114350863, now seen corresponding path program 1 times [2025-02-08 00:14:40,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:40,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407620131] [2025-02-08 00:14:40,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:40,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:40,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-02-08 00:14:42,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-02-08 00:14:42,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:42,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:45,410 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 145 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-08 00:14:45,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:45,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407620131] [2025-02-08 00:14:45,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407620131] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:14:45,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007135688] [2025-02-08 00:14:45,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:45,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:14:45,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:14:45,413 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:14:45,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 00:14:45,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-02-08 00:14:46,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-02-08 00:14:46,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:46,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:46,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 00:14:46,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:14:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-02-08 00:14:47,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:14:47,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007135688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:47,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 00:14:47,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 24 [2025-02-08 00:14:47,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469462674] [2025-02-08 00:14:47,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:47,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:14:47,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:47,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:14:47,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2025-02-08 00:14:47,019 INFO L87 Difference]: Start difference. First operand 1896 states and 2730 transitions. Second operand has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 8 states have internal predecessors, (241), 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-08 00:14:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:47,511 INFO L93 Difference]: Finished difference Result 4194 states and 6074 transitions. [2025-02-08 00:14:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:14:47,511 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 8 states have internal predecessors, (241), 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 386 [2025-02-08 00:14:47,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:47,517 INFO L225 Difference]: With dead ends: 4194 [2025-02-08 00:14:47,517 INFO L226 Difference]: Without dead ends: 2408 [2025-02-08 00:14:47,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 379 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2025-02-08 00:14:47,519 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 704 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:47,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1673 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:14:47,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2025-02-08 00:14:47,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 1916. [2025-02-08 00:14:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1916 states, 1915 states have (on average 1.4381201044386422) internal successors, (2754), 1915 states have internal predecessors, (2754), 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-08 00:14:47,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2754 transitions. [2025-02-08 00:14:47,539 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2754 transitions. Word has length 386 [2025-02-08 00:14:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:47,539 INFO L471 AbstractCegarLoop]: Abstraction has 1916 states and 2754 transitions. [2025-02-08 00:14:47,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 8 states have internal predecessors, (241), 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-08 00:14:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2754 transitions. [2025-02-08 00:14:47,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-02-08 00:14:47,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:47,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:47,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 00:14:47,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 00:14:47,743 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:47,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:47,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2083552977, now seen corresponding path program 1 times [2025-02-08 00:14:47,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:47,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662874248] [2025-02-08 00:14:47,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:47,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:47,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-08 00:14:50,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-08 00:14:50,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:50,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 145 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-02-08 00:14:52,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:52,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662874248] [2025-02-08 00:14:52,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662874248] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:14:52,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140474121] [2025-02-08 00:14:52,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:52,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:14:52,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:14:52,477 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:14:52,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 00:14:53,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-08 00:14:53,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-08 00:14:53,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:53,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:53,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 2491 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-02-08 00:14:53,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:14:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-02-08 00:14:54,119 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:14:54,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140474121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:14:54,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 00:14:54,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2025-02-08 00:14:54,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043110565] [2025-02-08 00:14:54,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:14:54,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:14:54,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:14:54,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:14:54,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-02-08 00:14:54,121 INFO L87 Difference]: Start difference. First operand 1916 states and 2754 transitions. Second operand has 8 states, 8 states have (on average 34.125) internal successors, (273), 7 states have internal predecessors, (273), 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-08 00:14:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:14:54,674 INFO L93 Difference]: Finished difference Result 4169 states and 6026 transitions. [2025-02-08 00:14:54,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:14:54,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.125) internal successors, (273), 7 states have internal predecessors, (273), 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 388 [2025-02-08 00:14:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:14:54,679 INFO L225 Difference]: With dead ends: 4169 [2025-02-08 00:14:54,679 INFO L226 Difference]: Without dead ends: 2428 [2025-02-08 00:14:54,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 382 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-02-08 00:14:54,681 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 726 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:14:54,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1672 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:14:54,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2025-02-08 00:14:54,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2176. [2025-02-08 00:14:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 2175 states have (on average 1.4427586206896552) internal successors, (3138), 2175 states have internal predecessors, (3138), 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-08 00:14:54,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3138 transitions. [2025-02-08 00:14:54,706 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3138 transitions. Word has length 388 [2025-02-08 00:14:54,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:14:54,706 INFO L471 AbstractCegarLoop]: Abstraction has 2176 states and 3138 transitions. [2025-02-08 00:14:54,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.125) internal successors, (273), 7 states have internal predecessors, (273), 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-08 00:14:54,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3138 transitions. [2025-02-08 00:14:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-02-08 00:14:54,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:14:54,710 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:14:54,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 00:14:54,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:14:54,914 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:14:54,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:14:54,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1158864411, now seen corresponding path program 1 times [2025-02-08 00:14:54,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:14:54,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351892989] [2025-02-08 00:14:54,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:54,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:14:54,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-08 00:14:56,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-08 00:14:56,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:56,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 145 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-02-08 00:14:58,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:14:58,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351892989] [2025-02-08 00:14:58,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351892989] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:14:58,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215255577] [2025-02-08 00:14:58,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:14:58,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:14:58,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:14:58,212 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:14:58,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 00:14:58,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-08 00:14:59,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-08 00:14:59,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:14:59,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:14:59,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 2491 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-02-08 00:14:59,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:15:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 128 proven. 57 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-08 00:15:01,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:15:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 167 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-08 00:15:03,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215255577] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:15:03,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:15:03,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 41 [2025-02-08 00:15:03,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30584227] [2025-02-08 00:15:03,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:15:03,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-08 00:15:03,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:03,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-08 00:15:03,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1520, Unknown=0, NotChecked=0, Total=1722 [2025-02-08 00:15:03,163 INFO L87 Difference]: Start difference. First operand 2176 states and 3138 transitions. Second operand has 42 states, 42 states have (on average 24.0) internal successors, (1008), 41 states have internal predecessors, (1008), 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-08 00:15:09,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:15:09,065 INFO L93 Difference]: Finished difference Result 9026 states and 12866 transitions. [2025-02-08 00:15:09,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-02-08 00:15:09,066 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 24.0) internal successors, (1008), 41 states have internal predecessors, (1008), 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 388 [2025-02-08 00:15:09,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:15:09,089 INFO L225 Difference]: With dead ends: 9026 [2025-02-08 00:15:09,089 INFO L226 Difference]: Without dead ends: 6924 [2025-02-08 00:15:09,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 747 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1904 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1097, Invalid=7833, Unknown=0, NotChecked=0, Total=8930 [2025-02-08 00:15:09,093 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 4463 mSDsluCounter, 9649 mSDsCounter, 0 mSdLazyCounter, 10029 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4463 SdHoareTripleChecker+Valid, 10021 SdHoareTripleChecker+Invalid, 10043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 10029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:15:09,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4463 Valid, 10021 Invalid, 10043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 10029 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-02-08 00:15:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6924 states. [2025-02-08 00:15:09,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6924 to 4120. [2025-02-08 00:15:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4120 states, 4119 states have (on average 1.4396698227725175) internal successors, (5930), 4119 states have internal predecessors, (5930), 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-08 00:15:09,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4120 states to 4120 states and 5930 transitions. [2025-02-08 00:15:09,144 INFO L78 Accepts]: Start accepts. Automaton has 4120 states and 5930 transitions. Word has length 388 [2025-02-08 00:15:09,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:15:09,145 INFO L471 AbstractCegarLoop]: Abstraction has 4120 states and 5930 transitions. [2025-02-08 00:15:09,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 24.0) internal successors, (1008), 41 states have internal predecessors, (1008), 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-08 00:15:09,145 INFO L276 IsEmpty]: Start isEmpty. Operand 4120 states and 5930 transitions. [2025-02-08 00:15:09,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-02-08 00:15:09,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:15:09,150 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:15:09,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 00:15:09,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:15:09,355 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:15:09,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:15:09,355 INFO L85 PathProgramCache]: Analyzing trace with hash 802990422, now seen corresponding path program 1 times [2025-02-08 00:15:09,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:15:09,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510674747] [2025-02-08 00:15:09,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:09,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:15:09,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-08 00:15:09,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-08 00:15:09,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:09,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:10,671 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-02-08 00:15:10,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:15:10,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510674747] [2025-02-08 00:15:10,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510674747] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:15:10,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729434865] [2025-02-08 00:15:10,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:15:10,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:15:10,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:15:10,676 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:15:10,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 00:15:11,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-08 00:15:11,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-08 00:15:11,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:15:11,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:15:11,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 2493 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-08 00:15:11,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:15:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 25 proven. 51 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-08 00:15:12,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:15:12,674 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 62 proven. 14 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-08 00:15:12,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729434865] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:15:12,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:15:12,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 17 [2025-02-08 00:15:12,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974972378] [2025-02-08 00:15:12,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:15:12,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 00:15:12,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:15:12,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 00:15:12,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-02-08 00:15:12,676 INFO L87 Difference]: Start difference. First operand 4120 states and 5930 transitions. Second operand has 18 states, 18 states have (on average 28.055555555555557) internal successors, (505), 17 states have internal predecessors, (505), 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)