./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:27:09,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:27:09,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 17:27:09,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:27:09,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:27:09,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:27:09,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:27:09,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:27:09,822 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:27:09,822 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:27:09,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:27:09,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:27:09,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:27:09,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:27:09,822 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:27:09,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:27:09,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:27:09,823 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:27:09,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:27:09,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:27:09,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:27:09,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:27:09,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:27:09,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:27:09,823 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:27:09,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:27:09,823 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:27:09,823 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:27:09,823 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:27:09,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:27:09,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:27:09,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:27:09,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:27:09,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:27:09,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:27:09,823 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:27:09,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:27:09,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:27:09,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:27:09,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:27:09,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:27:09,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:27:09,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:27:09,824 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2025-02-07 17:27:10,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:27:10,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:27:10,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:27:10,112 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:27:10,113 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:27:10,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2025-02-07 17:27:11,338 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff9b2ea31/784b5a22ff41473ba4aa787573c9bb4c/FLAG4fda56b92 [2025-02-07 17:27:11,559 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:27:11,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2025-02-07 17:27:11,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff9b2ea31/784b5a22ff41473ba4aa787573c9bb4c/FLAG4fda56b92 [2025-02-07 17:27:11,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff9b2ea31/784b5a22ff41473ba4aa787573c9bb4c [2025-02-07 17:27:11,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:27:11,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:27:11,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:27:11,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:27:11,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:27:11,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:27:11" (1/1) ... [2025-02-07 17:27:11,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71aa2437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:11, skipping insertion in model container [2025-02-07 17:27:11,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:27:11" (1/1) ... [2025-02-07 17:27:11,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:27:12,016 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/bitvector/byte_add_1-1.i[1168,1181] [2025-02-07 17:27:12,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:27:12,062 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:27:12,071 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/bitvector/byte_add_1-1.i[1168,1181] [2025-02-07 17:27:12,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:27:12,100 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:27:12,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:12 WrapperNode [2025-02-07 17:27:12,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:27:12,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:27:12,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:27:12,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:27:12,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:12" (1/1) ... [2025-02-07 17:27:12,114 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:12" (1/1) ... [2025-02-07 17:27:12,135 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 141 [2025-02-07 17:27:12,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:27:12,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:27:12,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:27:12,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:27:12,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:12" (1/1) ... [2025-02-07 17:27:12,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:12" (1/1) ... [2025-02-07 17:27:12,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:12" (1/1) ... [2025-02-07 17:27:12,153 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 17:27:12,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:12" (1/1) ... [2025-02-07 17:27:12,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:12" (1/1) ... [2025-02-07 17:27:12,159 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:12" (1/1) ... [2025-02-07 17:27:12,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:12" (1/1) ... [2025-02-07 17:27:12,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:12" (1/1) ... [2025-02-07 17:27:12,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:12" (1/1) ... [2025-02-07 17:27:12,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:27:12,177 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:27:12,177 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:27:12,177 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:27:12,178 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:12" (1/1) ... [2025-02-07 17:27:12,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:27:12,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:12,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 17:27:12,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 17:27:12,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:27:12,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:27:12,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:27:12,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:27:12,281 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:27:12,286 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:27:12,564 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-02-07 17:27:12,565 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:27:12,586 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:27:12,586 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:27:12,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:27:12 BoogieIcfgContainer [2025-02-07 17:27:12,586 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:27:12,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:27:12,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:27:12,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:27:12,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:27:11" (1/3) ... [2025-02-07 17:27:12,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aeaab9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:27:12, skipping insertion in model container [2025-02-07 17:27:12,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:12" (2/3) ... [2025-02-07 17:27:12,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aeaab9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:27:12, skipping insertion in model container [2025-02-07 17:27:12,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:27:12" (3/3) ... [2025-02-07 17:27:12,595 INFO L128 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2025-02-07 17:27:12,606 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:27:12,608 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG byte_add_1-1.i that has 1 procedures, 48 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 17:27:12,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:27:12,661 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;@4ff22f83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:27:12,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:27:12,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 47 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:12,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 17:27:12,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:12,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:12,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:12,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:12,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1420198052, now seen corresponding path program 1 times [2025-02-07 17:27:12,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:12,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004328785] [2025-02-07 17:27:12,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:12,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:12,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 17:27:12,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 17:27:12,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:12,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:12,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:12,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:12,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004328785] [2025-02-07 17:27:12,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004328785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:12,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:12,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:27:12,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413223875] [2025-02-07 17:27:12,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:12,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:27:12,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:12,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:27:12,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:27:12,990 INFO L87 Difference]: Start difference. First operand has 48 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 47 states have internal predecessors, (81), 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 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:13,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:13,155 INFO L93 Difference]: Finished difference Result 110 states and 191 transitions. [2025-02-07 17:27:13,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:27:13,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2025-02-07 17:27:13,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:13,164 INFO L225 Difference]: With dead ends: 110 [2025-02-07 17:27:13,165 INFO L226 Difference]: Without dead ends: 68 [2025-02-07 17:27:13,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:27:13,171 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 24 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:13,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 84 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-07 17:27:13,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2025-02-07 17:27:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 65 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2025-02-07 17:27:13,222 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 13 [2025-02-07 17:27:13,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:13,223 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2025-02-07 17:27:13,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:13,223 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2025-02-07 17:27:13,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 17:27:13,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:13,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:13,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:27:13,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:13,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:13,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1780316158, now seen corresponding path program 1 times [2025-02-07 17:27:13,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:13,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49201162] [2025-02-07 17:27:13,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:13,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:13,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 17:27:13,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 17:27:13,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:13,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:13,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:13,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49201162] [2025-02-07 17:27:13,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49201162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:13,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:13,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:27:13,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825003449] [2025-02-07 17:27:13,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:13,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:27:13,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:13,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:27:13,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:27:13,410 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:13,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:13,672 INFO L93 Difference]: Finished difference Result 161 states and 276 transitions. [2025-02-07 17:27:13,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 17:27:13,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-07 17:27:13,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:13,674 INFO L225 Difference]: With dead ends: 161 [2025-02-07 17:27:13,674 INFO L226 Difference]: Without dead ends: 125 [2025-02-07 17:27:13,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:27:13,675 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 92 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:13,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 101 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:27:13,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-07 17:27:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 89. [2025-02-07 17:27:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.5568181818181819) internal successors, (137), 88 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2025-02-07 17:27:13,688 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 137 transitions. Word has length 19 [2025-02-07 17:27:13,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:13,688 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 137 transitions. [2025-02-07 17:27:13,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:13,688 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 137 transitions. [2025-02-07 17:27:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 17:27:13,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:13,689 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:13,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 17:27:13,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:13,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:13,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1482887482, now seen corresponding path program 1 times [2025-02-07 17:27:13,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:13,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585852603] [2025-02-07 17:27:13,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:13,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:13,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 17:27:13,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 17:27:13,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:13,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:13,863 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 17:27:13,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:13,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585852603] [2025-02-07 17:27:13,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585852603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:13,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:13,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:27:13,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179500022] [2025-02-07 17:27:13,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:13,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:27:13,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:13,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:27:13,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:27:13,867 INFO L87 Difference]: Start difference. First operand 89 states and 137 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:14,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:14,026 INFO L93 Difference]: Finished difference Result 235 states and 358 transitions. [2025-02-07 17:27:14,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:27:14,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-07 17:27:14,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:14,028 INFO L225 Difference]: With dead ends: 235 [2025-02-07 17:27:14,028 INFO L226 Difference]: Without dead ends: 158 [2025-02-07 17:27:14,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:27:14,029 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 75 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:14,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 173 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:14,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-07 17:27:14,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 96. [2025-02-07 17:27:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 95 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 147 transitions. [2025-02-07 17:27:14,038 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 147 transitions. Word has length 25 [2025-02-07 17:27:14,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:14,038 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 147 transitions. [2025-02-07 17:27:14,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 147 transitions. [2025-02-07 17:27:14,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 17:27:14,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:14,039 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:14,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 17:27:14,040 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:14,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:14,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1984795798, now seen corresponding path program 1 times [2025-02-07 17:27:14,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:14,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70127276] [2025-02-07 17:27:14,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:14,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:14,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 17:27:14,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 17:27:14,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:14,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 17:27:14,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:14,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70127276] [2025-02-07 17:27:14,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70127276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:14,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:14,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:27:14,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733493442] [2025-02-07 17:27:14,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:14,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:27:14,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:14,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:27:14,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:27:14,159 INFO L87 Difference]: Start difference. First operand 96 states and 147 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:14,296 INFO L93 Difference]: Finished difference Result 241 states and 364 transitions. [2025-02-07 17:27:14,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:27:14,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-07 17:27:14,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:14,298 INFO L225 Difference]: With dead ends: 241 [2025-02-07 17:27:14,298 INFO L226 Difference]: Without dead ends: 164 [2025-02-07 17:27:14,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:27:14,299 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 70 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:14,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 165 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:14,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-07 17:27:14,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 107. [2025-02-07 17:27:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.5) internal successors, (159), 106 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2025-02-07 17:27:14,309 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 159 transitions. Word has length 26 [2025-02-07 17:27:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:14,309 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 159 transitions. [2025-02-07 17:27:14,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 159 transitions. [2025-02-07 17:27:14,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-07 17:27:14,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:14,311 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:14,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 17:27:14,311 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:14,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:14,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1886196363, now seen corresponding path program 1 times [2025-02-07 17:27:14,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:14,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059342403] [2025-02-07 17:27:14,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:14,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:14,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-07 17:27:14,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-07 17:27:14,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:14,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:14,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:14,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:14,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059342403] [2025-02-07 17:27:14,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059342403] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:14,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112474621] [2025-02-07 17:27:14,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:14,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:14,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:14,424 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:14,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 17:27:14,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-07 17:27:14,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-07 17:27:14,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:14,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:14,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 17:27:14,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 17:27:14,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:14,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112474621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:14,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:27:14,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-02-07 17:27:14,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53865731] [2025-02-07 17:27:14,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:14,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:27:14,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:14,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:27:14,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 17:27:14,550 INFO L87 Difference]: Start difference. First operand 107 states and 159 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:14,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:14,714 INFO L93 Difference]: Finished difference Result 227 states and 360 transitions. [2025-02-07 17:27:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:27:14,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 27 [2025-02-07 17:27:14,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:14,718 INFO L225 Difference]: With dead ends: 227 [2025-02-07 17:27:14,718 INFO L226 Difference]: Without dead ends: 152 [2025-02-07 17:27:14,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 17:27:14,719 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 37 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:14,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 136 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:27:14,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-07 17:27:14,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 136. [2025-02-07 17:27:14,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4370370370370371) internal successors, (194), 135 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2025-02-07 17:27:14,728 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 27 [2025-02-07 17:27:14,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:14,728 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2025-02-07 17:27:14,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:14,728 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2025-02-07 17:27:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 17:27:14,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:14,729 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:14,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 17:27:14,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:14,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:14,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:14,930 INFO L85 PathProgramCache]: Analyzing trace with hash -26677199, now seen corresponding path program 1 times [2025-02-07 17:27:14,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:14,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466018777] [2025-02-07 17:27:14,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:14,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:14,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 17:27:14,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 17:27:14,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:14,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:15,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:15,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466018777] [2025-02-07 17:27:15,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466018777] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:15,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858524312] [2025-02-07 17:27:15,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:15,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:15,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:15,072 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:15,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 17:27:15,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 17:27:15,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 17:27:15,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:15,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:15,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 17:27:15,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-07 17:27:15,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:15,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858524312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:15,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:27:15,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2025-02-07 17:27:15,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934508129] [2025-02-07 17:27:15,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:15,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 17:27:15,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:15,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 17:27:15,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-07 17:27:15,206 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:15,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:15,616 INFO L93 Difference]: Finished difference Result 679 states and 994 transitions. [2025-02-07 17:27:15,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 17:27:15,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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 33 [2025-02-07 17:27:15,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:15,618 INFO L225 Difference]: With dead ends: 679 [2025-02-07 17:27:15,618 INFO L226 Difference]: Without dead ends: 509 [2025-02-07 17:27:15,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-02-07 17:27:15,619 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 210 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:15,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 639 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 17:27:15,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-02-07 17:27:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 392. [2025-02-07 17:27:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.3759590792838874) internal successors, (538), 391 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-07 17:27:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 538 transitions. [2025-02-07 17:27:15,652 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 538 transitions. Word has length 33 [2025-02-07 17:27:15,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:15,653 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 538 transitions. [2025-02-07 17:27:15,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:15,653 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 538 transitions. [2025-02-07 17:27:15,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-07 17:27:15,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:15,658 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:15,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 17:27:15,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:15,859 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:15,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1904504126, now seen corresponding path program 1 times [2025-02-07 17:27:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:15,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446733308] [2025-02-07 17:27:15,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:15,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 17:27:15,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 17:27:15,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:15,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:15,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:15,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446733308] [2025-02-07 17:27:15,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446733308] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:15,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408141175] [2025-02-07 17:27:15,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:15,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:15,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:15,972 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:15,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 17:27:16,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 17:27:16,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 17:27:16,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:16,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:16,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 17:27:16,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 17:27:16,051 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:16,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408141175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:16,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:27:16,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-07 17:27:16,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919785523] [2025-02-07 17:27:16,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:16,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:27:16,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:16,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:27:16,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 17:27:16,052 INFO L87 Difference]: Start difference. First operand 392 states and 538 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:16,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:16,234 INFO L93 Difference]: Finished difference Result 884 states and 1264 transitions. [2025-02-07 17:27:16,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:27:16,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 34 [2025-02-07 17:27:16,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:16,244 INFO L225 Difference]: With dead ends: 884 [2025-02-07 17:27:16,244 INFO L226 Difference]: Without dead ends: 533 [2025-02-07 17:27:16,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 17:27:16,244 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 36 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:16,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 136 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:27:16,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-02-07 17:27:16,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 462. [2025-02-07 17:27:16,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 1.351409978308026) internal successors, (623), 461 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 623 transitions. [2025-02-07 17:27:16,264 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 623 transitions. Word has length 34 [2025-02-07 17:27:16,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:16,264 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 623 transitions. [2025-02-07 17:27:16,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:16,265 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 623 transitions. [2025-02-07 17:27:16,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-07 17:27:16,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:16,266 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:16,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 17:27:16,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:16,470 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:16,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:16,471 INFO L85 PathProgramCache]: Analyzing trace with hash -535479614, now seen corresponding path program 1 times [2025-02-07 17:27:16,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:16,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954755839] [2025-02-07 17:27:16,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:16,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:16,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 17:27:16,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 17:27:16,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:16,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:16,603 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-07 17:27:16,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:16,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954755839] [2025-02-07 17:27:16,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954755839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:16,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:16,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 17:27:16,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974102202] [2025-02-07 17:27:16,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:16,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 17:27:16,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:16,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 17:27:16,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:27:16,605 INFO L87 Difference]: Start difference. First operand 462 states and 623 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:16,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:16,839 INFO L93 Difference]: Finished difference Result 1161 states and 1570 transitions. [2025-02-07 17:27:16,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 17:27:16,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-02-07 17:27:16,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:16,843 INFO L225 Difference]: With dead ends: 1161 [2025-02-07 17:27:16,843 INFO L226 Difference]: Without dead ends: 924 [2025-02-07 17:27:16,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 17:27:16,844 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 141 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:16,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 252 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:27:16,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2025-02-07 17:27:16,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 462. [2025-02-07 17:27:16,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 1.351409978308026) internal successors, (623), 461 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:16,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 623 transitions. [2025-02-07 17:27:16,863 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 623 transitions. Word has length 40 [2025-02-07 17:27:16,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:16,863 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 623 transitions. [2025-02-07 17:27:16,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 623 transitions. [2025-02-07 17:27:16,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-07 17:27:16,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:16,865 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:16,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 17:27:16,865 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:16,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:16,866 INFO L85 PathProgramCache]: Analyzing trace with hash -502402666, now seen corresponding path program 1 times [2025-02-07 17:27:16,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:16,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986223479] [2025-02-07 17:27:16,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:16,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:16,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-07 17:27:16,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 17:27:16,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:16,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-07 17:27:16,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:16,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986223479] [2025-02-07 17:27:16,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986223479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:16,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:16,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 17:27:16,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674041774] [2025-02-07 17:27:16,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:16,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:27:16,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:16,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:27:16,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:27:16,988 INFO L87 Difference]: Start difference. First operand 462 states and 623 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:16,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:16,999 INFO L93 Difference]: Finished difference Result 606 states and 815 transitions. [2025-02-07 17:27:16,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:27:16,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-02-07 17:27:17,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:17,001 INFO L225 Difference]: With dead ends: 606 [2025-02-07 17:27:17,001 INFO L226 Difference]: Without dead ends: 157 [2025-02-07 17:27:17,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:27:17,002 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 68 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:17,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 69 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:27:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-07 17:27:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-02-07 17:27:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.3269230769230769) internal successors, (207), 156 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 207 transitions. [2025-02-07 17:27:17,009 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 207 transitions. Word has length 41 [2025-02-07 17:27:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:17,009 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 207 transitions. [2025-02-07 17:27:17,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 207 transitions. [2025-02-07 17:27:17,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-07 17:27:17,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:17,010 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-07 17:27:17,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 17:27:17,010 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:17,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:17,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2140994888, now seen corresponding path program 1 times [2025-02-07 17:27:17,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:17,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889583919] [2025-02-07 17:27:17,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:17,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:17,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-07 17:27:17,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-07 17:27:17,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:17,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-07 17:27:17,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:17,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889583919] [2025-02-07 17:27:17,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889583919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:17,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:17,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 17:27:17,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434859188] [2025-02-07 17:27:17,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:17,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 17:27:17,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:17,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 17:27:17,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 17:27:17,145 INFO L87 Difference]: Start difference. First operand 157 states and 207 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:17,282 INFO L93 Difference]: Finished difference Result 330 states and 435 transitions. [2025-02-07 17:27:17,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 17:27:17,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-07 17:27:17,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:17,283 INFO L225 Difference]: With dead ends: 330 [2025-02-07 17:27:17,283 INFO L226 Difference]: Without dead ends: 186 [2025-02-07 17:27:17,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 17:27:17,284 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 70 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:17,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 122 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-07 17:27:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 151. [2025-02-07 17:27:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.32) internal successors, (198), 150 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:17,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 198 transitions. [2025-02-07 17:27:17,296 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 198 transitions. Word has length 52 [2025-02-07 17:27:17,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:17,296 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 198 transitions. [2025-02-07 17:27:17,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 198 transitions. [2025-02-07 17:27:17,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-07 17:27:17,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:17,297 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:17,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 17:27:17,297 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:17,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash 237902085, now seen corresponding path program 1 times [2025-02-07 17:27:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:17,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094576975] [2025-02-07 17:27:17,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:17,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:17,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-07 17:27:17,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-07 17:27:17,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:17,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-07 17:27:17,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:17,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094576975] [2025-02-07 17:27:17,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094576975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:17,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:17,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:27:17,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109516672] [2025-02-07 17:27:17,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:17,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:27:17,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:17,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:27:17,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:27:17,391 INFO L87 Difference]: Start difference. First operand 151 states and 198 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:17,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:17,410 INFO L93 Difference]: Finished difference Result 223 states and 287 transitions. [2025-02-07 17:27:17,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:27:17,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-07 17:27:17,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:17,412 INFO L225 Difference]: With dead ends: 223 [2025-02-07 17:27:17,412 INFO L226 Difference]: Without dead ends: 183 [2025-02-07 17:27:17,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:27:17,412 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:17,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 132 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:27:17,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-07 17:27:17,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2025-02-07 17:27:17,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.3076923076923077) internal successors, (221), 169 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:17,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 221 transitions. [2025-02-07 17:27:17,421 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 221 transitions. Word has length 60 [2025-02-07 17:27:17,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:17,421 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 221 transitions. [2025-02-07 17:27:17,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:17,421 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 221 transitions. [2025-02-07 17:27:17,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-07 17:27:17,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:17,422 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:17,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 17:27:17,422 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:17,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:17,422 INFO L85 PathProgramCache]: Analyzing trace with hash -170922140, now seen corresponding path program 1 times [2025-02-07 17:27:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:17,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797323151] [2025-02-07 17:27:17,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:17,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:17,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-07 17:27:17,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-07 17:27:17,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:17,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:17,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:17,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797323151] [2025-02-07 17:27:17,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797323151] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:17,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989791311] [2025-02-07 17:27:17,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:17,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:17,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:17,768 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:17,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 17:27:17,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-07 17:27:17,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-07 17:27:17,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:17,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:17,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 17:27:17,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:17,883 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-07 17:27:17,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:17,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989791311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:17,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:27:17,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2025-02-07 17:27:17,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310008607] [2025-02-07 17:27:17,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:17,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:27:17,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:17,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:27:17,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-07 17:27:17,884 INFO L87 Difference]: Start difference. First operand 170 states and 221 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:17,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:17,945 INFO L93 Difference]: Finished difference Result 319 states and 417 transitions. [2025-02-07 17:27:17,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 17:27:17,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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 60 [2025-02-07 17:27:17,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:17,947 INFO L225 Difference]: With dead ends: 319 [2025-02-07 17:27:17,947 INFO L226 Difference]: Without dead ends: 152 [2025-02-07 17:27:17,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-07 17:27:17,947 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 27 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:17,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 93 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:27:17,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-07 17:27:17,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 140. [2025-02-07 17:27:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.3093525179856116) internal successors, (182), 139 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 182 transitions. [2025-02-07 17:27:17,952 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 182 transitions. Word has length 60 [2025-02-07 17:27:17,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:17,952 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 182 transitions. [2025-02-07 17:27:17,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:17,953 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2025-02-07 17:27:17,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-07 17:27:17,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:17,953 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-07 17:27:17,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 17:27:18,154 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,SelfDestructingSolverStorable11 [2025-02-07 17:27:18,154 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:18,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:18,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1502115514, now seen corresponding path program 1 times [2025-02-07 17:27:18,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:18,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881823587] [2025-02-07 17:27:18,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:18,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:18,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-07 17:27:18,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-07 17:27:18,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:18,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-02-07 17:27:18,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:18,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881823587] [2025-02-07 17:27:18,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881823587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:18,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:18,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 17:27:18,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839053403] [2025-02-07 17:27:18,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:18,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 17:27:18,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:18,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 17:27:18,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:27:18,352 INFO L87 Difference]: Start difference. First operand 140 states and 182 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:18,476 INFO L93 Difference]: Finished difference Result 406 states and 525 transitions. [2025-02-07 17:27:18,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 17:27:18,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-07 17:27:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:18,478 INFO L225 Difference]: With dead ends: 406 [2025-02-07 17:27:18,478 INFO L226 Difference]: Without dead ends: 284 [2025-02-07 17:27:18,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-07 17:27:18,479 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 115 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:18,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 202 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:18,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-02-07 17:27:18,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 214. [2025-02-07 17:27:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.2910798122065728) internal successors, (275), 213 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 275 transitions. [2025-02-07 17:27:18,490 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 275 transitions. Word has length 67 [2025-02-07 17:27:18,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:18,490 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 275 transitions. [2025-02-07 17:27:18,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 275 transitions. [2025-02-07 17:27:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-07 17:27:18,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:18,491 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-07 17:27:18,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 17:27:18,492 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:18,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:18,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1004454809, now seen corresponding path program 1 times [2025-02-07 17:27:18,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:18,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725024205] [2025-02-07 17:27:18,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:18,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:18,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-07 17:27:18,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-07 17:27:18,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:18,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-07 17:27:18,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:18,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725024205] [2025-02-07 17:27:18,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725024205] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:18,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74439819] [2025-02-07 17:27:18,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:18,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:18,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:18,748 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:18,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 17:27:18,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-07 17:27:18,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-07 17:27:18,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:18,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:18,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-07 17:27:18,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:19,013 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-07 17:27:19,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:27:19,234 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-07 17:27:19,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74439819] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:27:19,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:27:19,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2025-02-07 17:27:19,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602281774] [2025-02-07 17:27:19,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:27:19,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 17:27:19,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:19,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 17:27:19,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-02-07 17:27:19,235 INFO L87 Difference]: Start difference. First operand 214 states and 275 transitions. Second operand has 15 states, 15 states have (on average 8.133333333333333) internal successors, (122), 14 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:19,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:19,898 INFO L93 Difference]: Finished difference Result 797 states and 1009 transitions. [2025-02-07 17:27:19,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-07 17:27:19,899 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.133333333333333) internal successors, (122), 14 states have internal predecessors, (122), 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 67 [2025-02-07 17:27:19,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:19,901 INFO L225 Difference]: With dead ends: 797 [2025-02-07 17:27:19,901 INFO L226 Difference]: Without dead ends: 787 [2025-02-07 17:27:19,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=484, Invalid=1496, Unknown=0, NotChecked=0, Total=1980 [2025-02-07 17:27:19,903 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 352 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:19,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 803 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 17:27:19,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-02-07 17:27:19,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 382. [2025-02-07 17:27:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.2965879265091864) internal successors, (494), 381 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 494 transitions. [2025-02-07 17:27:19,932 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 494 transitions. Word has length 67 [2025-02-07 17:27:19,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:19,933 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 494 transitions. [2025-02-07 17:27:19,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.133333333333333) internal successors, (122), 14 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 494 transitions. [2025-02-07 17:27:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-07 17:27:19,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:19,936 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-07 17:27:19,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 17:27:20,141 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,SelfDestructingSolverStorable13 [2025-02-07 17:27:20,141 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:20,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:20,141 INFO L85 PathProgramCache]: Analyzing trace with hash -724799969, now seen corresponding path program 1 times [2025-02-07 17:27:20,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:20,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321733067] [2025-02-07 17:27:20,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:20,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:20,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-07 17:27:20,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-07 17:27:20,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:20,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-07 17:27:20,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:20,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321733067] [2025-02-07 17:27:20,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321733067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:20,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:20,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:27:20,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150010441] [2025-02-07 17:27:20,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:20,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:27:20,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:20,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:27:20,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:27:20,257 INFO L87 Difference]: Start difference. First operand 382 states and 494 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:20,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:20,286 INFO L93 Difference]: Finished difference Result 392 states and 507 transitions. [2025-02-07 17:27:20,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:27:20,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 68 [2025-02-07 17:27:20,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:20,287 INFO L225 Difference]: With dead ends: 392 [2025-02-07 17:27:20,287 INFO L226 Difference]: Without dead ends: 385 [2025-02-07 17:27:20,287 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-07 17:27:20,288 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 3 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:20,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 154 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:27:20,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-02-07 17:27:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2025-02-07 17:27:20,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.2958115183246073) internal successors, (495), 382 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 495 transitions. [2025-02-07 17:27:20,298 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 495 transitions. Word has length 68 [2025-02-07 17:27:20,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:20,298 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 495 transitions. [2025-02-07 17:27:20,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:20,298 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 495 transitions. [2025-02-07 17:27:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-07 17:27:20,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:20,299 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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-07 17:27:20,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 17:27:20,299 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:20,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:20,300 INFO L85 PathProgramCache]: Analyzing trace with hash -844320411, now seen corresponding path program 1 times [2025-02-07 17:27:20,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:20,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936924489] [2025-02-07 17:27:20,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:20,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:20,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-07 17:27:20,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-07 17:27:20,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:20,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-07 17:27:20,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:20,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936924489] [2025-02-07 17:27:20,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936924489] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:20,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715436626] [2025-02-07 17:27:20,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:20,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:20,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:20,592 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:20,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 17:27:20,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-07 17:27:20,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-07 17:27:20,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:20,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:20,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 17:27:20,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-07 17:27:20,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:20,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715436626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:20,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:27:20,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-02-07 17:27:20,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266517842] [2025-02-07 17:27:20,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:20,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 17:27:20,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:20,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 17:27:20,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-07 17:27:20,770 INFO L87 Difference]: Start difference. First operand 383 states and 495 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:20,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:20,822 INFO L93 Difference]: Finished difference Result 392 states and 506 transitions. [2025-02-07 17:27:20,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 17:27:20,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 69 [2025-02-07 17:27:20,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:20,823 INFO L225 Difference]: With dead ends: 392 [2025-02-07 17:27:20,823 INFO L226 Difference]: Without dead ends: 388 [2025-02-07 17:27:20,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-07 17:27:20,824 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:20,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 202 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:27:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-07 17:27:20,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 385. [2025-02-07 17:27:20,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.296875) internal successors, (498), 384 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 498 transitions. [2025-02-07 17:27:20,839 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 498 transitions. Word has length 69 [2025-02-07 17:27:20,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:20,839 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 498 transitions. [2025-02-07 17:27:20,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 498 transitions. [2025-02-07 17:27:20,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-07 17:27:20,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:20,840 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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-07 17:27:20,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-07 17:27:21,045 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,SelfDestructingSolverStorable15 [2025-02-07 17:27:21,045 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:21,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:21,045 INFO L85 PathProgramCache]: Analyzing trace with hash -502288766, now seen corresponding path program 1 times [2025-02-07 17:27:21,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:21,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422397401] [2025-02-07 17:27:21,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:21,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:21,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-07 17:27:21,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-07 17:27:21,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:21,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 77 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 17:27:21,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:21,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422397401] [2025-02-07 17:27:21,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422397401] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:21,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938419238] [2025-02-07 17:27:21,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:21,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:21,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:21,410 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:21,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-07 17:27:21,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-07 17:27:21,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-07 17:27:21,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:21,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:21,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 17:27:21,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-07 17:27:21,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:21,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938419238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:21,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:27:21,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2025-02-07 17:27:21,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845836772] [2025-02-07 17:27:21,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:21,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:27:21,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:21,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:27:21,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-07 17:27:21,511 INFO L87 Difference]: Start difference. First operand 385 states and 498 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:21,537 INFO L93 Difference]: Finished difference Result 395 states and 511 transitions. [2025-02-07 17:27:21,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:27:21,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 69 [2025-02-07 17:27:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:21,539 INFO L225 Difference]: With dead ends: 395 [2025-02-07 17:27:21,539 INFO L226 Difference]: Without dead ends: 388 [2025-02-07 17:27:21,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-07 17:27:21,540 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:21,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 165 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:27:21,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-02-07 17:27:21,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2025-02-07 17:27:21,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.2961038961038962) internal successors, (499), 385 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:21,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 499 transitions. [2025-02-07 17:27:21,551 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 499 transitions. Word has length 69 [2025-02-07 17:27:21,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:21,551 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 499 transitions. [2025-02-07 17:27:21,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:21,551 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 499 transitions. [2025-02-07 17:27:21,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-07 17:27:21,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:21,552 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 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-07 17:27:21,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-07 17:27:21,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:21,754 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:21,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:21,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1101121831, now seen corresponding path program 1 times [2025-02-07 17:27:21,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:21,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154154181] [2025-02-07 17:27:21,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:21,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:21,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-07 17:27:21,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-07 17:27:21,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:21,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-07 17:27:21,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:21,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154154181] [2025-02-07 17:27:21,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154154181] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:21,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566526361] [2025-02-07 17:27:21,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:21,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:21,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:21,891 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:21,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-07 17:27:21,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-07 17:27:21,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-07 17:27:21,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:21,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:21,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-07 17:27:21,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-07 17:27:21,999 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:21,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566526361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:21,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:27:21,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-02-07 17:27:22,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192870545] [2025-02-07 17:27:22,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:22,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:27:22,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:22,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:27:22,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-07 17:27:22,000 INFO L87 Difference]: Start difference. First operand 386 states and 499 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-07 17:27:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:22,083 INFO L93 Difference]: Finished difference Result 960 states and 1238 transitions. [2025-02-07 17:27:22,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:27:22,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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 69 [2025-02-07 17:27:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:22,085 INFO L225 Difference]: With dead ends: 960 [2025-02-07 17:27:22,085 INFO L226 Difference]: Without dead ends: 592 [2025-02-07 17:27:22,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-07 17:27:22,087 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 36 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:22,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 109 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:22,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-02-07 17:27:22,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 568. [2025-02-07 17:27:22,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 567 states have (on average 1.289241622574956) internal successors, (731), 567 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:22,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 731 transitions. [2025-02-07 17:27:22,113 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 731 transitions. Word has length 69 [2025-02-07 17:27:22,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:22,113 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 731 transitions. [2025-02-07 17:27:22,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-07 17:27:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 731 transitions. [2025-02-07 17:27:22,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-07 17:27:22,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:22,115 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 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-07 17:27:22,122 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-07 17:27:22,317 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,SelfDestructingSolverStorable17 [2025-02-07 17:27:22,318 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:22,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:22,319 INFO L85 PathProgramCache]: Analyzing trace with hash -245251607, now seen corresponding path program 1 times [2025-02-07 17:27:22,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:22,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674065521] [2025-02-07 17:27:22,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:22,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:22,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-07 17:27:22,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-07 17:27:22,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:22,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 17:27:22,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:22,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674065521] [2025-02-07 17:27:22,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674065521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:22,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:22,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 17:27:22,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360977871] [2025-02-07 17:27:22,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:22,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 17:27:22,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:22,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 17:27:22,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 17:27:22,474 INFO L87 Difference]: Start difference. First operand 568 states and 731 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:22,815 INFO L93 Difference]: Finished difference Result 1708 states and 2195 transitions. [2025-02-07 17:27:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 17:27:22,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-07 17:27:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:22,818 INFO L225 Difference]: With dead ends: 1708 [2025-02-07 17:27:22,818 INFO L226 Difference]: Without dead ends: 1340 [2025-02-07 17:27:22,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-07 17:27:22,819 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 251 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:22,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 377 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 17:27:22,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2025-02-07 17:27:22,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 564. [2025-02-07 17:27:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 563 states have (on average 1.2912966252220248) internal successors, (727), 563 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:22,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 727 transitions. [2025-02-07 17:27:22,840 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 727 transitions. Word has length 70 [2025-02-07 17:27:22,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:22,841 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 727 transitions. [2025-02-07 17:27:22,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:22,841 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 727 transitions. [2025-02-07 17:27:22,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-07 17:27:22,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:22,842 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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-07 17:27:22,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 17:27:22,842 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:22,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:22,842 INFO L85 PathProgramCache]: Analyzing trace with hash -66810564, now seen corresponding path program 1 times [2025-02-07 17:27:22,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:22,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411722954] [2025-02-07 17:27:22,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:22,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:22,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-07 17:27:22,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-07 17:27:22,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:22,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-07 17:27:22,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:22,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411722954] [2025-02-07 17:27:22,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411722954] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:22,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795619854] [2025-02-07 17:27:22,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:22,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:22,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:22,965 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:22,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-07 17:27:22,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-07 17:27:23,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-07 17:27:23,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:23,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:23,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-07 17:27:23,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:23,087 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-07 17:27:23,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:27:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 42 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:27:23,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795619854] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:27:23,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:27:23,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 17 [2025-02-07 17:27:23,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859964322] [2025-02-07 17:27:23,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:27:23,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 17:27:23,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:23,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 17:27:23,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-02-07 17:27:23,243 INFO L87 Difference]: Start difference. First operand 564 states and 727 transitions. Second operand has 17 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 17 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:24,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:24,351 INFO L93 Difference]: Finished difference Result 2722 states and 3592 transitions. [2025-02-07 17:27:24,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-07 17:27:24,351 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 17 states have internal predecessors, (120), 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 70 [2025-02-07 17:27:24,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:24,358 INFO L225 Difference]: With dead ends: 2722 [2025-02-07 17:27:24,358 INFO L226 Difference]: Without dead ends: 2138 [2025-02-07 17:27:24,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=586, Invalid=1220, Unknown=0, NotChecked=0, Total=1806 [2025-02-07 17:27:24,360 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 680 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:24,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 239 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 17:27:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2025-02-07 17:27:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1762. [2025-02-07 17:27:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1761 states have (on average 1.3123225440090858) internal successors, (2311), 1761 states have internal predecessors, (2311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 2311 transitions. [2025-02-07 17:27:24,421 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 2311 transitions. Word has length 70 [2025-02-07 17:27:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:24,421 INFO L471 AbstractCegarLoop]: Abstraction has 1762 states and 2311 transitions. [2025-02-07 17:27:24,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 17 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 2311 transitions. [2025-02-07 17:27:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-07 17:27:24,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:24,424 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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-07 17:27:24,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-07 17:27:24,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:24,624 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:24,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:24,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1332458346, now seen corresponding path program 1 times [2025-02-07 17:27:24,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:24,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924561213] [2025-02-07 17:27:24,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:24,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:24,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-07 17:27:24,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-07 17:27:24,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:24,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-07 17:27:24,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:24,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924561213] [2025-02-07 17:27:24,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924561213] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:24,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019972670] [2025-02-07 17:27:24,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:24,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:24,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:24,813 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:24,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-07 17:27:24,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-07 17:27:24,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-07 17:27:24,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:24,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:24,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-07 17:27:24,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-07 17:27:25,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:27:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-07 17:27:25,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019972670] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:27:25,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:27:25,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-02-07 17:27:25,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145914352] [2025-02-07 17:27:25,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:27:25,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 17:27:25,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:25,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 17:27:25,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-02-07 17:27:25,120 INFO L87 Difference]: Start difference. First operand 1762 states and 2311 transitions. Second operand has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:25,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:25,401 INFO L93 Difference]: Finished difference Result 3718 states and 4765 transitions. [2025-02-07 17:27:25,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 17:27:25,401 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 13 states have internal predecessors, (123), 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 71 [2025-02-07 17:27:25,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:25,406 INFO L225 Difference]: With dead ends: 3718 [2025-02-07 17:27:25,407 INFO L226 Difference]: Without dead ends: 1982 [2025-02-07 17:27:25,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2025-02-07 17:27:25,409 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 301 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:25,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 452 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:25,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2025-02-07 17:27:25,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1376. [2025-02-07 17:27:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1375 states have (on average 1.2763636363636364) internal successors, (1755), 1375 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1755 transitions. [2025-02-07 17:27:25,458 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1755 transitions. Word has length 71 [2025-02-07 17:27:25,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:25,458 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 1755 transitions. [2025-02-07 17:27:25,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.785714285714286) internal successors, (123), 13 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:25,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1755 transitions. [2025-02-07 17:27:25,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-07 17:27:25,459 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:25,459 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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-07 17:27:25,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-07 17:27:25,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:25,664 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:25,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:25,664 INFO L85 PathProgramCache]: Analyzing trace with hash -539314934, now seen corresponding path program 2 times [2025-02-07 17:27:25,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:25,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452342006] [2025-02-07 17:27:25,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:27:25,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:25,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-02-07 17:27:25,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-02-07 17:27:25,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:27:25,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 4 proven. 74 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 17:27:25,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:25,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452342006] [2025-02-07 17:27:25,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452342006] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:25,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838569920] [2025-02-07 17:27:25,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:27:25,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:25,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:25,966 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:25,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-07 17:27:26,008 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-02-07 17:27:26,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-02-07 17:27:26,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:27:26,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:26,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-07 17:27:26,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:26,421 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 54 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 17:27:26,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:27:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-07 17:27:27,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838569920] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:27:27,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:27:27,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 24 [2025-02-07 17:27:27,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158390364] [2025-02-07 17:27:27,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:27:27,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-07 17:27:27,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:27,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-07 17:27:27,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2025-02-07 17:27:27,081 INFO L87 Difference]: Start difference. First operand 1376 states and 1755 transitions. Second operand has 24 states, 24 states have (on average 7.208333333333333) internal successors, (173), 24 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:30,889 INFO L93 Difference]: Finished difference Result 9994 states and 12109 transitions. [2025-02-07 17:27:30,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-02-07 17:27:30,891 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.208333333333333) internal successors, (173), 24 states have internal predecessors, (173), 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 71 [2025-02-07 17:27:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:30,913 INFO L225 Difference]: With dead ends: 9994 [2025-02-07 17:27:30,913 INFO L226 Difference]: Without dead ends: 9983 [2025-02-07 17:27:30,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3734 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1694, Invalid=10296, Unknown=0, NotChecked=0, Total=11990 [2025-02-07 17:27:30,918 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 885 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:30,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 2299 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-07 17:27:30,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9983 states. [2025-02-07 17:27:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9983 to 3639. [2025-02-07 17:27:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3639 states, 3638 states have (on average 1.3026388125343595) internal successors, (4739), 3638 states have internal predecessors, (4739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 4739 transitions. [2025-02-07 17:27:31,083 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 4739 transitions. Word has length 71 [2025-02-07 17:27:31,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:31,083 INFO L471 AbstractCegarLoop]: Abstraction has 3639 states and 4739 transitions. [2025-02-07 17:27:31,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.208333333333333) internal successors, (173), 24 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 4739 transitions. [2025-02-07 17:27:31,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-07 17:27:31,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:31,085 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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-07 17:27:31,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-07 17:27:31,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-07 17:27:31,290 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:31,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:31,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1830119051, now seen corresponding path program 1 times [2025-02-07 17:27:31,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:31,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728373212] [2025-02-07 17:27:31,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:31,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:31,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-07 17:27:31,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-07 17:27:31,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:31,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:31,686 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:27:31,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:31,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728373212] [2025-02-07 17:27:31,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728373212] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:31,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731142806] [2025-02-07 17:27:31,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:31,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:31,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:31,688 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:31,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-07 17:27:31,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-07 17:27:31,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-07 17:27:31,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:31,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:31,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-07 17:27:31,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-07 17:27:31,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:27:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-07 17:27:32,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731142806] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:27:32,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:27:32,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 25 [2025-02-07 17:27:32,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556045705] [2025-02-07 17:27:32,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:27:32,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-07 17:27:32,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:32,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-07 17:27:32,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2025-02-07 17:27:32,231 INFO L87 Difference]: Start difference. First operand 3639 states and 4739 transitions. Second operand has 26 states, 26 states have (on average 7.038461538461538) internal successors, (183), 25 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:35,697 INFO L93 Difference]: Finished difference Result 17371 states and 21990 transitions. [2025-02-07 17:27:35,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2025-02-07 17:27:35,698 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.038461538461538) internal successors, (183), 25 states have internal predecessors, (183), 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 71 [2025-02-07 17:27:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:35,729 INFO L225 Difference]: With dead ends: 17371 [2025-02-07 17:27:35,729 INFO L226 Difference]: Without dead ends: 17360 [2025-02-07 17:27:35,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4661 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2486, Invalid=12766, Unknown=0, NotChecked=0, Total=15252 [2025-02-07 17:27:35,734 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 927 mSDsluCounter, 2757 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 3004 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:35,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 3004 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2096 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 17:27:35,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17360 states. [2025-02-07 17:27:36,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17360 to 5705. [2025-02-07 17:27:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5705 states, 5704 states have (on average 1.3432678821879382) internal successors, (7662), 5704 states have internal predecessors, (7662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5705 states to 5705 states and 7662 transitions. [2025-02-07 17:27:36,035 INFO L78 Accepts]: Start accepts. Automaton has 5705 states and 7662 transitions. Word has length 71 [2025-02-07 17:27:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:36,035 INFO L471 AbstractCegarLoop]: Abstraction has 5705 states and 7662 transitions. [2025-02-07 17:27:36,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.038461538461538) internal successors, (183), 25 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand 5705 states and 7662 transitions. [2025-02-07 17:27:36,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-07 17:27:36,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:36,038 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-07 17:27:36,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-07 17:27:36,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:36,238 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:36,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:36,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1912207892, now seen corresponding path program 1 times [2025-02-07 17:27:36,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:36,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051955484] [2025-02-07 17:27:36,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:36,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:36,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-07 17:27:36,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-07 17:27:36,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:36,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 4 proven. 75 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 17:27:36,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:36,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051955484] [2025-02-07 17:27:36,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051955484] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:36,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891528404] [2025-02-07 17:27:36,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:36,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:36,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:36,737 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-07 17:27:36,739 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-07 17:27:36,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-07 17:27:36,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-07 17:27:36,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:36,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:36,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 17:27:36,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-07 17:27:36,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:36,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891528404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:36,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:27:36,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2025-02-07 17:27:36,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625435933] [2025-02-07 17:27:36,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:36,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 17:27:36,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:36,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 17:27:36,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-02-07 17:27:36,976 INFO L87 Difference]: Start difference. First operand 5705 states and 7662 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:37,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:37,244 INFO L93 Difference]: Finished difference Result 5718 states and 7677 transitions. [2025-02-07 17:27:37,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 17:27:37,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-02-07 17:27:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:37,254 INFO L225 Difference]: With dead ends: 5718 [2025-02-07 17:27:37,254 INFO L226 Difference]: Without dead ends: 5714 [2025-02-07 17:27:37,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-02-07 17:27:37,256 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:37,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 155 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:27:37,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5714 states. [2025-02-07 17:27:37,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5714 to 5705. [2025-02-07 17:27:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5705 states, 5704 states have (on average 1.3432678821879382) internal successors, (7662), 5704 states have internal predecessors, (7662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5705 states to 5705 states and 7662 transitions. [2025-02-07 17:27:37,538 INFO L78 Accepts]: Start accepts. Automaton has 5705 states and 7662 transitions. Word has length 73 [2025-02-07 17:27:37,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:37,538 INFO L471 AbstractCegarLoop]: Abstraction has 5705 states and 7662 transitions. [2025-02-07 17:27:37,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 5705 states and 7662 transitions. [2025-02-07 17:27:37,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-07 17:27:37,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:37,541 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 17:27:37,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-07 17:27:37,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:37,742 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:37,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:37,742 INFO L85 PathProgramCache]: Analyzing trace with hash -846418350, now seen corresponding path program 1 times [2025-02-07 17:27:37,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:37,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010559808] [2025-02-07 17:27:37,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:37,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:37,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-07 17:27:37,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 17:27:37,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:37,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 17:27:37,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:37,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010559808] [2025-02-07 17:27:37,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010559808] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:37,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158338701] [2025-02-07 17:27:37,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:37,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:37,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:37,900 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:37,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-07 17:27:37,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-07 17:27:38,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 17:27:38,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:38,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:38,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-07 17:27:38,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 17:27:38,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:27:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 17:27:38,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158338701] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:27:38,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:27:38,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-07 17:27:38,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53423697] [2025-02-07 17:27:38,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:27:38,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 17:27:38,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:38,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 17:27:38,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-07 17:27:38,962 INFO L87 Difference]: Start difference. First operand 5705 states and 7662 transitions. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:39,523 INFO L93 Difference]: Finished difference Result 10956 states and 14249 transitions. [2025-02-07 17:27:39,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 17:27:39,523 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 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 74 [2025-02-07 17:27:39,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:39,537 INFO L225 Difference]: With dead ends: 10956 [2025-02-07 17:27:39,537 INFO L226 Difference]: Without dead ends: 10952 [2025-02-07 17:27:39,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 141 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2025-02-07 17:27:39,539 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 264 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:39,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 521 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:39,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10952 states. [2025-02-07 17:27:39,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10952 to 7077. [2025-02-07 17:27:39,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7077 states, 7076 states have (on average 1.3928773318258902) internal successors, (9856), 7076 states have internal predecessors, (9856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7077 states to 7077 states and 9856 transitions. [2025-02-07 17:27:39,809 INFO L78 Accepts]: Start accepts. Automaton has 7077 states and 9856 transitions. Word has length 74 [2025-02-07 17:27:39,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:39,809 INFO L471 AbstractCegarLoop]: Abstraction has 7077 states and 9856 transitions. [2025-02-07 17:27:39,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:39,810 INFO L276 IsEmpty]: Start isEmpty. Operand 7077 states and 9856 transitions. [2025-02-07 17:27:39,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 17:27:39,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:39,813 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:39,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-07 17:27:40,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-07 17:27:40,016 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:40,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:40,016 INFO L85 PathProgramCache]: Analyzing trace with hash -615683740, now seen corresponding path program 1 times [2025-02-07 17:27:40,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:40,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523380492] [2025-02-07 17:27:40,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:40,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:40,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 17:27:40,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 17:27:40,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:40,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 50 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-07 17:27:40,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:27:40,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523380492] [2025-02-07 17:27:40,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523380492] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:27:40,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755957577] [2025-02-07 17:27:40,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:40,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:40,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:40,140 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:40,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-07 17:27:40,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 17:27:40,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 17:27:40,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:40,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:40,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 17:27:40,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-07 17:27:40,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:40,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755957577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:40,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 17:27:40,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2025-02-07 17:27:40,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253576301] [2025-02-07 17:27:40,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:40,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 17:27:40,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:27:40,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 17:27:40,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-07 17:27:40,354 INFO L87 Difference]: Start difference. First operand 7077 states and 9856 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:40,685 INFO L93 Difference]: Finished difference Result 12090 states and 16803 transitions. [2025-02-07 17:27:40,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 17:27:40,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-07 17:27:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:40,695 INFO L225 Difference]: With dead ends: 12090 [2025-02-07 17:27:40,695 INFO L226 Difference]: Without dead ends: 8207 [2025-02-07 17:27:40,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-07 17:27:40,699 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 124 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:40,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 577 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8207 states. [2025-02-07 17:27:41,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8207 to 6418. [2025-02-07 17:27:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6418 states, 6417 states have (on average 1.350319463923952) internal successors, (8665), 6417 states have internal predecessors, (8665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6418 states to 6418 states and 8665 transitions. [2025-02-07 17:27:41,062 INFO L78 Accepts]: Start accepts. Automaton has 6418 states and 8665 transitions. Word has length 75 [2025-02-07 17:27:41,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:41,062 INFO L471 AbstractCegarLoop]: Abstraction has 6418 states and 8665 transitions. [2025-02-07 17:27:41,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:41,062 INFO L276 IsEmpty]: Start isEmpty. Operand 6418 states and 8665 transitions. [2025-02-07 17:27:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 17:27:41,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:41,065 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 17:27:41,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-07 17:27:41,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-07 17:27:41,269 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:41,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:41,271 INFO L85 PathProgramCache]: Analyzing trace with hash -464039067, now seen corresponding path program 1 times [2025-02-07 17:27:41,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:27:41,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735812964] [2025-02-07 17:27:41,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:41,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:27:41,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 17:27:41,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 17:27:41,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:41,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 17:27:41,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 17:27:41,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 17:27:41,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 17:27:41,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:41,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 17:27:41,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 17:27:41,339 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 17:27:41,340 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 17:27:41,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-07 17:27:41,343 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:41,389 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 17:27:41,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 05:27:41 BoogieIcfgContainer [2025-02-07 17:27:41,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 17:27:41,392 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 17:27:41,393 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 17:27:41,393 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 17:27:41,393 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:27:12" (3/4) ... [2025-02-07 17:27:41,395 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 17:27:41,395 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 17:27:41,396 INFO L158 Benchmark]: Toolchain (without parser) took 29498.07ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 111.7MB in the beginning and 520.1MB in the end (delta: -408.4MB). Peak memory consumption was 295.5MB. Max. memory is 16.1GB. [2025-02-07 17:27:41,396 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 17:27:41,396 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.99ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 98.4MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 17:27:41,396 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.71ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.7MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 17:27:41,397 INFO L158 Benchmark]: Boogie Preprocessor took 40.09ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 93.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 17:27:41,397 INFO L158 Benchmark]: IcfgBuilder took 410.39ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 71.0MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 17:27:41,397 INFO L158 Benchmark]: TraceAbstraction took 28802.93ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 70.6MB in the beginning and 520.2MB in the end (delta: -449.6MB). Peak memory consumption was 253.5MB. Max. memory is 16.1GB. [2025-02-07 17:27:41,398 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 847.2MB. Free memory was 520.2MB in the beginning and 520.1MB in the end (delta: 129.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 17:27:41,399 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.99ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 98.4MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.71ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.7MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.09ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 93.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 410.39ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 71.0MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 28802.93ms. Allocated memory was 142.6MB in the beginning and 847.2MB in the end (delta: 704.6MB). Free memory was 70.6MB in the beginning and 520.2MB in the end (delta: -449.6MB). Peak memory consumption was 253.5MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 847.2MB. Free memory was 520.2MB in the beginning and 520.1MB in the end (delta: 129.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 116, overapproximation of bitwiseOr at line 116. Possible FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, na=4] [L68] nb = (unsigned char)4 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, na=4, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, na=4, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, na=4, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, na=4, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L89] COND TRUE i < nb VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=1, i=1, na=4, nb=1, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 [L85] partial_sum = partial_sum + a1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L89] COND FALSE !(i < nb) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L86] COND TRUE i == (unsigned char)2 [L86] partial_sum = partial_sum + a2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L89] COND FALSE !(i < nb) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L87] COND TRUE i == (unsigned char)3 [L87] partial_sum = partial_sum + a3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L89] COND FALSE !(i < nb) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, r0=0, r1=82, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, carry=0, i=4, na=4, nb=1, r0=0, r1=82, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, i=4, r0=0, r1=82, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, b1=0, b2=0, b3=0] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; [L130] RET, EXPR mp_add(a, b) [L130] r = mp_add(a, b) [L132] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.7s, OverallIterations: 27, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4800 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4800 mSDsluCounter, 11361 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9137 mSDsCounter, 479 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8502 IncrementalHoareTripleChecker+Invalid, 8981 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 479 mSolverCounterUnsat, 2224 mSDtfsCounter, 8502 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1835 GetRequests, 1358 SyntacticMatches, 7 SemanticMatches, 470 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9646 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7077occurred in iteration=25, InterpolantAutomatonStates: 395, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 26819 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2422 NumberOfCodeBlocks, 2422 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2724 ConstructedInterpolants, 9 QuantifiedInterpolants, 16008 SizeOfPredicates, 25 NumberOfNonLiveVariables, 2687 ConjunctsInSsa, 181 ConjunctsInUnsatCore, 47 InterpolantComputations, 20 PerfectInterpolantSequences, 1989/2917 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-07 17:27:41,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bitvector/byte_add_1-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:27:43,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:27:43,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-07 17:27:43,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:27:43,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:27:43,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:27:43,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:27:43,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:27:43,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:27:43,473 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:27:43,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:27:43,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:27:43,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:27:43,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:27:43,474 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:27:43,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:27:43,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:27:43,474 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:27:43,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:27:43,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:27:43,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:27:43,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:27:43,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:27:43,475 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 17:27:43,475 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 17:27:43,475 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 17:27:43,475 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:27:43,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:27:43,475 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:27:43,475 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:27:43,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:27:43,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:27:43,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:27:43,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:27:43,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:27:43,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:27:43,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:27:43,476 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:27:43,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:27:43,476 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 17:27:43,476 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 17:27:43,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:27:43,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:27:43,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:27:43,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:27:43,477 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2025-02-07 17:27:43,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:27:43,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:27:43,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:27:43,755 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:27:43,755 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:27:43,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2025-02-07 17:27:44,978 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/823ae5ab2/9508ba4e2ba34eabb547e9e067863980/FLAG60224ad85 [2025-02-07 17:27:45,198 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:27:45,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2025-02-07 17:27:45,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/823ae5ab2/9508ba4e2ba34eabb547e9e067863980/FLAG60224ad85 [2025-02-07 17:27:45,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/823ae5ab2/9508ba4e2ba34eabb547e9e067863980 [2025-02-07 17:27:45,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:27:45,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:27:45,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:27:45,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:27:45,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:27:45,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:27:45" (1/1) ... [2025-02-07 17:27:45,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c9c19c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:45, skipping insertion in model container [2025-02-07 17:27:45,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:27:45" (1/1) ... [2025-02-07 17:27:45,250 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:27:45,369 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2025-02-07 17:27:45,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:27:45,427 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:27:45,438 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/bitvector/byte_add_1-1.i[1168,1181] [2025-02-07 17:27:45,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:27:45,480 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:27:45,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:45 WrapperNode [2025-02-07 17:27:45,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:27:45,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:27:45,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:27:45,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:27:45,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:45" (1/1) ... [2025-02-07 17:27:45,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:45" (1/1) ... [2025-02-07 17:27:45,509 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2025-02-07 17:27:45,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:27:45,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:27:45,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:27:45,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:27:45,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:45" (1/1) ... [2025-02-07 17:27:45,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:45" (1/1) ... [2025-02-07 17:27:45,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:45" (1/1) ... [2025-02-07 17:27:45,531 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 17:27:45,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:45" (1/1) ... [2025-02-07 17:27:45,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:45" (1/1) ... [2025-02-07 17:27:45,536 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:45" (1/1) ... [2025-02-07 17:27:45,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:45" (1/1) ... [2025-02-07 17:27:45,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:45" (1/1) ... [2025-02-07 17:27:45,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:45" (1/1) ... [2025-02-07 17:27:45,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:27:45,545 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:27:45,545 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:27:45,545 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:27:45,546 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:45" (1/1) ... [2025-02-07 17:27:45,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:27:45,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:45,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 17:27:45,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 17:27:45,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:27:45,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 17:27:45,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:27:45,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:27:45,639 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:27:45,640 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:27:45,883 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-07 17:27:45,884 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:27:45,895 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:27:45,896 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:27:45,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:27:45 BoogieIcfgContainer [2025-02-07 17:27:45,897 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:27:45,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:27:45,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:27:45,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:27:45,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:27:45" (1/3) ... [2025-02-07 17:27:45,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32988347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:27:45, skipping insertion in model container [2025-02-07 17:27:45,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:27:45" (2/3) ... [2025-02-07 17:27:45,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32988347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:27:45, skipping insertion in model container [2025-02-07 17:27:45,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:27:45" (3/3) ... [2025-02-07 17:27:45,906 INFO L128 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2025-02-07 17:27:45,920 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:27:45,923 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG byte_add_1-1.i that has 1 procedures, 38 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 17:27:45,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:27:45,988 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;@3baad917, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:27:45,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:27:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 37 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 17:27:45,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:45,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:45,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:46,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:46,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1935047322, now seen corresponding path program 1 times [2025-02-07 17:27:46,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:27:46,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [336545522] [2025-02-07 17:27:46,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:46,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:46,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:46,016 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:46,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 17:27:46,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 17:27:46,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 17:27:46,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:46,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:46,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 17:27:46,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:46,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:46,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:27:46,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336545522] [2025-02-07 17:27:46,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336545522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:46,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:46,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:27:46,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708211638] [2025-02-07 17:27:46,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:46,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:27:46,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:27:46,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:27:46,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:27:46,161 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 37 states have internal predecessors, (65), 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 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:46,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:46,304 INFO L93 Difference]: Finished difference Result 90 states and 159 transitions. [2025-02-07 17:27:46,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:27:46,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-02-07 17:27:46,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:46,311 INFO L225 Difference]: With dead ends: 90 [2025-02-07 17:27:46,312 INFO L226 Difference]: Without dead ends: 58 [2025-02-07 17:27:46,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:27:46,318 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:46,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 59 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:46,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-07 17:27:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-02-07 17:27:46,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 55 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2025-02-07 17:27:46,377 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 9 [2025-02-07 17:27:46,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:46,377 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. [2025-02-07 17:27:46,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2025-02-07 17:27:46,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 17:27:46,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:46,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:46,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 17:27:46,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:46,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:46,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:46,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1449641932, now seen corresponding path program 1 times [2025-02-07 17:27:46,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:27:46,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1427570211] [2025-02-07 17:27:46,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:46,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:46,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:46,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:46,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 17:27:46,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 17:27:46,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 17:27:46,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:46,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:46,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 17:27:46,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:46,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:46,665 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:27:46,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427570211] [2025-02-07 17:27:46,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427570211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:46,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:46,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:27:46,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601490920] [2025-02-07 17:27:46,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:46,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:27:46,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:27:46,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:27:46,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:27:46,668 INFO L87 Difference]: Start difference. First operand 56 states and 86 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:46,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:46,823 INFO L93 Difference]: Finished difference Result 154 states and 242 transitions. [2025-02-07 17:27:46,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 17:27:46,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2025-02-07 17:27:46,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:46,825 INFO L225 Difference]: With dead ends: 154 [2025-02-07 17:27:46,826 INFO L226 Difference]: Without dead ends: 106 [2025-02-07 17:27:46,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:27:46,827 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 55 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:46,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 142 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:46,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-07 17:27:46,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2025-02-07 17:27:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.5346534653465347) internal successors, (155), 101 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2025-02-07 17:27:46,842 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 15 [2025-02-07 17:27:46,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:46,842 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2025-02-07 17:27:46,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:46,842 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2025-02-07 17:27:46,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-07 17:27:46,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:46,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:46,850 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-07 17:27:47,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:47,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:47,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:47,048 INFO L85 PathProgramCache]: Analyzing trace with hash -789382641, now seen corresponding path program 1 times [2025-02-07 17:27:47,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:27:47,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2107427773] [2025-02-07 17:27:47,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:47,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:47,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:47,052 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:47,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 17:27:47,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-07 17:27:47,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 17:27:47,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:47,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:47,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 17:27:47,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:27:47,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:47,106 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:27:47,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107427773] [2025-02-07 17:27:47,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107427773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:47,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:47,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 17:27:47,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397895650] [2025-02-07 17:27:47,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:47,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:27:47,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:27:47,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:27:47,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:27:47,107 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:47,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:47,118 INFO L93 Difference]: Finished difference Result 105 states and 157 transitions. [2025-02-07 17:27:47,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:27:47,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 16 [2025-02-07 17:27:47,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:47,119 INFO L225 Difference]: With dead ends: 105 [2025-02-07 17:27:47,120 INFO L226 Difference]: Without dead ends: 51 [2025-02-07 17:27:47,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:27:47,121 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 42 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:47,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 46 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:27:47,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-07 17:27:47,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-07 17:27:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.46) internal successors, (73), 50 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2025-02-07 17:27:47,128 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 16 [2025-02-07 17:27:47,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:47,128 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2025-02-07 17:27:47,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:47,129 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2025-02-07 17:27:47,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 17:27:47,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:47,129 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] [2025-02-07 17:27:47,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 17:27:47,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:47,330 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:47,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:47,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1048421669, now seen corresponding path program 1 times [2025-02-07 17:27:47,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:27:47,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [105571341] [2025-02-07 17:27:47,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:47,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:47,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:47,335 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:47,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 17:27:47,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 17:27:47,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 17:27:47,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:47,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:47,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 17:27:47,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:47,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:47,398 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:27:47,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105571341] [2025-02-07 17:27:47,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105571341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:47,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:47,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:27:47,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990304057] [2025-02-07 17:27:47,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:47,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 17:27:47,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:27:47,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 17:27:47,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:27:47,400 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:47,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:47,423 INFO L93 Difference]: Finished difference Result 66 states and 92 transitions. [2025-02-07 17:27:47,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 17:27:47,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-07 17:27:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:47,425 INFO L225 Difference]: With dead ends: 66 [2025-02-07 17:27:47,425 INFO L226 Difference]: Without dead ends: 62 [2025-02-07 17:27:47,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 17:27:47,425 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:47,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 86 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:27:47,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-07 17:27:47,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-07 17:27:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 61 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2025-02-07 17:27:47,430 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 22 [2025-02-07 17:27:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:47,430 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2025-02-07 17:27:47,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2025-02-07 17:27:47,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 17:27:47,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:47,431 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] [2025-02-07 17:27:47,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 17:27:47,631 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 [2025-02-07 17:27:47,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:47,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:47,632 INFO L85 PathProgramCache]: Analyzing trace with hash 851908164, now seen corresponding path program 1 times [2025-02-07 17:27:47,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:27:47,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [345444541] [2025-02-07 17:27:47,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:47,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:47,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:47,635 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:47,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 17:27:47,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 17:27:47,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 17:27:47,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:47,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:47,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 17:27:47,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:47,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:47,763 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:27:47,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345444541] [2025-02-07 17:27:47,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345444541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:47,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:47,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:27:47,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60070541] [2025-02-07 17:27:47,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:47,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:27:47,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:27:47,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:27:47,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:27:47,767 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:47,886 INFO L93 Difference]: Finished difference Result 174 states and 247 transitions. [2025-02-07 17:27:47,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:27:47,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-07 17:27:47,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:47,887 INFO L225 Difference]: With dead ends: 174 [2025-02-07 17:27:47,887 INFO L226 Difference]: Without dead ends: 122 [2025-02-07 17:27:47,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:27:47,888 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 41 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:47,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 94 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:47,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-07 17:27:47,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2025-02-07 17:27:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.4424778761061947) internal successors, (163), 113 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:47,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2025-02-07 17:27:47,918 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 22 [2025-02-07 17:27:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:47,918 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2025-02-07 17:27:47,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:47,920 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2025-02-07 17:27:47,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 17:27:47,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:47,920 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] [2025-02-07 17:27:47,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 17:27:48,121 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 [2025-02-07 17:27:48,121 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:48,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:48,122 INFO L85 PathProgramCache]: Analyzing trace with hash -367536388, now seen corresponding path program 1 times [2025-02-07 17:27:48,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:27:48,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1653859479] [2025-02-07 17:27:48,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:48,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:48,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:48,125 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:48,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 17:27:48,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 17:27:48,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 17:27:48,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:48,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:48,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 17:27:48,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:48,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:48,222 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:27:48,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653859479] [2025-02-07 17:27:48,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653859479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:48,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:48,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 17:27:48,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230589370] [2025-02-07 17:27:48,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:48,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 17:27:48,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:27:48,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 17:27:48,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:27:48,224 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:48,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:48,405 INFO L93 Difference]: Finished difference Result 226 states and 322 transitions. [2025-02-07 17:27:48,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 17:27:48,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2025-02-07 17:27:48,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:48,407 INFO L225 Difference]: With dead ends: 226 [2025-02-07 17:27:48,407 INFO L226 Difference]: Without dead ends: 174 [2025-02-07 17:27:48,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:27:48,409 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 75 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:48,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 186 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:27:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-02-07 17:27:48,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 114. [2025-02-07 17:27:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.4424778761061947) internal successors, (163), 113 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2025-02-07 17:27:48,422 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 23 [2025-02-07 17:27:48,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:48,422 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2025-02-07 17:27:48,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2025-02-07 17:27:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 17:27:48,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:48,423 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] [2025-02-07 17:27:48,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-07 17:27:48,624 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 [2025-02-07 17:27:48,624 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:48,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:48,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1277163519, now seen corresponding path program 1 times [2025-02-07 17:27:48,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:27:48,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107889380] [2025-02-07 17:27:48,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:48,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:48,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:48,628 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:48,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-07 17:27:48,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 17:27:48,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 17:27:48,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:48,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:48,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:27:48,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:48,754 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:48,754 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:27:48,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107889380] [2025-02-07 17:27:48,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107889380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:48,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:48,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 17:27:48,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248526669] [2025-02-07 17:27:48,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:48,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 17:27:48,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:27:48,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 17:27:48,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 17:27:48,755 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:48,892 INFO L93 Difference]: Finished difference Result 272 states and 388 transitions. [2025-02-07 17:27:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 17:27:48,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 24 [2025-02-07 17:27:48,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:48,893 INFO L225 Difference]: With dead ends: 272 [2025-02-07 17:27:48,893 INFO L226 Difference]: Without dead ends: 219 [2025-02-07 17:27:48,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 17:27:48,894 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 149 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:48,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 440 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-07 17:27:48,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 158. [2025-02-07 17:27:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.4331210191082802) internal successors, (225), 157 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 225 transitions. [2025-02-07 17:27:48,917 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 225 transitions. Word has length 24 [2025-02-07 17:27:48,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:48,917 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 225 transitions. [2025-02-07 17:27:48,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:48,917 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 225 transitions. [2025-02-07 17:27:48,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 17:27:48,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:48,920 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] [2025-02-07 17:27:48,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-07 17:27:49,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:49,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:49,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:49,122 INFO L85 PathProgramCache]: Analyzing trace with hash -2121635390, now seen corresponding path program 1 times [2025-02-07 17:27:49,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:27:49,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1695900062] [2025-02-07 17:27:49,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:49,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:49,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:49,124 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:49,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-07 17:27:49,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-07 17:27:49,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 17:27:49,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:49,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:49,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 17:27:49,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:49,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:49,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:49,222 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:27:49,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695900062] [2025-02-07 17:27:49,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695900062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:49,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:49,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 17:27:49,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487753087] [2025-02-07 17:27:49,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:49,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 17:27:49,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:27:49,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 17:27:49,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 17:27:49,223 INFO L87 Difference]: Start difference. First operand 158 states and 225 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:49,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:49,327 INFO L93 Difference]: Finished difference Result 270 states and 383 transitions. [2025-02-07 17:27:49,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 17:27:49,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 24 [2025-02-07 17:27:49,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:49,328 INFO L225 Difference]: With dead ends: 270 [2025-02-07 17:27:49,328 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 17:27:49,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 17:27:49,329 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 123 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:49,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 255 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:49,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 17:27:49,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 106. [2025-02-07 17:27:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.4190476190476191) internal successors, (149), 105 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:49,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 149 transitions. [2025-02-07 17:27:49,338 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 149 transitions. Word has length 24 [2025-02-07 17:27:49,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:49,339 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 149 transitions. [2025-02-07 17:27:49,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:49,340 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 149 transitions. [2025-02-07 17:27:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 17:27:49,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:49,340 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] [2025-02-07 17:27:49,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-07 17:27:49,541 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 [2025-02-07 17:27:49,541 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:49,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:49,541 INFO L85 PathProgramCache]: Analyzing trace with hash 583713888, now seen corresponding path program 1 times [2025-02-07 17:27:49,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:27:49,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [948324508] [2025-02-07 17:27:49,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:49,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:49,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:49,544 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:49,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-07 17:27:49,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 17:27:49,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 17:27:49,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:49,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:49,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 17:27:49,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:49,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:27:49,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:49,680 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:27:49,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948324508] [2025-02-07 17:27:49,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948324508] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:27:49,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:27:49,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-02-07 17:27:49,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505091076] [2025-02-07 17:27:49,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:27:49,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 17:27:49,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:27:49,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 17:27:49,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 17:27:49,683 INFO L87 Difference]: Start difference. First operand 106 states and 149 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:49,865 INFO L93 Difference]: Finished difference Result 409 states and 609 transitions. [2025-02-07 17:27:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 17:27:49,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 26 [2025-02-07 17:27:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:49,867 INFO L225 Difference]: With dead ends: 409 [2025-02-07 17:27:49,867 INFO L226 Difference]: Without dead ends: 299 [2025-02-07 17:27:49,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-07 17:27:49,868 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 77 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:49,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 65 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:27:49,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-07 17:27:49,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 222. [2025-02-07 17:27:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:49,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 326 transitions. [2025-02-07 17:27:49,883 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 326 transitions. Word has length 26 [2025-02-07 17:27:49,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:49,884 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 326 transitions. [2025-02-07 17:27:49,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:49,884 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 326 transitions. [2025-02-07 17:27:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-07 17:27:49,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:49,885 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:49,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-07 17:27:50,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:50,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:50,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:50,086 INFO L85 PathProgramCache]: Analyzing trace with hash 616161972, now seen corresponding path program 1 times [2025-02-07 17:27:50,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:27:50,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1215635083] [2025-02-07 17:27:50,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:50,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:50,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:50,090 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:50,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-07 17:27:50,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-07 17:27:50,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-07 17:27:50,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:50,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:50,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 17:27:50,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 17:27:50,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:50,171 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:27:50,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215635083] [2025-02-07 17:27:50,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215635083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:50,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:50,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:27:50,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788613118] [2025-02-07 17:27:50,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:50,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:27:50,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:27:50,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:27:50,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:27:50,172 INFO L87 Difference]: Start difference. First operand 222 states and 326 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-07 17:27:50,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:50,249 INFO L93 Difference]: Finished difference Result 598 states and 874 transitions. [2025-02-07 17:27:50,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:27:50,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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 61 [2025-02-07 17:27:50,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:50,250 INFO L225 Difference]: With dead ends: 598 [2025-02-07 17:27:50,251 INFO L226 Difference]: Without dead ends: 390 [2025-02-07 17:27:50,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:27:50,251 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 24 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:50,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 144 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:50,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-02-07 17:27:50,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 314. [2025-02-07 17:27:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 1.4856230031948883) internal successors, (465), 313 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 465 transitions. [2025-02-07 17:27:50,262 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 465 transitions. Word has length 61 [2025-02-07 17:27:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:50,262 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 465 transitions. [2025-02-07 17:27:50,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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-07 17:27:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 465 transitions. [2025-02-07 17:27:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-07 17:27:50,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:50,263 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:50,271 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-07 17:27:50,468 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 [2025-02-07 17:27:50,468 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:50,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:50,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1860926453, now seen corresponding path program 2 times [2025-02-07 17:27:50,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:27:50,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416156271] [2025-02-07 17:27:50,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:27:50,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:50,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:50,471 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:50,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-07 17:27:50,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-07 17:27:50,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-02-07 17:27:50,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:27:50,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:50,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 17:27:50,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-07 17:27:50,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:50,605 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:27:50,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416156271] [2025-02-07 17:27:50,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416156271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:50,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:50,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:27:50,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033043493] [2025-02-07 17:27:50,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:50,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:27:50,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:27:50,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:27:50,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:27:50,609 INFO L87 Difference]: Start difference. First operand 314 states and 465 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:50,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:50,695 INFO L93 Difference]: Finished difference Result 658 states and 980 transitions. [2025-02-07 17:27:50,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:27:50,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-02-07 17:27:50,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:50,697 INFO L225 Difference]: With dead ends: 658 [2025-02-07 17:27:50,697 INFO L226 Difference]: Without dead ends: 486 [2025-02-07 17:27:50,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:27:50,697 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 22 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:50,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 93 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:50,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-02-07 17:27:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2025-02-07 17:27:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 1.488659793814433) internal successors, (722), 485 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 722 transitions. [2025-02-07 17:27:50,722 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 722 transitions. Word has length 61 [2025-02-07 17:27:50,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:50,722 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 722 transitions. [2025-02-07 17:27:50,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 722 transitions. [2025-02-07 17:27:50,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-07 17:27:50,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:50,723 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:27:50,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-07 17:27:50,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:50,924 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:50,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:50,925 INFO L85 PathProgramCache]: Analyzing trace with hash 801627197, now seen corresponding path program 1 times [2025-02-07 17:27:50,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:27:50,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1840320684] [2025-02-07 17:27:50,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:50,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:50,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:50,927 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:50,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-07 17:27:50,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-07 17:27:50,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-07 17:27:50,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:50,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:50,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 17:27:50,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 17:27:51,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:27:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 25 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:51,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:27:51,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840320684] [2025-02-07 17:27:51,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840320684] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:27:51,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:27:51,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2025-02-07 17:27:51,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584887036] [2025-02-07 17:27:51,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:27:51,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 17:27:51,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:27:51,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 17:27:51,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-02-07 17:27:51,380 INFO L87 Difference]: Start difference. First operand 486 states and 722 transitions. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:51,620 INFO L93 Difference]: Finished difference Result 1040 states and 1569 transitions. [2025-02-07 17:27:51,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 17:27:51,621 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 11 states have internal predecessors, (107), 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 62 [2025-02-07 17:27:51,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:51,623 INFO L225 Difference]: With dead ends: 1040 [2025-02-07 17:27:51,623 INFO L226 Difference]: Without dead ends: 571 [2025-02-07 17:27:51,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2025-02-07 17:27:51,624 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 144 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:51,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 76 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:27:51,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-02-07 17:27:51,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 515. [2025-02-07 17:27:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 1.3735408560311284) internal successors, (706), 514 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 706 transitions. [2025-02-07 17:27:51,641 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 706 transitions. Word has length 62 [2025-02-07 17:27:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:51,641 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 706 transitions. [2025-02-07 17:27:51,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 706 transitions. [2025-02-07 17:27:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-07 17:27:51,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:51,642 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-07 17:27:51,649 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-07 17:27:51,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:51,847 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:51,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:51,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2062117753, now seen corresponding path program 1 times [2025-02-07 17:27:51,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:27:51,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841671540] [2025-02-07 17:27:51,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:51,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:51,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:51,849 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-07 17:27:51,851 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-07 17:27:51,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-07 17:27:51,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-07 17:27:51,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:51,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:51,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 17:27:51,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-07 17:27:51,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:27:51,949 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:27:51,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841671540] [2025-02-07 17:27:51,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841671540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:27:51,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:27:51,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 17:27:51,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986856988] [2025-02-07 17:27:51,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:27:51,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 17:27:51,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:27:51,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 17:27:51,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:27:51,949 INFO L87 Difference]: Start difference. First operand 515 states and 706 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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-07 17:27:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:52,060 INFO L93 Difference]: Finished difference Result 881 states and 1209 transitions. [2025-02-07 17:27:52,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 17:27:52,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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 66 [2025-02-07 17:27:52,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:52,063 INFO L225 Difference]: With dead ends: 881 [2025-02-07 17:27:52,063 INFO L226 Difference]: Without dead ends: 698 [2025-02-07 17:27:52,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:27:52,064 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 56 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:52,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 175 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:52,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-02-07 17:27:52,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 515. [2025-02-07 17:27:52,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 1.3735408560311284) internal successors, (706), 514 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 706 transitions. [2025-02-07 17:27:52,081 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 706 transitions. Word has length 66 [2025-02-07 17:27:52,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:52,082 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 706 transitions. [2025-02-07 17:27:52,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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-07 17:27:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 706 transitions. [2025-02-07 17:27:52,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-07 17:27:52,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:52,084 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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-07 17:27:52,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-07 17:27:52,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:52,285 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:52,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:52,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1927981396, now seen corresponding path program 1 times [2025-02-07 17:27:52,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:27:52,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [377146596] [2025-02-07 17:27:52,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:27:52,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:52,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:52,288 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:52,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-07 17:27:52,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-07 17:27:52,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-07 17:27:52,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:27:52,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:52,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 17:27:52,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-07 17:27:52,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:27:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-07 17:27:52,493 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:27:52,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377146596] [2025-02-07 17:27:52,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377146596] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:27:52,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:27:52,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-07 17:27:52,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224766325] [2025-02-07 17:27:52,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:27:52,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 17:27:52,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:27:52,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 17:27:52,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-07 17:27:52,496 INFO L87 Difference]: Start difference. First operand 515 states and 706 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:52,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:52,740 INFO L93 Difference]: Finished difference Result 1050 states and 1389 transitions. [2025-02-07 17:27:52,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 17:27:52,740 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 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 67 [2025-02-07 17:27:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:52,742 INFO L225 Difference]: With dead ends: 1050 [2025-02-07 17:27:52,742 INFO L226 Difference]: Without dead ends: 732 [2025-02-07 17:27:52,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2025-02-07 17:27:52,743 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 216 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:52,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 222 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:52,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-02-07 17:27:52,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 516. [2025-02-07 17:27:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 1.370873786407767) internal successors, (706), 515 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 706 transitions. [2025-02-07 17:27:52,765 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 706 transitions. Word has length 67 [2025-02-07 17:27:52,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:52,765 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 706 transitions. [2025-02-07 17:27:52,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 706 transitions. [2025-02-07 17:27:52,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-07 17:27:52,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:52,767 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-07 17:27:52,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-07 17:27:52,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:52,968 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:52,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:52,968 INFO L85 PathProgramCache]: Analyzing trace with hash -416685645, now seen corresponding path program 2 times [2025-02-07 17:27:52,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:27:52,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1446653621] [2025-02-07 17:27:52,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:27:52,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:52,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:52,972 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:52,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-07 17:27:53,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-02-07 17:27:53,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-02-07 17:27:53,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:27:53,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:53,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 17:27:53,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:53,118 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 17:27:53,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:27:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 17:27:53,170 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:27:53,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446653621] [2025-02-07 17:27:53,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446653621] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:27:53,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:27:53,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-07 17:27:53,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12710244] [2025-02-07 17:27:53,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:27:53,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 17:27:53,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:27:53,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 17:27:53,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 17:27:53,172 INFO L87 Difference]: Start difference. First operand 516 states and 706 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:27:53,391 INFO L93 Difference]: Finished difference Result 1181 states and 1576 transitions. [2025-02-07 17:27:53,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 17:27:53,391 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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 67 [2025-02-07 17:27:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:27:53,394 INFO L225 Difference]: With dead ends: 1181 [2025-02-07 17:27:53,394 INFO L226 Difference]: Without dead ends: 683 [2025-02-07 17:27:53,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2025-02-07 17:27:53,396 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 122 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:27:53,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 253 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:27:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-02-07 17:27:53,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 449. [2025-02-07 17:27:53,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.3526785714285714) internal successors, (606), 448 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:53,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 606 transitions. [2025-02-07 17:27:53,416 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 606 transitions. Word has length 67 [2025-02-07 17:27:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:27:53,417 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 606 transitions. [2025-02-07 17:27:53,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:27:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 606 transitions. [2025-02-07 17:27:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-07 17:27:53,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:27:53,418 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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-07 17:27:53,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-07 17:27:53,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:53,619 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:27:53,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:27:53,620 INFO L85 PathProgramCache]: Analyzing trace with hash 828078836, now seen corresponding path program 3 times [2025-02-07 17:27:53,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:27:53,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1928680749] [2025-02-07 17:27:53,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:27:53,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:27:53,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:27:53,623 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:27:53,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-07 17:27:53,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 5 equivalence classes. [2025-02-07 17:27:53,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 67 of 67 statements. [2025-02-07 17:27:53,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-07 17:27:53,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:27:53,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-07 17:27:53,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:27:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:56,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:27:57,708 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:27:57,709 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:27:57,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928680749] [2025-02-07 17:27:57,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928680749] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:27:57,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:27:57,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 42 [2025-02-07 17:27:57,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812076183] [2025-02-07 17:27:57,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:27:57,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-07 17:27:57,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:27:57,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-07 17:27:57,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1662, Unknown=0, NotChecked=0, Total=1806 [2025-02-07 17:27:57,710 INFO L87 Difference]: Start difference. First operand 449 states and 606 transitions. Second operand has 43 states, 43 states have (on average 3.0930232558139537) internal successors, (133), 42 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:28:07,366 INFO L93 Difference]: Finished difference Result 1299 states and 1661 transitions. [2025-02-07 17:28:07,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-02-07 17:28:07,366 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.0930232558139537) internal successors, (133), 42 states have internal predecessors, (133), 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 67 [2025-02-07 17:28:07,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:28:07,370 INFO L225 Difference]: With dead ends: 1299 [2025-02-07 17:28:07,370 INFO L226 Difference]: Without dead ends: 1199 [2025-02-07 17:28:07,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2916 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2422, Invalid=11858, Unknown=0, NotChecked=0, Total=14280 [2025-02-07 17:28:07,373 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 1678 mSDsluCounter, 4849 mSDsCounter, 0 mSdLazyCounter, 3319 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 5110 SdHoareTripleChecker+Invalid, 3410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-07 17:28:07,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1678 Valid, 5110 Invalid, 3410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3319 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-07 17:28:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2025-02-07 17:28:07,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 654. [2025-02-07 17:28:07,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 1.324655436447167) internal successors, (865), 653 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:07,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 865 transitions. [2025-02-07 17:28:07,412 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 865 transitions. Word has length 67 [2025-02-07 17:28:07,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:28:07,413 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 865 transitions. [2025-02-07 17:28:07,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.0930232558139537) internal successors, (133), 42 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 865 transitions. [2025-02-07 17:28:07,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-07 17:28:07,414 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:28:07,414 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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-07 17:28:07,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-07 17:28:07,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:07,618 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:28:07,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:28:07,619 INFO L85 PathProgramCache]: Analyzing trace with hash -979768685, now seen corresponding path program 1 times [2025-02-07 17:28:07,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:28:07,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101651919] [2025-02-07 17:28:07,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:28:07,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:07,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:28:07,621 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:28:07,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-07 17:28:07,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-07 17:28:07,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-07 17:28:07,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:28:07,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:07,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:28:07,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:28:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-07 17:28:07,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:28:07,709 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:28:07,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101651919] [2025-02-07 17:28:07,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101651919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:28:07,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:28:07,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 17:28:07,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791566393] [2025-02-07 17:28:07,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:28:07,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 17:28:07,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:28:07,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 17:28:07,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 17:28:07,715 INFO L87 Difference]: Start difference. First operand 654 states and 865 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 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-07 17:28:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:28:07,870 INFO L93 Difference]: Finished difference Result 998 states and 1339 transitions. [2025-02-07 17:28:07,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 17:28:07,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 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 67 [2025-02-07 17:28:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:28:07,873 INFO L225 Difference]: With dead ends: 998 [2025-02-07 17:28:07,873 INFO L226 Difference]: Without dead ends: 826 [2025-02-07 17:28:07,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 17:28:07,874 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 90 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:28:07,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 329 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:28:07,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2025-02-07 17:28:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 482. [2025-02-07 17:28:07,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 1.3035343035343034) internal successors, (627), 481 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:07,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 627 transitions. [2025-02-07 17:28:07,904 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 627 transitions. Word has length 67 [2025-02-07 17:28:07,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:28:07,904 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 627 transitions. [2025-02-07 17:28:07,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 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-07 17:28:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 627 transitions. [2025-02-07 17:28:07,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-07 17:28:07,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:28:07,905 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:28:07,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-07 17:28:08,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:08,106 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:28:08,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:28:08,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2045426092, now seen corresponding path program 1 times [2025-02-07 17:28:08,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:28:08,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [624278869] [2025-02-07 17:28:08,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:28:08,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:08,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:28:08,112 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:28:08,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-07 17:28:08,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-07 17:28:08,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-07 17:28:08,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:28:08,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:08,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 17:28:08,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:28:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-07 17:28:08,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 17:28:08,201 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:28:08,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624278869] [2025-02-07 17:28:08,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624278869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:28:08,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:28:08,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:28:08,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536335899] [2025-02-07 17:28:08,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:28:08,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:28:08,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:28:08,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:28:08,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:28:08,202 INFO L87 Difference]: Start difference. First operand 482 states and 627 transitions. 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-07 17:28:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:28:08,276 INFO L93 Difference]: Finished difference Result 825 states and 1099 transitions. [2025-02-07 17:28:08,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:28:08,277 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 69 [2025-02-07 17:28:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:28:08,279 INFO L225 Difference]: With dead ends: 825 [2025-02-07 17:28:08,279 INFO L226 Difference]: Without dead ends: 653 [2025-02-07 17:28:08,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:28:08,279 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 17 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:28:08,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 94 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:28:08,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-02-07 17:28:08,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2025-02-07 17:28:08,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 652 states have (on average 1.322085889570552) internal successors, (862), 652 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 862 transitions. [2025-02-07 17:28:08,316 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 862 transitions. Word has length 69 [2025-02-07 17:28:08,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:28:08,317 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 862 transitions. [2025-02-07 17:28:08,317 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-07 17:28:08,317 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 862 transitions. [2025-02-07 17:28:08,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-07 17:28:08,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:28:08,318 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:28:08,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-02-07 17:28:08,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:08,518 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:28:08,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:28:08,519 INFO L85 PathProgramCache]: Analyzing trace with hash -72986124, now seen corresponding path program 1 times [2025-02-07 17:28:08,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:28:08,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1919541547] [2025-02-07 17:28:08,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:28:08,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:08,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:28:08,521 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:28:08,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-07 17:28:08,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-07 17:28:08,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-07 17:28:08,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:28:08,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:08,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 17:28:08,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:28:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 48 proven. 31 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 17:28:08,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:28:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 48 proven. 31 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 17:28:08,852 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:28:08,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919541547] [2025-02-07 17:28:08,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919541547] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:28:08,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:28:08,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2025-02-07 17:28:08,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962578814] [2025-02-07 17:28:08,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:28:08,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 17:28:08,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:28:08,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 17:28:08,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-02-07 17:28:08,853 INFO L87 Difference]: Start difference. First operand 653 states and 862 transitions. Second operand has 14 states, 14 states have (on average 7.928571428571429) internal successors, (111), 14 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:09,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:28:09,487 INFO L93 Difference]: Finished difference Result 1586 states and 2090 transitions. [2025-02-07 17:28:09,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-07 17:28:09,488 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.928571428571429) internal successors, (111), 14 states have internal predecessors, (111), 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 70 [2025-02-07 17:28:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:28:09,490 INFO L225 Difference]: With dead ends: 1586 [2025-02-07 17:28:09,490 INFO L226 Difference]: Without dead ends: 927 [2025-02-07 17:28:09,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=754, Unknown=0, NotChecked=0, Total=1056 [2025-02-07 17:28:09,491 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 499 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 17:28:09,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 110 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 17:28:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-02-07 17:28:09,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 842. [2025-02-07 17:28:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 1.3103448275862069) internal successors, (1102), 841 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1102 transitions. [2025-02-07 17:28:09,550 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1102 transitions. Word has length 70 [2025-02-07 17:28:09,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:28:09,551 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1102 transitions. [2025-02-07 17:28:09,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.928571428571429) internal successors, (111), 14 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:28:09,551 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1102 transitions. [2025-02-07 17:28:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-07 17:28:09,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:28:09,552 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:28:09,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-07 17:28:09,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:09,752 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:28:09,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:28:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash -587287954, now seen corresponding path program 1 times [2025-02-07 17:28:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 17:28:09,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [424979738] [2025-02-07 17:28:09,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:28:09,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:28:09,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:28:09,755 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:28:09,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-07 17:28:09,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-07 17:28:09,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-07 17:28:09,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:28:09,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:28:09,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-07 17:28:09,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:28:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:11,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:28:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:28:14,053 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 17:28:14,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424979738] [2025-02-07 17:28:14,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424979738] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:28:14,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:28:14,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 44 [2025-02-07 17:28:14,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749783379] [2025-02-07 17:28:14,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:28:14,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-07 17:28:14,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 17:28:14,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-07 17:28:14,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1827, Unknown=0, NotChecked=0, Total=1980 [2025-02-07 17:28:14,054 INFO L87 Difference]: Start difference. First operand 842 states and 1102 transitions. Second operand has 45 states, 45 states have (on average 3.1333333333333333) internal successors, (141), 44 states have internal predecessors, (141), 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)