./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-3.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 c1488e8cfb75b9dc5828151c610bf861156ee926465c8d7b38aa1fb193fa6e77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:16:06,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:16:06,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:16:06,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:16:06,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:16:06,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:16:06,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:16:06,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:16:06,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:16:06,624 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:16:06,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:16:06,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:16:06,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:16:06,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:16:06,626 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:16:06,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:16:06,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:16:06,626 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:16:06,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:16:06,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:16:06,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:16:06,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:16:06,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:16:06,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:16:06,627 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:16:06,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:16:06,627 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:16:06,627 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:16:06,627 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:16:06,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:16:06,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:16:06,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:16:06,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:16:06,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:16:06,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:16:06,628 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:16:06,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:16:06,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:16:06,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:16:06,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:16:06,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:16:06,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:16:06,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:16:06,629 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 -> c1488e8cfb75b9dc5828151c610bf861156ee926465c8d7b38aa1fb193fa6e77 [2025-02-06 02:16:06,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:16:06,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:16:06,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:16:06,875 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:16:06,875 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:16:06,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-3.i [2025-02-06 02:16:08,157 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/202bcfa0c/60091a49a147457a91e92469f3d26598/FLAG2f0546f8d [2025-02-06 02:16:08,453 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:16:08,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-3.i [2025-02-06 02:16:08,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/202bcfa0c/60091a49a147457a91e92469f3d26598/FLAG2f0546f8d [2025-02-06 02:16:08,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/202bcfa0c/60091a49a147457a91e92469f3d26598 [2025-02-06 02:16:08,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:16:08,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:16:08,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:16:08,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:16:08,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:16:08,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:16:08" (1/1) ... [2025-02-06 02:16:08,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47167c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:08, skipping insertion in model container [2025-02-06 02:16:08,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:16:08" (1/1) ... [2025-02-06 02:16:08,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:16:08,912 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/hardness-nfm22/hardness_operatoramount_amount250_file-3.i[915,928] [2025-02-06 02:16:09,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:16:09,092 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:16:09,108 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/hardness-nfm22/hardness_operatoramount_amount250_file-3.i[915,928] [2025-02-06 02:16:09,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:16:09,191 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:16:09,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:09 WrapperNode [2025-02-06 02:16:09,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:16:09,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:16:09,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:16:09,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:16:09,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:09" (1/1) ... [2025-02-06 02:16:09,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:09" (1/1) ... [2025-02-06 02:16:09,277 INFO L138 Inliner]: procedures = 26, calls = 69, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 485 [2025-02-06 02:16:09,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:16:09,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:16:09,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:16:09,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:16:09,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:09" (1/1) ... [2025-02-06 02:16:09,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:09" (1/1) ... [2025-02-06 02:16:09,301 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:09" (1/1) ... [2025-02-06 02:16:09,317 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-06 02:16:09,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:09" (1/1) ... [2025-02-06 02:16:09,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:09" (1/1) ... [2025-02-06 02:16:09,329 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:09" (1/1) ... [2025-02-06 02:16:09,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:09" (1/1) ... [2025-02-06 02:16:09,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:09" (1/1) ... [2025-02-06 02:16:09,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:09" (1/1) ... [2025-02-06 02:16:09,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:16:09,339 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:16:09,339 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:16:09,339 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:16:09,340 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:09" (1/1) ... [2025-02-06 02:16:09,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:16:09,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:16:09,366 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-06 02:16:09,370 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-06 02:16:09,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:16:09,394 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:16:09,394 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:16:09,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:16:09,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:16:09,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:16:09,484 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:16:09,485 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:16:09,978 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L370: havoc property_#t~bitwise42#1;havoc property_#t~short43#1;havoc property_#t~bitwise44#1;havoc property_#t~short45#1;havoc property_#t~bitwise46#1;havoc property_#t~short47#1;havoc property_#t~bitwise48#1;havoc property_#t~short49#1;havoc property_#t~bitwise50#1;havoc property_#t~short51#1; [2025-02-06 02:16:10,056 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-02-06 02:16:10,056 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:16:10,096 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:16:10,097 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:16:10,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:16:10 BoogieIcfgContainer [2025-02-06 02:16:10,097 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:16:10,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:16:10,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:16:10,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:16:10,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:16:08" (1/3) ... [2025-02-06 02:16:10,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee8e46a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:16:10, skipping insertion in model container [2025-02-06 02:16:10,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:16:09" (2/3) ... [2025-02-06 02:16:10,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee8e46a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:16:10, skipping insertion in model container [2025-02-06 02:16:10,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:16:10" (3/3) ... [2025-02-06 02:16:10,106 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-3.i [2025-02-06 02:16:10,117 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:16:10,119 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-3.i that has 2 procedures, 208 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:16:10,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:16:10,178 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;@387af497, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:16:10,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:16:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 149 states have (on average 1.4899328859060403) internal successors, (222), 150 states have internal predecessors, (222), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 02:16:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-06 02:16:10,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:10,212 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:10,212 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:10,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:10,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1116557967, now seen corresponding path program 1 times [2025-02-06 02:16:10,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:10,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097784920] [2025-02-06 02:16:10,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:10,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:10,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-06 02:16:10,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-06 02:16:10,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:10,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:10,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-02-06 02:16:10,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:10,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097784920] [2025-02-06 02:16:10,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097784920] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:16:10,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163956408] [2025-02-06 02:16:10,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:10,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:16:10,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:16:10,795 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-06 02:16:10,797 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-06 02:16:10,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-06 02:16:11,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-06 02:16:11,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:11,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:11,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:16:11,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:16:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-02-06 02:16:11,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:16:11,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163956408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:11,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:16:11,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:16:11,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852140443] [2025-02-06 02:16:11,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:11,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:16:11,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:11,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:16:11,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:16:11,130 INFO L87 Difference]: Start difference. First operand has 208 states, 149 states have (on average 1.4899328859060403) internal successors, (222), 150 states have internal predecessors, (222), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-02-06 02:16:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:11,191 INFO L93 Difference]: Finished difference Result 410 states and 719 transitions. [2025-02-06 02:16:11,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:16:11,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) Word has length 372 [2025-02-06 02:16:11,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:11,201 INFO L225 Difference]: With dead ends: 410 [2025-02-06 02:16:11,202 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 02:16:11,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:16:11,211 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:11,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 318 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:16:11,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 02:16:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-02-06 02:16:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 147 states have (on average 1.469387755102041) internal successors, (216), 147 states have internal predecessors, (216), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 02:16:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 328 transitions. [2025-02-06 02:16:11,257 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 328 transitions. Word has length 372 [2025-02-06 02:16:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:11,257 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 328 transitions. [2025-02-06 02:16:11,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-02-06 02:16:11,258 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 328 transitions. [2025-02-06 02:16:11,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-06 02:16:11,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:11,267 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:11,285 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-06 02:16:11,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:16:11,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:11,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:11,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1267601709, now seen corresponding path program 1 times [2025-02-06 02:16:11,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:11,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945377742] [2025-02-06 02:16:11,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:11,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:11,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-06 02:16:11,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-06 02:16:11,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:11,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:16:12,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:12,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945377742] [2025-02-06 02:16:12,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945377742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:12,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:12,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:16:12,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731574641] [2025-02-06 02:16:12,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:12,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:16:12,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:12,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:16:12,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:16:12,122 INFO L87 Difference]: Start difference. First operand 205 states and 328 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:16:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:12,405 INFO L93 Difference]: Finished difference Result 594 states and 946 transitions. [2025-02-06 02:16:12,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:16:12,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 372 [2025-02-06 02:16:12,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:12,410 INFO L225 Difference]: With dead ends: 594 [2025-02-06 02:16:12,412 INFO L226 Difference]: Without dead ends: 392 [2025-02-06 02:16:12,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:16:12,415 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 387 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:12,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1231 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:16:12,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-06 02:16:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 386. [2025-02-06 02:16:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 310 states have (on average 1.5225806451612902) internal successors, (472), 312 states have internal predecessors, (472), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-06 02:16:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 616 transitions. [2025-02-06 02:16:12,453 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 616 transitions. Word has length 372 [2025-02-06 02:16:12,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:12,455 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 616 transitions. [2025-02-06 02:16:12,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:16:12,455 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 616 transitions. [2025-02-06 02:16:12,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-06 02:16:12,459 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:12,459 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:12,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:16:12,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:12,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash -604843378, now seen corresponding path program 1 times [2025-02-06 02:16:12,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:12,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794838513] [2025-02-06 02:16:12,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:12,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:12,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-06 02:16:12,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-06 02:16:12,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:12,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:16:13,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:13,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794838513] [2025-02-06 02:16:13,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794838513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:13,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:13,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:16:13,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887125566] [2025-02-06 02:16:13,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:13,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:16:13,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:13,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:16:13,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:16:13,484 INFO L87 Difference]: Start difference. First operand 386 states and 616 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:16:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:13,870 INFO L93 Difference]: Finished difference Result 1416 states and 2256 transitions. [2025-02-06 02:16:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:16:13,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 372 [2025-02-06 02:16:13,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:13,877 INFO L225 Difference]: With dead ends: 1416 [2025-02-06 02:16:13,878 INFO L226 Difference]: Without dead ends: 1033 [2025-02-06 02:16:13,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:16:13,880 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 409 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:13,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1342 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:16:13,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2025-02-06 02:16:13,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 827. [2025-02-06 02:16:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 708 states have (on average 1.5508474576271187) internal successors, (1098), 713 states have internal predecessors, (1098), 112 states have call successors, (112), 6 states have call predecessors, (112), 6 states have return successors, (112), 107 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 02:16:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1322 transitions. [2025-02-06 02:16:13,924 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1322 transitions. Word has length 372 [2025-02-06 02:16:13,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:13,925 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1322 transitions. [2025-02-06 02:16:13,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:16:13,925 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1322 transitions. [2025-02-06 02:16:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-06 02:16:13,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:13,929 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:13,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:16:13,930 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:13,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:13,934 INFO L85 PathProgramCache]: Analyzing trace with hash -845383507, now seen corresponding path program 1 times [2025-02-06 02:16:13,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:13,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876170689] [2025-02-06 02:16:13,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:13,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:13,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-06 02:16:14,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-06 02:16:14,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:14,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:16:14,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:14,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876170689] [2025-02-06 02:16:14,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876170689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:14,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:14,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:16:14,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550668740] [2025-02-06 02:16:14,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:14,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:16:14,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:14,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:16:14,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:16:14,587 INFO L87 Difference]: Start difference. First operand 827 states and 1322 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-02-06 02:16:15,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:15,681 INFO L93 Difference]: Finished difference Result 2487 states and 3936 transitions. [2025-02-06 02:16:15,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 02:16:15,681 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 372 [2025-02-06 02:16:15,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:15,688 INFO L225 Difference]: With dead ends: 2487 [2025-02-06 02:16:15,688 INFO L226 Difference]: Without dead ends: 1663 [2025-02-06 02:16:15,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-06 02:16:15,693 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 1571 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:15,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 1513 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:16:15,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-02-06 02:16:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1457. [2025-02-06 02:16:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1302 states have (on average 1.5614439324116745) internal successors, (2033), 1312 states have internal predecessors, (2033), 135 states have call successors, (135), 19 states have call predecessors, (135), 19 states have return successors, (135), 125 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-06 02:16:15,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 2303 transitions. [2025-02-06 02:16:15,838 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 2303 transitions. Word has length 372 [2025-02-06 02:16:15,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:15,839 INFO L471 AbstractCegarLoop]: Abstraction has 1457 states and 2303 transitions. [2025-02-06 02:16:15,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-02-06 02:16:15,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 2303 transitions. [2025-02-06 02:16:15,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-06 02:16:15,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:15,851 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:15,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:16:15,851 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:15,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:15,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1675163732, now seen corresponding path program 1 times [2025-02-06 02:16:15,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:15,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111515103] [2025-02-06 02:16:15,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:15,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:15,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-06 02:16:15,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-06 02:16:15,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:15,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:16,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:16:16,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:16,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111515103] [2025-02-06 02:16:16,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111515103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:16,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:16,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:16:16,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280159998] [2025-02-06 02:16:16,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:16,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:16:16,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:16,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:16:16,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:16:16,087 INFO L87 Difference]: Start difference. First operand 1457 states and 2303 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:16:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:16,586 INFO L93 Difference]: Finished difference Result 6750 states and 10499 transitions. [2025-02-06 02:16:16,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:16:16,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 372 [2025-02-06 02:16:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:16,605 INFO L225 Difference]: With dead ends: 6750 [2025-02-06 02:16:16,606 INFO L226 Difference]: Without dead ends: 5296 [2025-02-06 02:16:16,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:16:16,610 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 840 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:16,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1902 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:16:16,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5296 states. [2025-02-06 02:16:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5296 to 1841. [2025-02-06 02:16:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1686 states have (on average 1.5842230130486359) internal successors, (2671), 1696 states have internal predecessors, (2671), 135 states have call successors, (135), 19 states have call predecessors, (135), 19 states have return successors, (135), 125 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-06 02:16:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2941 transitions. [2025-02-06 02:16:16,704 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2941 transitions. Word has length 372 [2025-02-06 02:16:16,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:16,705 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2941 transitions. [2025-02-06 02:16:16,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:16:16,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2941 transitions. [2025-02-06 02:16:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-06 02:16:16,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:16,710 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:16,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:16:16,710 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:16,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:16,711 INFO L85 PathProgramCache]: Analyzing trace with hash -430399251, now seen corresponding path program 1 times [2025-02-06 02:16:16,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:16,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392955311] [2025-02-06 02:16:16,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:16,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:16,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-06 02:16:16,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-06 02:16:16,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:16,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:16:17,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:17,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392955311] [2025-02-06 02:16:17,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392955311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:17,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:17,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:16:17,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682286733] [2025-02-06 02:16:17,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:17,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:16:17,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:17,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:16:17,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:16:17,219 INFO L87 Difference]: Start difference. First operand 1841 states and 2941 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:16:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:17,578 INFO L93 Difference]: Finished difference Result 4203 states and 6673 transitions. [2025-02-06 02:16:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:16:17,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 372 [2025-02-06 02:16:17,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:17,588 INFO L225 Difference]: With dead ends: 4203 [2025-02-06 02:16:17,588 INFO L226 Difference]: Without dead ends: 2365 [2025-02-06 02:16:17,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:16:17,591 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 555 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:17,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1374 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:16:17,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2025-02-06 02:16:17,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 1851. [2025-02-06 02:16:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1851 states, 1691 states have (on average 1.582495564754583) internal successors, (2676), 1701 states have internal predecessors, (2676), 139 states have call successors, (139), 20 states have call predecessors, (139), 20 states have return successors, (139), 129 states have call predecessors, (139), 139 states have call successors, (139) [2025-02-06 02:16:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2954 transitions. [2025-02-06 02:16:17,660 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2954 transitions. Word has length 372 [2025-02-06 02:16:17,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:17,661 INFO L471 AbstractCegarLoop]: Abstraction has 1851 states and 2954 transitions. [2025-02-06 02:16:17,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:16:17,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2954 transitions. [2025-02-06 02:16:17,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-02-06 02:16:17,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:17,666 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:17,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:16:17,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:17,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:17,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1052793764, now seen corresponding path program 1 times [2025-02-06 02:16:17,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:17,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016018877] [2025-02-06 02:16:17,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:17,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:17,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-02-06 02:16:17,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-02-06 02:16:17,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:17,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:18,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:16:18,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:18,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016018877] [2025-02-06 02:16:18,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016018877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:18,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:18,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:16:18,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862040408] [2025-02-06 02:16:18,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:18,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:16:18,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:18,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:16:18,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:16:18,030 INFO L87 Difference]: Start difference. First operand 1851 states and 2954 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-02-06 02:16:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:19,210 INFO L93 Difference]: Finished difference Result 5128 states and 8154 transitions. [2025-02-06 02:16:19,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 02:16:19,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 373 [2025-02-06 02:16:19,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:19,221 INFO L225 Difference]: With dead ends: 5128 [2025-02-06 02:16:19,222 INFO L226 Difference]: Without dead ends: 3280 [2025-02-06 02:16:19,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:16:19,226 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 1705 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:19,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 1566 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 02:16:19,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3280 states. [2025-02-06 02:16:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3280 to 1897. [2025-02-06 02:16:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1737 states have (on average 1.583189407023604) internal successors, (2750), 1747 states have internal predecessors, (2750), 139 states have call successors, (139), 20 states have call predecessors, (139), 20 states have return successors, (139), 129 states have call predecessors, (139), 139 states have call successors, (139) [2025-02-06 02:16:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 3028 transitions. [2025-02-06 02:16:19,299 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 3028 transitions. Word has length 373 [2025-02-06 02:16:19,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:19,300 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 3028 transitions. [2025-02-06 02:16:19,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-02-06 02:16:19,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 3028 transitions. [2025-02-06 02:16:19,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-02-06 02:16:19,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:19,305 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:19,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:16:19,305 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:19,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:19,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1041477637, now seen corresponding path program 1 times [2025-02-06 02:16:19,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:19,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32772821] [2025-02-06 02:16:19,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:19,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:19,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-02-06 02:16:19,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-02-06 02:16:19,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:19,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:16:20,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:20,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32772821] [2025-02-06 02:16:20,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32772821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:20,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:20,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:16:20,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635780360] [2025-02-06 02:16:20,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:20,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:16:20,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:20,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:16:20,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:16:20,002 INFO L87 Difference]: Start difference. First operand 1897 states and 3028 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:16:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:20,453 INFO L93 Difference]: Finished difference Result 5203 states and 8292 transitions. [2025-02-06 02:16:20,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:16:20,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 373 [2025-02-06 02:16:20,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:20,470 INFO L225 Difference]: With dead ends: 5203 [2025-02-06 02:16:20,470 INFO L226 Difference]: Without dead ends: 3309 [2025-02-06 02:16:20,473 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-06 02:16:20,474 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 205 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:20,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 838 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:16:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2025-02-06 02:16:20,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 3305. [2025-02-06 02:16:20,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 3045 states have (on average 1.5779967159277504) internal successors, (4805), 3065 states have internal predecessors, (4805), 223 states have call successors, (223), 36 states have call predecessors, (223), 36 states have return successors, (223), 203 states have call predecessors, (223), 223 states have call successors, (223) [2025-02-06 02:16:20,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 5251 transitions. [2025-02-06 02:16:20,602 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 5251 transitions. Word has length 373 [2025-02-06 02:16:20,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:20,602 INFO L471 AbstractCegarLoop]: Abstraction has 3305 states and 5251 transitions. [2025-02-06 02:16:20,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:16:20,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 5251 transitions. [2025-02-06 02:16:20,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-06 02:16:20,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:20,611 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:20,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:16:20,611 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:20,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:20,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1830390566, now seen corresponding path program 1 times [2025-02-06 02:16:20,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:20,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55359836] [2025-02-06 02:16:20,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:20,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:20,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-06 02:16:20,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-06 02:16:20,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:20,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 93 proven. 231 refuted. 0 times theorem prover too weak. 5836 trivial. 0 not checked. [2025-02-06 02:16:21,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:21,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55359836] [2025-02-06 02:16:21,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55359836] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:16:21,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015036184] [2025-02-06 02:16:21,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:21,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:16:21,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:16:21,395 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-06 02:16:21,396 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-06 02:16:21,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-06 02:16:21,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-06 02:16:21,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:21,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:21,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 02:16:21,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:16:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3102 proven. 105 refuted. 0 times theorem prover too weak. 2953 trivial. 0 not checked. [2025-02-06 02:16:23,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:16:23,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 60 proven. 105 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-02-06 02:16:23,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015036184] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:16:23,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:16:23,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 21 [2025-02-06 02:16:23,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186145894] [2025-02-06 02:16:23,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:16:23,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 02:16:23,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:23,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 02:16:23,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2025-02-06 02:16:23,727 INFO L87 Difference]: Start difference. First operand 3305 states and 5251 transitions. Second operand has 21 states, 21 states have (on average 9.857142857142858) internal successors, (207), 21 states have internal predecessors, (207), 6 states have call successors, (152), 3 states have call predecessors, (152), 6 states have return successors, (153), 6 states have call predecessors, (153), 6 states have call successors, (153) [2025-02-06 02:16:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:24,939 INFO L93 Difference]: Finished difference Result 7900 states and 12478 transitions. [2025-02-06 02:16:24,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 02:16:24,940 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.857142857142858) internal successors, (207), 21 states have internal predecessors, (207), 6 states have call successors, (152), 3 states have call predecessors, (152), 6 states have return successors, (153), 6 states have call predecessors, (153), 6 states have call successors, (153) Word has length 374 [2025-02-06 02:16:24,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:24,957 INFO L225 Difference]: With dead ends: 7900 [2025-02-06 02:16:24,957 INFO L226 Difference]: Without dead ends: 4598 [2025-02-06 02:16:24,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 737 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=380, Invalid=952, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 02:16:24,962 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1594 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:24,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 1035 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:16:24,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4598 states. [2025-02-06 02:16:25,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4598 to 4010. [2025-02-06 02:16:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4010 states, 3744 states have (on average 1.5809294871794872) internal successors, (5919), 3764 states have internal predecessors, (5919), 223 states have call successors, (223), 42 states have call predecessors, (223), 42 states have return successors, (223), 203 states have call predecessors, (223), 223 states have call successors, (223) [2025-02-06 02:16:25,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4010 states to 4010 states and 6365 transitions. [2025-02-06 02:16:25,159 INFO L78 Accepts]: Start accepts. Automaton has 4010 states and 6365 transitions. Word has length 374 [2025-02-06 02:16:25,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:25,160 INFO L471 AbstractCegarLoop]: Abstraction has 4010 states and 6365 transitions. [2025-02-06 02:16:25,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.857142857142858) internal successors, (207), 21 states have internal predecessors, (207), 6 states have call successors, (152), 3 states have call predecessors, (152), 6 states have return successors, (153), 6 states have call predecessors, (153), 6 states have call successors, (153) [2025-02-06 02:16:25,161 INFO L276 IsEmpty]: Start isEmpty. Operand 4010 states and 6365 transitions. [2025-02-06 02:16:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-06 02:16:25,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:25,171 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:25,179 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-06 02:16:25,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:16:25,372 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:25,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:25,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1729294844, now seen corresponding path program 1 times [2025-02-06 02:16:25,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:25,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199251788] [2025-02-06 02:16:25,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:25,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:25,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-06 02:16:25,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-06 02:16:25,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:25,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 27 proven. 138 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-02-06 02:16:25,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:25,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199251788] [2025-02-06 02:16:25,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199251788] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:16:25,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714520290] [2025-02-06 02:16:25,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:25,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:16:25,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:16:25,795 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-06 02:16:25,803 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-06 02:16:25,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-06 02:16:25,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-06 02:16:25,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:25,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:25,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 02:16:26,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:16:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 1729 proven. 138 refuted. 0 times theorem prover too weak. 4293 trivial. 0 not checked. [2025-02-06 02:16:26,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:16:26,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 27 proven. 138 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-02-06 02:16:26,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714520290] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:16:26,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:16:26,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-06 02:16:26,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129140116] [2025-02-06 02:16:26,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:16:26,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 02:16:26,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:26,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 02:16:26,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:16:26,585 INFO L87 Difference]: Start difference. First operand 4010 states and 6365 transitions. Second operand has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 3 states have call successors, (102), 2 states have call predecessors, (102), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) [2025-02-06 02:16:27,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:27,316 INFO L93 Difference]: Finished difference Result 7521 states and 11835 transitions. [2025-02-06 02:16:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 02:16:27,317 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 3 states have call successors, (102), 2 states have call predecessors, (102), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) Word has length 375 [2025-02-06 02:16:27,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:27,329 INFO L225 Difference]: With dead ends: 7521 [2025-02-06 02:16:27,329 INFO L226 Difference]: Without dead ends: 3514 [2025-02-06 02:16:27,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2025-02-06 02:16:27,336 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 734 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:27,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 1478 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:16:27,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2025-02-06 02:16:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 2606. [2025-02-06 02:16:27,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2606 states, 2385 states have (on average 1.5538784067085953) internal successors, (3706), 2397 states have internal predecessors, (3706), 179 states have call successors, (179), 41 states have call predecessors, (179), 41 states have return successors, (179), 167 states have call predecessors, (179), 179 states have call successors, (179) [2025-02-06 02:16:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 4064 transitions. [2025-02-06 02:16:27,433 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 4064 transitions. Word has length 375 [2025-02-06 02:16:27,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:27,434 INFO L471 AbstractCegarLoop]: Abstraction has 2606 states and 4064 transitions. [2025-02-06 02:16:27,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 3 states have call successors, (102), 2 states have call predecessors, (102), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) [2025-02-06 02:16:27,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 4064 transitions. [2025-02-06 02:16:27,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-06 02:16:27,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:27,439 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:27,449 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-06 02:16:27,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:16:27,640 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:27,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:27,640 INFO L85 PathProgramCache]: Analyzing trace with hash -271157570, now seen corresponding path program 1 times [2025-02-06 02:16:27,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:27,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030888536] [2025-02-06 02:16:27,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:27,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:27,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-06 02:16:27,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-06 02:16:27,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:27,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 60 proven. 105 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-02-06 02:16:28,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:28,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030888536] [2025-02-06 02:16:28,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030888536] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:16:28,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765817503] [2025-02-06 02:16:28,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:28,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:16:28,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:16:28,139 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-06 02:16:28,141 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-06 02:16:28,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-06 02:16:28,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-06 02:16:28,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:28,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:28,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 02:16:28,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:16:29,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 4131 proven. 288 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2025-02-06 02:16:29,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:16:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 60 proven. 105 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-02-06 02:16:30,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765817503] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:16:30,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:16:30,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 11] total 25 [2025-02-06 02:16:30,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069306225] [2025-02-06 02:16:30,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:16:30,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 02:16:30,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:30,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 02:16:30,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2025-02-06 02:16:30,767 INFO L87 Difference]: Start difference. First operand 2606 states and 4064 transitions. Second operand has 25 states, 25 states have (on average 8.32) internal successors, (208), 25 states have internal predecessors, (208), 8 states have call successors, (126), 5 states have call predecessors, (126), 10 states have return successors, (127), 8 states have call predecessors, (127), 8 states have call successors, (127) [2025-02-06 02:16:33,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:33,160 INFO L93 Difference]: Finished difference Result 7803 states and 12009 transitions. [2025-02-06 02:16:33,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-06 02:16:33,160 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.32) internal successors, (208), 25 states have internal predecessors, (208), 8 states have call successors, (126), 5 states have call predecessors, (126), 10 states have return successors, (127), 8 states have call predecessors, (127), 8 states have call successors, (127) Word has length 375 [2025-02-06 02:16:33,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:33,193 INFO L225 Difference]: With dead ends: 7803 [2025-02-06 02:16:33,193 INFO L226 Difference]: Without dead ends: 5200 [2025-02-06 02:16:33,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 736 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=712, Invalid=2368, Unknown=0, NotChecked=0, Total=3080 [2025-02-06 02:16:33,203 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 1273 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 2946 SdHoareTripleChecker+Invalid, 3037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:33,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 2946 Invalid, 3037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 2541 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 02:16:33,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2025-02-06 02:16:33,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 1932. [2025-02-06 02:16:33,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1750 states have (on average 1.4942857142857142) internal successors, (2615), 1757 states have internal predecessors, (2615), 141 states have call successors, (141), 40 states have call predecessors, (141), 40 states have return successors, (141), 134 states have call predecessors, (141), 141 states have call successors, (141) [2025-02-06 02:16:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2897 transitions. [2025-02-06 02:16:33,345 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2897 transitions. Word has length 375 [2025-02-06 02:16:33,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:33,346 INFO L471 AbstractCegarLoop]: Abstraction has 1932 states and 2897 transitions. [2025-02-06 02:16:33,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.32) internal successors, (208), 25 states have internal predecessors, (208), 8 states have call successors, (126), 5 states have call predecessors, (126), 10 states have return successors, (127), 8 states have call predecessors, (127), 8 states have call successors, (127) [2025-02-06 02:16:33,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2897 transitions. [2025-02-06 02:16:33,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-02-06 02:16:33,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:33,349 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:33,359 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-06 02:16:33,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 02:16:33,550 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:33,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:33,551 INFO L85 PathProgramCache]: Analyzing trace with hash 136224783, now seen corresponding path program 1 times [2025-02-06 02:16:33,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:33,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390823851] [2025-02-06 02:16:33,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:33,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:33,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-06 02:16:33,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-06 02:16:33,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:33,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:16:33,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:33,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390823851] [2025-02-06 02:16:33,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390823851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:33,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:33,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:16:33,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642486131] [2025-02-06 02:16:33,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:33,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:16:33,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:33,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:16:33,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:16:33,799 INFO L87 Difference]: Start difference. First operand 1932 states and 2897 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:16:34,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:34,310 INFO L93 Difference]: Finished difference Result 5678 states and 8580 transitions. [2025-02-06 02:16:34,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:16:34,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 376 [2025-02-06 02:16:34,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:34,329 INFO L225 Difference]: With dead ends: 5678 [2025-02-06 02:16:34,332 INFO L226 Difference]: Without dead ends: 3825 [2025-02-06 02:16:34,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:16:34,340 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 636 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:34,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 951 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:16:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3825 states. [2025-02-06 02:16:34,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3825 to 2464. [2025-02-06 02:16:34,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2464 states, 2268 states have (on average 1.502204585537919) internal successors, (3407), 2277 states have internal predecessors, (3407), 151 states have call successors, (151), 44 states have call predecessors, (151), 44 states have return successors, (151), 142 states have call predecessors, (151), 151 states have call successors, (151) [2025-02-06 02:16:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 3709 transitions. [2025-02-06 02:16:34,517 INFO L78 Accepts]: Start accepts. Automaton has 2464 states and 3709 transitions. Word has length 376 [2025-02-06 02:16:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:34,518 INFO L471 AbstractCegarLoop]: Abstraction has 2464 states and 3709 transitions. [2025-02-06 02:16:34,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-02-06 02:16:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 3709 transitions. [2025-02-06 02:16:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-02-06 02:16:34,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:34,522 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:34,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:16:34,522 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:34,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:34,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2074998066, now seen corresponding path program 1 times [2025-02-06 02:16:34,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:34,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618981352] [2025-02-06 02:16:34,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:34,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:34,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-06 02:16:34,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-06 02:16:34,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:34,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 27 proven. 138 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-02-06 02:16:35,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:35,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618981352] [2025-02-06 02:16:35,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618981352] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:16:35,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004175570] [2025-02-06 02:16:35,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:35,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:16:35,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:16:35,451 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-06 02:16:35,453 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-06 02:16:35,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-06 02:16:35,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-06 02:16:35,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:35,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:35,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 02:16:35,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:16:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 1676 proven. 288 refuted. 0 times theorem prover too weak. 4196 trivial. 0 not checked. [2025-02-06 02:16:36,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:16:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 36 proven. 291 refuted. 0 times theorem prover too weak. 5833 trivial. 0 not checked. [2025-02-06 02:16:38,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004175570] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:16:38,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:16:38,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 16] total 35 [2025-02-06 02:16:38,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55383470] [2025-02-06 02:16:38,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:16:38,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 02:16:38,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:38,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 02:16:38,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=990, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 02:16:38,202 INFO L87 Difference]: Start difference. First operand 2464 states and 3709 transitions. Second operand has 35 states, 34 states have (on average 6.205882352941177) internal successors, (211), 35 states have internal predecessors, (211), 8 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (161), 7 states have call predecessors, (161), 8 states have call successors, (161) [2025-02-06 02:16:44,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:44,069 INFO L93 Difference]: Finished difference Result 9952 states and 15012 transitions. [2025-02-06 02:16:44,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-02-06 02:16:44,070 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 6.205882352941177) internal successors, (211), 35 states have internal predecessors, (211), 8 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (161), 7 states have call predecessors, (161), 8 states have call successors, (161) Word has length 376 [2025-02-06 02:16:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:44,095 INFO L225 Difference]: With dead ends: 9952 [2025-02-06 02:16:44,099 INFO L226 Difference]: Without dead ends: 7567 [2025-02-06 02:16:44,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 744 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3039 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2300, Invalid=8412, Unknown=0, NotChecked=0, Total=10712 [2025-02-06 02:16:44,113 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 5820 mSDsluCounter, 6659 mSDsCounter, 0 mSdLazyCounter, 6453 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5828 SdHoareTripleChecker+Valid, 7323 SdHoareTripleChecker+Invalid, 6870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 6453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:44,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5828 Valid, 7323 Invalid, 6870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 6453 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-06 02:16:44,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7567 states. [2025-02-06 02:16:44,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7567 to 2391. [2025-02-06 02:16:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2391 states, 2212 states have (on average 1.5090415913200723) internal successors, (3338), 2218 states have internal predecessors, (3338), 136 states have call successors, (136), 42 states have call predecessors, (136), 42 states have return successors, (136), 130 states have call predecessors, (136), 136 states have call successors, (136) [2025-02-06 02:16:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3610 transitions. [2025-02-06 02:16:44,295 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3610 transitions. Word has length 376 [2025-02-06 02:16:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:44,296 INFO L471 AbstractCegarLoop]: Abstraction has 2391 states and 3610 transitions. [2025-02-06 02:16:44,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 6.205882352941177) internal successors, (211), 35 states have internal predecessors, (211), 8 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (161), 7 states have call predecessors, (161), 8 states have call successors, (161) [2025-02-06 02:16:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3610 transitions. [2025-02-06 02:16:44,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-02-06 02:16:44,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:44,300 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:44,310 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-06 02:16:44,501 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,SelfDestructingSolverStorable12 [2025-02-06 02:16:44,501 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:44,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:44,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1648304690, now seen corresponding path program 1 times [2025-02-06 02:16:44,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:44,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374781213] [2025-02-06 02:16:44,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:44,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:44,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-06 02:16:44,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-06 02:16:44,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:44,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:16:45,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:45,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374781213] [2025-02-06 02:16:45,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374781213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:45,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:45,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:16:45,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701580105] [2025-02-06 02:16:45,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:45,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:16:45,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:45,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:16:45,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:16:45,205 INFO L87 Difference]: Start difference. First operand 2391 states and 3610 transitions. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-02-06 02:16:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:46,373 INFO L93 Difference]: Finished difference Result 6370 states and 9653 transitions. [2025-02-06 02:16:46,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 02:16:46,373 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 376 [2025-02-06 02:16:46,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:46,390 INFO L225 Difference]: With dead ends: 6370 [2025-02-06 02:16:46,390 INFO L226 Difference]: Without dead ends: 4058 [2025-02-06 02:16:46,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:16:46,397 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 2120 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2120 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:46,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2120 Valid, 1138 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:16:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2025-02-06 02:16:46,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 2847. [2025-02-06 02:16:46,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2847 states, 2648 states have (on average 1.5018882175226587) internal successors, (3977), 2656 states have internal predecessors, (3977), 150 states have call successors, (150), 48 states have call predecessors, (150), 48 states have return successors, (150), 142 states have call predecessors, (150), 150 states have call successors, (150) [2025-02-06 02:16:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2847 states and 4277 transitions. [2025-02-06 02:16:46,533 INFO L78 Accepts]: Start accepts. Automaton has 2847 states and 4277 transitions. Word has length 376 [2025-02-06 02:16:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:46,533 INFO L471 AbstractCegarLoop]: Abstraction has 2847 states and 4277 transitions. [2025-02-06 02:16:46,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-02-06 02:16:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 4277 transitions. [2025-02-06 02:16:46,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-02-06 02:16:46,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:46,538 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:46,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:16:46,539 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:46,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:46,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1636988563, now seen corresponding path program 1 times [2025-02-06 02:16:46,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:46,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275076731] [2025-02-06 02:16:46,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:46,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:46,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-06 02:16:46,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-06 02:16:46,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:46,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-02-06 02:16:47,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:47,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275076731] [2025-02-06 02:16:47,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275076731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:47,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:47,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 02:16:47,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723652997] [2025-02-06 02:16:47,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:47,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 02:16:47,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:47,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 02:16:47,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:16:47,018 INFO L87 Difference]: Start difference. First operand 2847 states and 4277 transitions. Second operand has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-02-06 02:16:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:48,188 INFO L93 Difference]: Finished difference Result 6597 states and 9962 transitions. [2025-02-06 02:16:48,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 02:16:48,188 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 376 [2025-02-06 02:16:48,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:48,195 INFO L225 Difference]: With dead ends: 6597 [2025-02-06 02:16:48,196 INFO L226 Difference]: Without dead ends: 3829 [2025-02-06 02:16:48,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2025-02-06 02:16:48,199 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 2177 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2177 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:48,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2177 Valid, 1559 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:16:48,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3829 states. [2025-02-06 02:16:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3829 to 2771. [2025-02-06 02:16:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2771 states, 2572 states have (on average 1.5011664074650077) internal successors, (3861), 2580 states have internal predecessors, (3861), 150 states have call successors, (150), 48 states have call predecessors, (150), 48 states have return successors, (150), 142 states have call predecessors, (150), 150 states have call successors, (150) [2025-02-06 02:16:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 4161 transitions. [2025-02-06 02:16:48,331 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 4161 transitions. Word has length 376 [2025-02-06 02:16:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:48,332 INFO L471 AbstractCegarLoop]: Abstraction has 2771 states and 4161 transitions. [2025-02-06 02:16:48,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-02-06 02:16:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 4161 transitions. [2025-02-06 02:16:48,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-02-06 02:16:48,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:48,337 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:48,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:16:48,337 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:48,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:48,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1590371762, now seen corresponding path program 1 times [2025-02-06 02:16:48,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:48,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507636385] [2025-02-06 02:16:48,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:48,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:48,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-06 02:16:48,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-06 02:16:48,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:48,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 15 proven. 150 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-02-06 02:16:48,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:48,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507636385] [2025-02-06 02:16:48,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507636385] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:16:48,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556147467] [2025-02-06 02:16:48,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:48,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:16:48,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:16:48,668 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-06 02:16:48,669 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-06 02:16:48,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-06 02:16:48,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-06 02:16:48,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:48,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:48,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 02:16:48,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:16:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2013 proven. 132 refuted. 0 times theorem prover too weak. 4015 trivial. 0 not checked. [2025-02-06 02:16:49,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:16:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 33 proven. 132 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-02-06 02:16:49,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556147467] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:16:49,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:16:49,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2025-02-06 02:16:49,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311513492] [2025-02-06 02:16:49,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:16:49,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:16:49,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:49,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:16:49,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:16:49,558 INFO L87 Difference]: Start difference. First operand 2771 states and 4161 transitions. Second operand has 10 states, 10 states have (on average 22.5) internal successors, (225), 10 states have internal predecessors, (225), 4 states have call successors, (150), 2 states have call predecessors, (150), 4 states have return successors, (152), 4 states have call predecessors, (152), 4 states have call successors, (152) [2025-02-06 02:16:50,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:50,072 INFO L93 Difference]: Finished difference Result 5479 states and 8216 transitions. [2025-02-06 02:16:50,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 02:16:50,073 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 22.5) internal successors, (225), 10 states have internal predecessors, (225), 4 states have call successors, (150), 2 states have call predecessors, (150), 4 states have return successors, (152), 4 states have call predecessors, (152), 4 states have call successors, (152) Word has length 376 [2025-02-06 02:16:50,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:50,078 INFO L225 Difference]: With dead ends: 5479 [2025-02-06 02:16:50,078 INFO L226 Difference]: Without dead ends: 2787 [2025-02-06 02:16:50,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 747 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-02-06 02:16:50,081 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 449 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:50,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 540 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:16:50,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2787 states. [2025-02-06 02:16:50,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2787 to 2453. [2025-02-06 02:16:50,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2244 states have (on average 1.4696969696969697) internal successors, (3298), 2252 states have internal predecessors, (3298), 150 states have call successors, (150), 58 states have call predecessors, (150), 58 states have return successors, (150), 142 states have call predecessors, (150), 150 states have call successors, (150) [2025-02-06 02:16:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3598 transitions. [2025-02-06 02:16:50,193 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3598 transitions. Word has length 376 [2025-02-06 02:16:50,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:50,193 INFO L471 AbstractCegarLoop]: Abstraction has 2453 states and 3598 transitions. [2025-02-06 02:16:50,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.5) internal successors, (225), 10 states have internal predecessors, (225), 4 states have call successors, (150), 2 states have call predecessors, (150), 4 states have return successors, (152), 4 states have call predecessors, (152), 4 states have call successors, (152) [2025-02-06 02:16:50,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3598 transitions. [2025-02-06 02:16:50,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-02-06 02:16:50,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:50,197 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:50,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 02:16:50,397 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-06 02:16:50,398 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:50,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:50,398 INFO L85 PathProgramCache]: Analyzing trace with hash 493372685, now seen corresponding path program 1 times [2025-02-06 02:16:50,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:50,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810265762] [2025-02-06 02:16:50,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:50,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:50,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-06 02:16:50,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-06 02:16:50,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:50,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 63 proven. 414 refuted. 0 times theorem prover too weak. 5683 trivial. 0 not checked. [2025-02-06 02:16:51,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:51,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810265762] [2025-02-06 02:16:51,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810265762] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:16:51,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238217056] [2025-02-06 02:16:51,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:51,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:16:51,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:16:51,060 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-06 02:16:51,063 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-06 02:16:51,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-06 02:16:51,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-06 02:16:51,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:51,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:51,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 02:16:51,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:16:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 1727 proven. 417 refuted. 0 times theorem prover too weak. 4016 trivial. 0 not checked. [2025-02-06 02:16:52,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:16:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 60 proven. 426 refuted. 0 times theorem prover too weak. 5674 trivial. 0 not checked. [2025-02-06 02:16:52,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238217056] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:16:52,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:16:52,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 31 [2025-02-06 02:16:52,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408749114] [2025-02-06 02:16:52,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:16:52,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 02:16:52,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:52,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 02:16:52,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2025-02-06 02:16:52,823 INFO L87 Difference]: Start difference. First operand 2453 states and 3598 transitions. Second operand has 31 states, 29 states have (on average 7.0) internal successors, (203), 29 states have internal predecessors, (203), 10 states have call successors, (158), 4 states have call predecessors, (158), 9 states have return successors, (159), 9 states have call predecessors, (159), 10 states have call successors, (159) [2025-02-06 02:16:54,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:54,423 INFO L93 Difference]: Finished difference Result 5699 states and 8490 transitions. [2025-02-06 02:16:54,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 02:16:54,424 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 7.0) internal successors, (203), 29 states have internal predecessors, (203), 10 states have call successors, (158), 4 states have call predecessors, (158), 9 states have return successors, (159), 9 states have call predecessors, (159), 10 states have call successors, (159) Word has length 376 [2025-02-06 02:16:54,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:54,442 INFO L225 Difference]: With dead ends: 5699 [2025-02-06 02:16:54,445 INFO L226 Difference]: Without dead ends: 3333 [2025-02-06 02:16:54,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 796 GetRequests, 743 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=779, Invalid=2191, Unknown=0, NotChecked=0, Total=2970 [2025-02-06 02:16:54,453 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1368 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:54,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1370 Valid, 1598 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 02:16:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2025-02-06 02:16:54,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 1122. [2025-02-06 02:16:54,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 971 states have (on average 1.439752832131823) internal successors, (1398), 974 states have internal predecessors, (1398), 111 states have call successors, (111), 39 states have call predecessors, (111), 39 states have return successors, (111), 108 states have call predecessors, (111), 111 states have call successors, (111) [2025-02-06 02:16:54,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1620 transitions. [2025-02-06 02:16:54,669 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1620 transitions. Word has length 376 [2025-02-06 02:16:54,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:54,673 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1620 transitions. [2025-02-06 02:16:54,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 7.0) internal successors, (203), 29 states have internal predecessors, (203), 10 states have call successors, (158), 4 states have call predecessors, (158), 9 states have return successors, (159), 9 states have call predecessors, (159), 10 states have call successors, (159) [2025-02-06 02:16:54,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1620 transitions. [2025-02-06 02:16:54,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-02-06 02:16:54,675 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:54,675 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 02:16:54,684 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-06 02:16:54,876 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-06 02:16:54,876 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:54,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:54,878 INFO L85 PathProgramCache]: Analyzing trace with hash -2046784709, now seen corresponding path program 1 times [2025-02-06 02:16:54,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:54,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007465449] [2025-02-06 02:16:54,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:54,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:54,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-06 02:16:55,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-06 02:16:55,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:55,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:55,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 87 proven. 390 refuted. 0 times theorem prover too weak. 5683 trivial. 0 not checked. [2025-02-06 02:16:55,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:55,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007465449] [2025-02-06 02:16:55,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007465449] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:16:55,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350074804] [2025-02-06 02:16:55,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:55,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:16:55,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:16:55,734 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-06 02:16:55,738 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-06 02:16:55,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-02-06 02:16:55,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-02-06 02:16:55,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:55,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:55,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-06 02:16:55,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:16:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3097 proven. 606 refuted. 0 times theorem prover too weak. 2457 trivial. 0 not checked. [2025-02-06 02:16:58,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:17:08,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350074804] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:17:08,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 02:17:08,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 25] total 36 [2025-02-06 02:17:08,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285108325] [2025-02-06 02:17:08,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 02:17:08,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 02:17:08,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:17:08,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 02:17:08,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=2362, Unknown=1, NotChecked=0, Total=2862 [2025-02-06 02:17:08,351 INFO L87 Difference]: Start difference. First operand 1122 states and 1620 transitions. Second operand has 36 states, 35 states have (on average 5.228571428571429) internal successors, (183), 34 states have internal predecessors, (183), 9 states have call successors, (108), 6 states have call predecessors, (108), 9 states have return successors, (108), 8 states have call predecessors, (108), 9 states have call successors, (108) [2025-02-06 02:17:19,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 02:17:27,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 02:17:32,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0]