./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-38.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_fillercode_fillercodesize_ps-cn-500_file-38.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 69a106a7fe4e968f8159960741f93feca1d4d684a8ecc183635291d7b7b9ab5b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:57:17,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:57:17,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:57:17,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:57:17,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:57:17,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:57:17,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:57:17,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:57:17,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:57:17,736 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:57:17,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:57:17,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:57:17,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:57:17,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:57:17,738 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:57:17,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:57:17,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:57:17,738 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:57:17,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:57:17,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:57:17,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:57:17,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:57:17,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:57:17,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:57:17,739 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:57:17,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:57:17,739 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:57:17,739 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:57:17,739 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:57:17,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:57:17,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:57:17,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:57:17,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:57:17,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:57:17,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:57:17,740 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:57:17,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:57:17,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:57:17,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:57:17,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:57:17,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:57:17,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:57:17,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:57:17,741 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 -> 69a106a7fe4e968f8159960741f93feca1d4d684a8ecc183635291d7b7b9ab5b [2025-02-05 21:57:17,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:57:17,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:57:17,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:57:17,983 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:57:17,983 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:57:17,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-38.i [2025-02-05 21:57:19,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb174ab66/e021ed8cd0d54d159f8ff0caba607f7f/FLAGb370e2bf1 [2025-02-05 21:57:19,356 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:57:19,357 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-38.i [2025-02-05 21:57:19,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb174ab66/e021ed8cd0d54d159f8ff0caba607f7f/FLAGb370e2bf1 [2025-02-05 21:57:19,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb174ab66/e021ed8cd0d54d159f8ff0caba607f7f [2025-02-05 21:57:19,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:57:19,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:57:19,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:57:19,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:57:19,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:57:19,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:57:19" (1/1) ... [2025-02-05 21:57:19,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57be785b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:19, skipping insertion in model container [2025-02-05 21:57:19,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:57:19" (1/1) ... [2025-02-05 21:57:19,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:57:19,761 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_fillercode_fillercodesize_ps-cn-500_file-38.i[916,929] [2025-02-05 21:57:19,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:57:19,930 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:57:19,937 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_fillercode_fillercodesize_ps-cn-500_file-38.i[916,929] [2025-02-05 21:57:20,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:57:20,033 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:57:20,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:20 WrapperNode [2025-02-05 21:57:20,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:57:20,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:57:20,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:57:20,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:57:20,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:20" (1/1) ... [2025-02-05 21:57:20,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:20" (1/1) ... [2025-02-05 21:57:20,127 INFO L138 Inliner]: procedures = 26, calls = 122, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 861 [2025-02-05 21:57:20,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:57:20,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:57:20,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:57:20,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:57:20,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:20" (1/1) ... [2025-02-05 21:57:20,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:20" (1/1) ... [2025-02-05 21:57:20,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:20" (1/1) ... [2025-02-05 21:57:20,186 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-05 21:57:20,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:20" (1/1) ... [2025-02-05 21:57:20,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:20" (1/1) ... [2025-02-05 21:57:20,218 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:20" (1/1) ... [2025-02-05 21:57:20,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:20" (1/1) ... [2025-02-05 21:57:20,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:20" (1/1) ... [2025-02-05 21:57:20,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:20" (1/1) ... [2025-02-05 21:57:20,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:57:20,252 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:57:20,252 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:57:20,252 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:57:20,253 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:20" (1/1) ... [2025-02-05 21:57:20,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:57:20,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:57:20,280 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-05 21:57:20,284 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-05 21:57:20,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:57:20,302 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:57:20,302 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:57:20,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:57:20,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:57:20,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:57:20,433 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:57:20,434 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:57:21,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L722: havoc property_#t~bitwise85#1;havoc property_#t~short86#1; [2025-02-05 21:57:21,452 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-02-05 21:57:21,452 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:57:21,484 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:57:21,484 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 21:57:21,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:57:21 BoogieIcfgContainer [2025-02-05 21:57:21,485 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:57:21,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:57:21,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:57:21,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:57:21,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:57:19" (1/3) ... [2025-02-05 21:57:21,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c399689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:57:21, skipping insertion in model container [2025-02-05 21:57:21,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:20" (2/3) ... [2025-02-05 21:57:21,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c399689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:57:21, skipping insertion in model container [2025-02-05 21:57:21,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:57:21" (3/3) ... [2025-02-05 21:57:21,492 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-38.i [2025-02-05 21:57:21,503 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:57:21,505 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-38.i that has 2 procedures, 357 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:57:21,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:57:21,569 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;@1a73b57a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:57:21,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:57:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 357 states, 245 states have (on average 1.5714285714285714) internal successors, (385), 246 states have internal predecessors, (385), 109 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 21:57:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2025-02-05 21:57:21,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:21,598 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:57:21,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:21,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:21,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2034774877, now seen corresponding path program 1 times [2025-02-05 21:57:21,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:21,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729955360] [2025-02-05 21:57:21,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:21,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:21,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 697 statements into 1 equivalence classes. [2025-02-05 21:57:21,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 697 of 697 statements. [2025-02-05 21:57:21,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:21,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:22,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:22,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729955360] [2025-02-05 21:57:22,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729955360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:22,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:22,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:57:22,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131423964] [2025-02-05 21:57:22,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:22,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:57:22,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:22,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:57:22,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:22,854 INFO L87 Difference]: Start difference. First operand has 357 states, 245 states have (on average 1.5714285714285714) internal successors, (385), 246 states have internal predecessors, (385), 109 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:23,051 INFO L93 Difference]: Finished difference Result 1058 states and 2016 transitions. [2025-02-05 21:57:23,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:57:23,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 697 [2025-02-05 21:57:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:23,074 INFO L225 Difference]: With dead ends: 1058 [2025-02-05 21:57:23,075 INFO L226 Difference]: Without dead ends: 704 [2025-02-05 21:57:23,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:23,082 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 546 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:23,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:57:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-02-05 21:57:23,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 702. [2025-02-05 21:57:23,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 481 states have (on average 1.5613305613305613) internal successors, (751), 481 states have internal predecessors, (751), 218 states have call successors, (218), 2 states have call predecessors, (218), 2 states have return successors, (218), 218 states have call predecessors, (218), 218 states have call successors, (218) [2025-02-05 21:57:23,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1187 transitions. [2025-02-05 21:57:23,256 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1187 transitions. Word has length 697 [2025-02-05 21:57:23,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:23,260 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1187 transitions. [2025-02-05 21:57:23,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1187 transitions. [2025-02-05 21:57:23,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2025-02-05 21:57:23,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:23,274 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:57:23,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 21:57:23,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:23,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:23,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2023458750, now seen corresponding path program 1 times [2025-02-05 21:57:23,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:23,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857072658] [2025-02-05 21:57:23,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:23,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:23,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 697 statements into 1 equivalence classes. [2025-02-05 21:57:23,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 697 of 697 statements. [2025-02-05 21:57:23,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:23,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:24,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:24,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857072658] [2025-02-05 21:57:24,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857072658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:24,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:24,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:57:24,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858615682] [2025-02-05 21:57:24,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:24,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:57:24,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:24,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:57:24,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:24,383 INFO L87 Difference]: Start difference. First operand 702 states and 1187 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:24,507 INFO L93 Difference]: Finished difference Result 1861 states and 3165 transitions. [2025-02-05 21:57:24,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:57:24,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 697 [2025-02-05 21:57:24,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:24,520 INFO L225 Difference]: With dead ends: 1861 [2025-02-05 21:57:24,521 INFO L226 Difference]: Without dead ends: 1162 [2025-02-05 21:57:24,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:24,525 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 361 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:24,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1153 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:57:24,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2025-02-05 21:57:24,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2025-02-05 21:57:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 829 states have (on average 1.5983112183353438) internal successors, (1325), 829 states have internal predecessors, (1325), 327 states have call successors, (327), 3 states have call predecessors, (327), 3 states have return successors, (327), 327 states have call predecessors, (327), 327 states have call successors, (327) [2025-02-05 21:57:24,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1979 transitions. [2025-02-05 21:57:24,643 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1979 transitions. Word has length 697 [2025-02-05 21:57:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:24,644 INFO L471 AbstractCegarLoop]: Abstraction has 1160 states and 1979 transitions. [2025-02-05 21:57:24,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:24,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1979 transitions. [2025-02-05 21:57:24,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2025-02-05 21:57:24,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:24,657 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:57:24,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:57:24,657 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:24,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:24,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1061844733, now seen corresponding path program 1 times [2025-02-05 21:57:24,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:24,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692014226] [2025-02-05 21:57:24,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:24,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:24,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 697 statements into 1 equivalence classes. [2025-02-05 21:57:24,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 697 of 697 statements. [2025-02-05 21:57:24,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:24,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:25,233 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:25,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:25,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692014226] [2025-02-05 21:57:25,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692014226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:25,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:25,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:57:25,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949910931] [2025-02-05 21:57:25,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:25,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:57:25,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:25,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:57:25,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:25,236 INFO L87 Difference]: Start difference. First operand 1160 states and 1979 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:25,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:25,423 INFO L93 Difference]: Finished difference Result 3474 states and 5931 transitions. [2025-02-05 21:57:25,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:57:25,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 697 [2025-02-05 21:57:25,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:25,443 INFO L225 Difference]: With dead ends: 3474 [2025-02-05 21:57:25,443 INFO L226 Difference]: Without dead ends: 2317 [2025-02-05 21:57:25,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:25,449 INFO L435 NwaCegarLoop]: 1103 mSDtfsCounter, 590 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:25,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1675 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:57:25,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2025-02-05 21:57:25,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2315. [2025-02-05 21:57:25,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 1654 states have (on average 1.594316807738815) internal successors, (2637), 1654 states have internal predecessors, (2637), 654 states have call successors, (654), 6 states have call predecessors, (654), 6 states have return successors, (654), 654 states have call predecessors, (654), 654 states have call successors, (654) [2025-02-05 21:57:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 3945 transitions. [2025-02-05 21:57:25,658 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 3945 transitions. Word has length 697 [2025-02-05 21:57:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:25,659 INFO L471 AbstractCegarLoop]: Abstraction has 2315 states and 3945 transitions. [2025-02-05 21:57:25,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3945 transitions. [2025-02-05 21:57:25,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2025-02-05 21:57:25,668 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:25,669 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:57:25,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:57:25,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:25,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:25,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1847566173, now seen corresponding path program 1 times [2025-02-05 21:57:25,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:25,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440256011] [2025-02-05 21:57:25,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:25,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:25,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 697 statements into 1 equivalence classes. [2025-02-05 21:57:25,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 697 of 697 statements. [2025-02-05 21:57:25,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:25,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:26,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:26,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440256011] [2025-02-05 21:57:26,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440256011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:26,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:26,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:57:26,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82383750] [2025-02-05 21:57:26,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:26,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:57:26,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:26,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:57:26,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:57:26,757 INFO L87 Difference]: Start difference. First operand 2315 states and 3945 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:27,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:27,599 INFO L93 Difference]: Finished difference Result 9221 states and 15717 transitions. [2025-02-05 21:57:27,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:57:27,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 697 [2025-02-05 21:57:27,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:27,642 INFO L225 Difference]: With dead ends: 9221 [2025-02-05 21:57:27,642 INFO L226 Difference]: Without dead ends: 6909 [2025-02-05 21:57:27,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:57:27,652 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 1594 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:27,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 2290 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:57:27,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6909 states. [2025-02-05 21:57:28,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6909 to 4625. [2025-02-05 21:57:28,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4625 states, 3304 states have (on average 1.5932203389830508) internal successors, (5264), 3304 states have internal predecessors, (5264), 1308 states have call successors, (1308), 12 states have call predecessors, (1308), 12 states have return successors, (1308), 1308 states have call predecessors, (1308), 1308 states have call successors, (1308) [2025-02-05 21:57:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 7880 transitions. [2025-02-05 21:57:28,098 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 7880 transitions. Word has length 697 [2025-02-05 21:57:28,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:28,099 INFO L471 AbstractCegarLoop]: Abstraction has 4625 states and 7880 transitions. [2025-02-05 21:57:28,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 7880 transitions. [2025-02-05 21:57:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-02-05 21:57:28,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:28,105 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:57:28,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:57:28,105 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:28,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:28,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1920951624, now seen corresponding path program 1 times [2025-02-05 21:57:28,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:28,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896278725] [2025-02-05 21:57:28,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:28,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:28,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-02-05 21:57:28,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-02-05 21:57:28,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:28,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:28,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:28,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896278725] [2025-02-05 21:57:28,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896278725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:28,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:28,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:57:28,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232178807] [2025-02-05 21:57:28,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:28,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:57:28,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:28,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:57:28,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:57:28,894 INFO L87 Difference]: Start difference. First operand 4625 states and 7880 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:29,587 INFO L93 Difference]: Finished difference Result 12313 states and 21002 transitions. [2025-02-05 21:57:29,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:57:29,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 698 [2025-02-05 21:57:29,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:29,650 INFO L225 Difference]: With dead ends: 12313 [2025-02-05 21:57:29,650 INFO L226 Difference]: Without dead ends: 7691 [2025-02-05 21:57:29,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:57:29,661 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 1015 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:29,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 1008 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:57:29,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7691 states. [2025-02-05 21:57:30,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7691 to 6117. [2025-02-05 21:57:30,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6117 states, 4784 states have (on average 1.6513377926421404) internal successors, (7900), 4784 states have internal predecessors, (7900), 1308 states have call successors, (1308), 24 states have call predecessors, (1308), 24 states have return successors, (1308), 1308 states have call predecessors, (1308), 1308 states have call successors, (1308) [2025-02-05 21:57:30,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6117 states to 6117 states and 10516 transitions. [2025-02-05 21:57:30,053 INFO L78 Accepts]: Start accepts. Automaton has 6117 states and 10516 transitions. Word has length 698 [2025-02-05 21:57:30,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:30,054 INFO L471 AbstractCegarLoop]: Abstraction has 6117 states and 10516 transitions. [2025-02-05 21:57:30,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:30,059 INFO L276 IsEmpty]: Start isEmpty. Operand 6117 states and 10516 transitions. [2025-02-05 21:57:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-02-05 21:57:30,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:30,069 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:57:30,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:57:30,069 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:30,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:30,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1936006169, now seen corresponding path program 1 times [2025-02-05 21:57:30,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:30,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784740741] [2025-02-05 21:57:30,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:30,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:30,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-02-05 21:57:30,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-02-05 21:57:30,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:30,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:30,918 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:30,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:30,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784740741] [2025-02-05 21:57:30,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784740741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:30,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:30,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:57:30,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121829352] [2025-02-05 21:57:30,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:30,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:57:30,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:30,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:57:30,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:57:30,920 INFO L87 Difference]: Start difference. First operand 6117 states and 10516 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:31,682 INFO L93 Difference]: Finished difference Result 15861 states and 27350 transitions. [2025-02-05 21:57:31,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:57:31,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 698 [2025-02-05 21:57:31,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:31,736 INFO L225 Difference]: With dead ends: 15861 [2025-02-05 21:57:31,736 INFO L226 Difference]: Without dead ends: 9747 [2025-02-05 21:57:31,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:57:31,750 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 1126 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:31,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 1264 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:57:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9747 states. [2025-02-05 21:57:32,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9747 to 8461. [2025-02-05 21:57:32,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8461 states, 7128 states have (on average 1.6997755331088664) internal successors, (12116), 7128 states have internal predecessors, (12116), 1308 states have call successors, (1308), 24 states have call predecessors, (1308), 24 states have return successors, (1308), 1308 states have call predecessors, (1308), 1308 states have call successors, (1308) [2025-02-05 21:57:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 14732 transitions. [2025-02-05 21:57:32,246 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 14732 transitions. Word has length 698 [2025-02-05 21:57:32,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:32,247 INFO L471 AbstractCegarLoop]: Abstraction has 8461 states and 14732 transitions. [2025-02-05 21:57:32,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 14732 transitions. [2025-02-05 21:57:32,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-02-05 21:57:32,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:32,253 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:57:32,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:57:32,254 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:32,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:32,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1774488135, now seen corresponding path program 1 times [2025-02-05 21:57:32,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:32,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354941714] [2025-02-05 21:57:32,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:32,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:32,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-02-05 21:57:32,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-02-05 21:57:32,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:32,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:34,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:34,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354941714] [2025-02-05 21:57:34,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354941714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:34,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:34,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:57:34,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759406728] [2025-02-05 21:57:34,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:34,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:57:34,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:34,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:57:34,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:57:34,550 INFO L87 Difference]: Start difference. First operand 8461 states and 14732 transitions. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:38,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:38,749 INFO L93 Difference]: Finished difference Result 61731 states and 108862 transitions. [2025-02-05 21:57:38,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 21:57:38,751 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 698 [2025-02-05 21:57:38,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:38,875 INFO L225 Difference]: With dead ends: 61731 [2025-02-05 21:57:38,875 INFO L226 Difference]: Without dead ends: 53273 [2025-02-05 21:57:38,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:57:38,917 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 4667 mSDsluCounter, 3846 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 706 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 4439 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 706 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:38,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4667 Valid, 4439 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [706 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 21:57:38,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53273 states. [2025-02-05 21:57:39,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53273 to 15517. [2025-02-05 21:57:39,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15517 states, 13872 states have (on average 1.733275663206459) internal successors, (24044), 13884 states have internal predecessors, (24044), 1608 states have call successors, (1608), 36 states have call predecessors, (1608), 36 states have return successors, (1608), 1596 states have call predecessors, (1608), 1608 states have call successors, (1608) [2025-02-05 21:57:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15517 states to 15517 states and 27260 transitions. [2025-02-05 21:57:39,702 INFO L78 Accepts]: Start accepts. Automaton has 15517 states and 27260 transitions. Word has length 698 [2025-02-05 21:57:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:39,703 INFO L471 AbstractCegarLoop]: Abstraction has 15517 states and 27260 transitions. [2025-02-05 21:57:39,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 15517 states and 27260 transitions. [2025-02-05 21:57:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-02-05 21:57:39,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:39,709 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:57:39,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:57:39,709 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:39,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:39,710 INFO L85 PathProgramCache]: Analyzing trace with hash 479320776, now seen corresponding path program 1 times [2025-02-05 21:57:39,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:39,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024219523] [2025-02-05 21:57:39,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:39,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:39,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-02-05 21:57:39,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-02-05 21:57:39,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:39,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:40,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:40,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024219523] [2025-02-05 21:57:40,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024219523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:40,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:40,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:57:40,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705330581] [2025-02-05 21:57:40,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:40,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:57:40,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:40,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:57:40,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:57:40,466 INFO L87 Difference]: Start difference. First operand 15517 states and 27260 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:41,741 INFO L93 Difference]: Finished difference Result 46979 states and 82459 transitions. [2025-02-05 21:57:41,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:57:41,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 698 [2025-02-05 21:57:41,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:41,825 INFO L225 Difference]: With dead ends: 46979 [2025-02-05 21:57:41,825 INFO L226 Difference]: Without dead ends: 31465 [2025-02-05 21:57:41,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:57:41,848 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 619 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:41,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 2093 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:57:41,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31465 states. [2025-02-05 21:57:42,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31465 to 31053. [2025-02-05 21:57:42,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31053 states, 27764 states have (on average 1.732747442731595) internal successors, (48108), 27788 states have internal predecessors, (48108), 3216 states have call successors, (3216), 72 states have call predecessors, (3216), 72 states have return successors, (3216), 3192 states have call predecessors, (3216), 3216 states have call successors, (3216) [2025-02-05 21:57:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31053 states to 31053 states and 54540 transitions. [2025-02-05 21:57:43,023 INFO L78 Accepts]: Start accepts. Automaton has 31053 states and 54540 transitions. Word has length 698 [2025-02-05 21:57:43,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:43,026 INFO L471 AbstractCegarLoop]: Abstraction has 31053 states and 54540 transitions. [2025-02-05 21:57:43,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 31053 states and 54540 transitions. [2025-02-05 21:57:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-02-05 21:57:43,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:43,033 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:57:43,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:57:43,033 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:43,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:43,034 INFO L85 PathProgramCache]: Analyzing trace with hash -26237849, now seen corresponding path program 1 times [2025-02-05 21:57:43,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:43,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366618896] [2025-02-05 21:57:43,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:43,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:43,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-02-05 21:57:43,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-02-05 21:57:43,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:43,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:43,627 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-02-05 21:57:43,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:43,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366618896] [2025-02-05 21:57:43,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366618896] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:57:43,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877537956] [2025-02-05 21:57:43,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:43,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:57:43,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:57:43,631 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-05 21:57:43,632 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-05 21:57:43,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-02-05 21:57:43,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-02-05 21:57:43,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:43,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:43,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 1582 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 21:57:43,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:57:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 11124 proven. 120 refuted. 0 times theorem prover too weak. 12300 trivial. 0 not checked. [2025-02-05 21:57:44,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:57:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 204 proven. 120 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-02-05 21:57:45,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877537956] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:57:45,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:57:45,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2025-02-05 21:57:45,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229483422] [2025-02-05 21:57:45,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:57:45,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 21:57:45,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:45,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 21:57:45,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:57:45,083 INFO L87 Difference]: Start difference. First operand 31053 states and 54540 transitions. Second operand has 10 states, 10 states have (on average 38.4) internal successors, (384), 10 states have internal predecessors, (384), 4 states have call successors, (257), 2 states have call predecessors, (257), 4 states have return successors, (259), 4 states have call predecessors, (259), 4 states have call successors, (259) [2025-02-05 21:57:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:46,975 INFO L93 Difference]: Finished difference Result 49273 states and 86346 transitions. [2025-02-05 21:57:46,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 21:57:46,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 38.4) internal successors, (384), 10 states have internal predecessors, (384), 4 states have call successors, (257), 2 states have call predecessors, (257), 4 states have return successors, (259), 4 states have call predecessors, (259), 4 states have call successors, (259) Word has length 698 [2025-02-05 21:57:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:47,022 INFO L225 Difference]: With dead ends: 49273 [2025-02-05 21:57:47,022 INFO L226 Difference]: Without dead ends: 18223 [2025-02-05 21:57:47,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1419 GetRequests, 1393 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2025-02-05 21:57:47,059 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 2270 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 753 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2271 SdHoareTripleChecker+Valid, 2161 SdHoareTripleChecker+Invalid, 2164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 753 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:47,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2271 Valid, 2161 Invalid, 2164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [753 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 21:57:47,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18223 states. [2025-02-05 21:57:47,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18223 to 16335. [2025-02-05 21:57:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16335 states, 14540 states have (on average 1.7020632737276478) internal successors, (24748), 14552 states have internal predecessors, (24748), 1717 states have call successors, (1717), 77 states have call predecessors, (1717), 77 states have return successors, (1717), 1705 states have call predecessors, (1717), 1717 states have call successors, (1717) [2025-02-05 21:57:47,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16335 states to 16335 states and 28182 transitions. [2025-02-05 21:57:47,978 INFO L78 Accepts]: Start accepts. Automaton has 16335 states and 28182 transitions. Word has length 698 [2025-02-05 21:57:47,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:47,979 INFO L471 AbstractCegarLoop]: Abstraction has 16335 states and 28182 transitions. [2025-02-05 21:57:47,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 38.4) internal successors, (384), 10 states have internal predecessors, (384), 4 states have call successors, (257), 2 states have call predecessors, (257), 4 states have return successors, (259), 4 states have call predecessors, (259), 4 states have call successors, (259) [2025-02-05 21:57:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 16335 states and 28182 transitions. [2025-02-05 21:57:47,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2025-02-05 21:57:47,985 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:47,985 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:57:47,996 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-05 21:57:48,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:57:48,186 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:48,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:48,187 INFO L85 PathProgramCache]: Analyzing trace with hash 979968141, now seen corresponding path program 1 times [2025-02-05 21:57:48,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:48,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496693572] [2025-02-05 21:57:48,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:48,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:48,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-02-05 21:57:48,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-02-05 21:57:48,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:48,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:48,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:48,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496693572] [2025-02-05 21:57:48,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496693572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:48,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:48,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:57:48,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211153777] [2025-02-05 21:57:48,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:48,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:57:48,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:48,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:57:48,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:57:48,537 INFO L87 Difference]: Start difference. First operand 16335 states and 28182 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:49,515 INFO L93 Difference]: Finished difference Result 26147 states and 45080 transitions. [2025-02-05 21:57:49,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:57:49,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 699 [2025-02-05 21:57:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:49,545 INFO L225 Difference]: With dead ends: 26147 [2025-02-05 21:57:49,546 INFO L226 Difference]: Without dead ends: 16387 [2025-02-05 21:57:49,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:57:49,554 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 377 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:49,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1175 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:57:49,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16387 states. [2025-02-05 21:57:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16387 to 16387. [2025-02-05 21:57:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16387 states, 14579 states have (on average 1.698127443583236) internal successors, (24757), 14591 states have internal predecessors, (24757), 1717 states have call successors, (1717), 90 states have call predecessors, (1717), 90 states have return successors, (1717), 1705 states have call predecessors, (1717), 1717 states have call successors, (1717) [2025-02-05 21:57:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16387 states to 16387 states and 28191 transitions. [2025-02-05 21:57:50,168 INFO L78 Accepts]: Start accepts. Automaton has 16387 states and 28191 transitions. Word has length 699 [2025-02-05 21:57:50,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:50,169 INFO L471 AbstractCegarLoop]: Abstraction has 16387 states and 28191 transitions. [2025-02-05 21:57:50,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 16387 states and 28191 transitions. [2025-02-05 21:57:50,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2025-02-05 21:57:50,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:50,175 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:57:50,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:57:50,175 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:50,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:50,175 INFO L85 PathProgramCache]: Analyzing trace with hash -950650964, now seen corresponding path program 1 times [2025-02-05 21:57:50,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:50,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247121735] [2025-02-05 21:57:50,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:50,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:50,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-02-05 21:57:50,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-02-05 21:57:50,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:50,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:50,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:50,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247121735] [2025-02-05 21:57:50,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247121735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:50,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:50,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:57:50,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429320637] [2025-02-05 21:57:50,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:50,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:57:50,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:50,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:57:50,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:57:50,602 INFO L87 Difference]: Start difference. First operand 16387 states and 28191 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:51,633 INFO L93 Difference]: Finished difference Result 26437 states and 45286 transitions. [2025-02-05 21:57:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:57:51,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 699 [2025-02-05 21:57:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:51,680 INFO L225 Difference]: With dead ends: 26437 [2025-02-05 21:57:51,680 INFO L226 Difference]: Without dead ends: 17099 [2025-02-05 21:57:51,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:57:51,693 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 810 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:51,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 1547 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:57:51,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17099 states. [2025-02-05 21:57:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17099 to 16451. [2025-02-05 21:57:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16451 states, 14639 states have (on average 1.6960857982102602) internal successors, (24829), 14651 states have internal predecessors, (24829), 1717 states have call successors, (1717), 94 states have call predecessors, (1717), 94 states have return successors, (1717), 1705 states have call predecessors, (1717), 1717 states have call successors, (1717) [2025-02-05 21:57:52,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16451 states to 16451 states and 28263 transitions. [2025-02-05 21:57:52,691 INFO L78 Accepts]: Start accepts. Automaton has 16451 states and 28263 transitions. Word has length 699 [2025-02-05 21:57:52,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:52,692 INFO L471 AbstractCegarLoop]: Abstraction has 16451 states and 28263 transitions. [2025-02-05 21:57:52,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:52,693 INFO L276 IsEmpty]: Start isEmpty. Operand 16451 states and 28263 transitions. [2025-02-05 21:57:52,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2025-02-05 21:57:52,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:52,701 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:57:52,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:57:52,702 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:52,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:52,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1205387509, now seen corresponding path program 1 times [2025-02-05 21:57:52,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:52,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250030643] [2025-02-05 21:57:52,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:52,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:52,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-02-05 21:57:52,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-02-05 21:57:52,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:52,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 36 proven. 288 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-02-05 21:57:53,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:53,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250030643] [2025-02-05 21:57:53,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250030643] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:57:53,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842861523] [2025-02-05 21:57:53,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:53,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:57:53,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:57:53,397 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-05 21:57:53,398 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-05 21:57:53,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-02-05 21:57:53,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-02-05 21:57:53,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:53,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:53,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 1586 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:57:53,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:57:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-02-05 21:57:53,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:57:53,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842861523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:53,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:57:53,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-05 21:57:53,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338532441] [2025-02-05 21:57:53,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:53,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:57:53,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:53,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:57:53,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:57:53,817 INFO L87 Difference]: Start difference. First operand 16451 states and 28263 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (109), 1 states have call predecessors, (109), 2 states have return successors, (109), 2 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:54,403 INFO L93 Difference]: Finished difference Result 23913 states and 40999 transitions. [2025-02-05 21:57:54,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:57:54,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (109), 1 states have call predecessors, (109), 2 states have return successors, (109), 2 states have call predecessors, (109), 1 states have call successors, (109) Word has length 699 [2025-02-05 21:57:54,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:54,429 INFO L225 Difference]: With dead ends: 23913 [2025-02-05 21:57:54,429 INFO L226 Difference]: Without dead ends: 9137 [2025-02-05 21:57:54,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 700 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-05 21:57:54,448 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 425 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:54,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1170 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:57:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9137 states. [2025-02-05 21:57:54,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9137 to 9067. [2025-02-05 21:57:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9067 states, 8098 states have (on average 1.696715238330452) internal successors, (13740), 8104 states have internal predecessors, (13740), 913 states have call successors, (913), 55 states have call predecessors, (913), 55 states have return successors, (913), 907 states have call predecessors, (913), 913 states have call successors, (913) [2025-02-05 21:57:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9067 states to 9067 states and 15566 transitions. [2025-02-05 21:57:54,773 INFO L78 Accepts]: Start accepts. Automaton has 9067 states and 15566 transitions. Word has length 699 [2025-02-05 21:57:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:54,774 INFO L471 AbstractCegarLoop]: Abstraction has 9067 states and 15566 transitions. [2025-02-05 21:57:54,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (109), 1 states have call predecessors, (109), 2 states have return successors, (109), 2 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 9067 states and 15566 transitions. [2025-02-05 21:57:54,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2025-02-05 21:57:54,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:54,779 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:57:54,787 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-05 21:57:54,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:57:54,980 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:54,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:54,981 INFO L85 PathProgramCache]: Analyzing trace with hash -425223922, now seen corresponding path program 1 times [2025-02-05 21:57:54,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:54,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947687726] [2025-02-05 21:57:54,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:54,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:55,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-02-05 21:57:55,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-02-05 21:57:55,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:55,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 36 proven. 288 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-02-05 21:57:55,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:55,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947687726] [2025-02-05 21:57:55,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947687726] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:57:55,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447649615] [2025-02-05 21:57:55,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:55,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:57:55,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:57:55,567 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-05 21:57:55,569 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-05 21:57:55,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 699 statements into 1 equivalence classes. [2025-02-05 21:57:55,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 699 of 699 statements. [2025-02-05 21:57:55,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:55,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:55,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:57:55,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:57:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 11538 proven. 189 refuted. 0 times theorem prover too weak. 11817 trivial. 0 not checked. [2025-02-05 21:57:56,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:57:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 135 proven. 189 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-02-05 21:57:56,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447649615] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:57:56,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:57:56,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-02-05 21:57:56,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754406364] [2025-02-05 21:57:56,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:57:56,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 21:57:56,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:56,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 21:57:56,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:57:56,765 INFO L87 Difference]: Start difference. First operand 9067 states and 15566 transitions. Second operand has 10 states, 10 states have (on average 30.6) internal successors, (306), 10 states have internal predecessors, (306), 4 states have call successors, (281), 2 states have call predecessors, (281), 4 states have return successors, (282), 4 states have call predecessors, (282), 4 states have call successors, (282) [2025-02-05 21:57:57,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:57,955 INFO L93 Difference]: Finished difference Result 16864 states and 28683 transitions. [2025-02-05 21:57:57,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 21:57:57,956 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 30.6) internal successors, (306), 10 states have internal predecessors, (306), 4 states have call successors, (281), 2 states have call predecessors, (281), 4 states have return successors, (282), 4 states have call predecessors, (282), 4 states have call successors, (282) Word has length 699 [2025-02-05 21:57:57,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:57,975 INFO L225 Difference]: With dead ends: 16864 [2025-02-05 21:57:57,975 INFO L226 Difference]: Without dead ends: 8055 [2025-02-05 21:57:57,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1421 GetRequests, 1396 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2025-02-05 21:57:57,985 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 2071 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 733 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2115 SdHoareTripleChecker+Valid, 2015 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 733 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:57,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2115 Valid, 2015 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [733 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:57:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8055 states. [2025-02-05 21:57:58,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8055 to 6843. [2025-02-05 21:57:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6843 states, 5860 states have (on average 1.6390784982935154) internal successors, (9605), 5866 states have internal predecessors, (9605), 913 states have call successors, (913), 69 states have call predecessors, (913), 69 states have return successors, (913), 907 states have call predecessors, (913), 913 states have call successors, (913) [2025-02-05 21:57:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6843 states to 6843 states and 11431 transitions. [2025-02-05 21:57:58,326 INFO L78 Accepts]: Start accepts. Automaton has 6843 states and 11431 transitions. Word has length 699 [2025-02-05 21:57:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:58,327 INFO L471 AbstractCegarLoop]: Abstraction has 6843 states and 11431 transitions. [2025-02-05 21:57:58,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.6) internal successors, (306), 10 states have internal predecessors, (306), 4 states have call successors, (281), 2 states have call predecessors, (281), 4 states have return successors, (282), 4 states have call predecessors, (282), 4 states have call successors, (282) [2025-02-05 21:57:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 6843 states and 11431 transitions. [2025-02-05 21:57:58,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-02-05 21:57:58,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:58,333 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:57:58,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 21:57:58,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:57:58,534 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:58,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:58,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2034310420, now seen corresponding path program 1 times [2025-02-05 21:57:58,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:58,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211842588] [2025-02-05 21:57:58,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:58,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:58,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-02-05 21:57:58,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-02-05 21:57:58,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:58,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:58,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:58,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211842588] [2025-02-05 21:57:58,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211842588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:58,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:58,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:57:58,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546425408] [2025-02-05 21:57:58,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:58,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:57:58,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:58,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:57:58,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:57:58,986 INFO L87 Difference]: Start difference. First operand 6843 states and 11431 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:59,612 INFO L93 Difference]: Finished difference Result 21634 states and 36151 transitions. [2025-02-05 21:57:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:57:59,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 700 [2025-02-05 21:57:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:59,641 INFO L225 Difference]: With dead ends: 21634 [2025-02-05 21:57:59,641 INFO L226 Difference]: Without dead ends: 15962 [2025-02-05 21:57:59,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:57:59,653 INFO L435 NwaCegarLoop]: 1226 mSDtfsCounter, 910 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:59,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 2436 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:57:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15962 states. [2025-02-05 21:58:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15962 to 12633. [2025-02-05 21:58:00,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12633 states, 10773 states have (on average 1.6290726817042607) internal successors, (17550), 10785 states have internal predecessors, (17550), 1717 states have call successors, (1717), 142 states have call predecessors, (1717), 142 states have return successors, (1717), 1705 states have call predecessors, (1717), 1717 states have call successors, (1717) [2025-02-05 21:58:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12633 states to 12633 states and 20984 transitions. [2025-02-05 21:58:00,280 INFO L78 Accepts]: Start accepts. Automaton has 12633 states and 20984 transitions. Word has length 700 [2025-02-05 21:58:00,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:00,281 INFO L471 AbstractCegarLoop]: Abstraction has 12633 states and 20984 transitions. [2025-02-05 21:58:00,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:58:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 12633 states and 20984 transitions. [2025-02-05 21:58:00,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2025-02-05 21:58:00,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:00,285 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:58:00,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:58:00,286 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:00,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:00,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2049305963, now seen corresponding path program 1 times [2025-02-05 21:58:00,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:00,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908387856] [2025-02-05 21:58:00,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:00,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:00,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-02-05 21:58:00,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-02-05 21:58:00,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:00,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 114 proven. 210 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-02-05 21:58:00,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:00,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908387856] [2025-02-05 21:58:00,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908387856] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:58:00,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154691416] [2025-02-05 21:58:00,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:00,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:58:00,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:58:00,817 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-05 21:58:00,819 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-05 21:58:00,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 700 statements into 1 equivalence classes. [2025-02-05 21:58:01,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 700 of 700 statements. [2025-02-05 21:58:01,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:01,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:01,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 1581 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:58:01,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:58:01,622 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 11374 proven. 195 refuted. 0 times theorem prover too weak. 11975 trivial. 0 not checked. [2025-02-05 21:58:01,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:58:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 129 proven. 195 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-02-05 21:58:02,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154691416] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:58:02,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:58:02,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-02-05 21:58:02,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176971634] [2025-02-05 21:58:02,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:58:02,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:58:02,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:02,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:58:02,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:58:02,043 INFO L87 Difference]: Start difference. First operand 12633 states and 20984 transitions. Second operand has 9 states, 9 states have (on average 31.88888888888889) internal successors, (287), 9 states have internal predecessors, (287), 4 states have call successors, (283), 2 states have call predecessors, (283), 4 states have return successors, (284), 4 states have call predecessors, (284), 4 states have call successors, (284) [2025-02-05 21:58:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:03,924 INFO L93 Difference]: Finished difference Result 36926 states and 61022 transitions. [2025-02-05 21:58:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 21:58:03,925 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 31.88888888888889) internal successors, (287), 9 states have internal predecessors, (287), 4 states have call successors, (283), 2 states have call predecessors, (283), 4 states have return successors, (284), 4 states have call predecessors, (284), 4 states have call successors, (284) Word has length 700 [2025-02-05 21:58:03,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:03,972 INFO L225 Difference]: With dead ends: 36926 [2025-02-05 21:58:03,972 INFO L226 Difference]: Without dead ends: 24608 [2025-02-05 21:58:03,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1419 GetRequests, 1397 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2025-02-05 21:58:03,985 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 981 mSDsluCounter, 1901 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:03,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 2540 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:58:03,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24608 states. [2025-02-05 21:58:05,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24608 to 17289. [2025-02-05 21:58:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17289 states, 13676 states have (on average 1.5424831822170226) internal successors, (21095), 13700 states have internal predecessors, (21095), 3325 states have call successors, (3325), 287 states have call predecessors, (3325), 287 states have return successors, (3325), 3301 states have call predecessors, (3325), 3325 states have call successors, (3325) [2025-02-05 21:58:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17289 states to 17289 states and 27745 transitions. [2025-02-05 21:58:05,589 INFO L78 Accepts]: Start accepts. Automaton has 17289 states and 27745 transitions. Word has length 700 [2025-02-05 21:58:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:05,589 INFO L471 AbstractCegarLoop]: Abstraction has 17289 states and 27745 transitions. [2025-02-05 21:58:05,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.88888888888889) internal successors, (287), 9 states have internal predecessors, (287), 4 states have call successors, (283), 2 states have call predecessors, (283), 4 states have return successors, (284), 4 states have call predecessors, (284), 4 states have call successors, (284) [2025-02-05 21:58:05,590 INFO L276 IsEmpty]: Start isEmpty. Operand 17289 states and 27745 transitions. [2025-02-05 21:58:05,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2025-02-05 21:58:05,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:05,597 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:58:05,606 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-05 21:58:05,798 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,SelfDestructingSolverStorable14 [2025-02-05 21:58:05,798 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:05,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:05,799 INFO L85 PathProgramCache]: Analyzing trace with hash 785773080, now seen corresponding path program 1 times [2025-02-05 21:58:05,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:05,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725141431] [2025-02-05 21:58:05,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:05,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:05,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 702 statements into 1 equivalence classes. [2025-02-05 21:58:05,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 702 of 702 statements. [2025-02-05 21:58:05,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:05,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:05,979 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:58:05,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:05,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725141431] [2025-02-05 21:58:05,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725141431] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:05,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:05,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:58:05,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578329696] [2025-02-05 21:58:05,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:05,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:58:05,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:05,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:58:05,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:05,980 INFO L87 Difference]: Start difference. First operand 17289 states and 27745 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:58:07,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:07,936 INFO L93 Difference]: Finished difference Result 50057 states and 80309 transitions. [2025-02-05 21:58:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:58:07,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 702 [2025-02-05 21:58:07,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:08,017 INFO L225 Difference]: With dead ends: 50057 [2025-02-05 21:58:08,018 INFO L226 Difference]: Without dead ends: 33639 [2025-02-05 21:58:08,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:08,045 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 529 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:08,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1495 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:58:08,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33639 states. [2025-02-05 21:58:10,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33639 to 33637. [2025-02-05 21:58:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33637 states, 26532 states have (on average 1.5356927483793155) internal successors, (40745), 26580 states have internal predecessors, (40745), 6541 states have call successors, (6541), 563 states have call predecessors, (6541), 563 states have return successors, (6541), 6493 states have call predecessors, (6541), 6541 states have call successors, (6541) [2025-02-05 21:58:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33637 states to 33637 states and 53827 transitions. [2025-02-05 21:58:11,065 INFO L78 Accepts]: Start accepts. Automaton has 33637 states and 53827 transitions. Word has length 702 [2025-02-05 21:58:11,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:11,066 INFO L471 AbstractCegarLoop]: Abstraction has 33637 states and 53827 transitions. [2025-02-05 21:58:11,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:58:11,066 INFO L276 IsEmpty]: Start isEmpty. Operand 33637 states and 53827 transitions. [2025-02-05 21:58:11,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2025-02-05 21:58:11,075 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:11,076 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:58:11,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 21:58:11,076 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:11,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:11,076 INFO L85 PathProgramCache]: Analyzing trace with hash 332006201, now seen corresponding path program 1 times [2025-02-05 21:58:11,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:11,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007962236] [2025-02-05 21:58:11,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:11,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:11,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 703 statements into 1 equivalence classes. [2025-02-05 21:58:11,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 703 of 703 statements. [2025-02-05 21:58:11,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:11,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:11,297 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:58:11,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:11,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007962236] [2025-02-05 21:58:11,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007962236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:11,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:11,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:58:11,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134919321] [2025-02-05 21:58:11,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:11,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:58:11,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:11,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:58:11,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:58:11,300 INFO L87 Difference]: Start difference. First operand 33637 states and 53827 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:58:13,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:13,267 INFO L93 Difference]: Finished difference Result 74055 states and 119332 transitions. [2025-02-05 21:58:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:58:13,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 703 [2025-02-05 21:58:13,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:13,359 INFO L225 Difference]: With dead ends: 74055 [2025-02-05 21:58:13,359 INFO L226 Difference]: Without dead ends: 33637 [2025-02-05 21:58:13,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:58:13,423 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 158 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:13,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1118 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:58:13,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33637 states. [2025-02-05 21:58:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33637 to 33637. [2025-02-05 21:58:15,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33637 states, 26532 states have (on average 1.5292100105532942) internal successors, (40573), 26580 states have internal predecessors, (40573), 6541 states have call successors, (6541), 563 states have call predecessors, (6541), 563 states have return successors, (6541), 6493 states have call predecessors, (6541), 6541 states have call successors, (6541) [2025-02-05 21:58:15,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33637 states to 33637 states and 53655 transitions. [2025-02-05 21:58:15,900 INFO L78 Accepts]: Start accepts. Automaton has 33637 states and 53655 transitions. Word has length 703 [2025-02-05 21:58:15,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:15,901 INFO L471 AbstractCegarLoop]: Abstraction has 33637 states and 53655 transitions. [2025-02-05 21:58:15,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:58:15,901 INFO L276 IsEmpty]: Start isEmpty. Operand 33637 states and 53655 transitions. [2025-02-05 21:58:15,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2025-02-05 21:58:15,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:15,907 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:58:15,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 21:58:15,907 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:15,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:15,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1636399930, now seen corresponding path program 1 times [2025-02-05 21:58:15,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:15,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421645635] [2025-02-05 21:58:15,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:15,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:15,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 703 statements into 1 equivalence classes. [2025-02-05 21:58:15,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 703 of 703 statements. [2025-02-05 21:58:15,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:15,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:58:16,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:16,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421645635] [2025-02-05 21:58:16,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421645635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:16,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:16,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:58:16,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966136153] [2025-02-05 21:58:16,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:16,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:58:16,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:16,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:58:16,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:58:16,168 INFO L87 Difference]: Start difference. First operand 33637 states and 53655 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:58:19,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:19,018 INFO L93 Difference]: Finished difference Result 66087 states and 105408 transitions. [2025-02-05 21:58:19,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:58:19,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 703 [2025-02-05 21:58:19,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:19,119 INFO L225 Difference]: With dead ends: 66087 [2025-02-05 21:58:19,119 INFO L226 Difference]: Without dead ends: 33637 [2025-02-05 21:58:19,180 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-05 21:58:19,181 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 361 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:19,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1292 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:58:19,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33637 states. [2025-02-05 21:58:21,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33637 to 33637. [2025-02-05 21:58:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33637 states, 26532 states have (on average 1.5264963063470527) internal successors, (40501), 26580 states have internal predecessors, (40501), 6541 states have call successors, (6541), 563 states have call predecessors, (6541), 563 states have return successors, (6541), 6493 states have call predecessors, (6541), 6541 states have call successors, (6541) [2025-02-05 21:58:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33637 states to 33637 states and 53583 transitions. [2025-02-05 21:58:21,638 INFO L78 Accepts]: Start accepts. Automaton has 33637 states and 53583 transitions. Word has length 703 [2025-02-05 21:58:21,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:21,639 INFO L471 AbstractCegarLoop]: Abstraction has 33637 states and 53583 transitions. [2025-02-05 21:58:21,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:58:21,639 INFO L276 IsEmpty]: Start isEmpty. Operand 33637 states and 53583 transitions. [2025-02-05 21:58:21,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2025-02-05 21:58:21,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:21,645 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:58:21,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 21:58:21,645 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:21,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:21,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1737311897, now seen corresponding path program 1 times [2025-02-05 21:58:21,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:21,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325325114] [2025-02-05 21:58:21,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:21,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:21,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 703 statements into 1 equivalence classes. [2025-02-05 21:58:21,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 703 of 703 statements. [2025-02-05 21:58:21,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:21,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 201 proven. 123 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-02-05 21:58:22,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:22,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325325114] [2025-02-05 21:58:22,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325325114] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:58:22,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443648958] [2025-02-05 21:58:22,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:22,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:58:22,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:58:22,356 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-05 21:58:22,359 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-05 21:58:22,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 703 statements into 1 equivalence classes. [2025-02-05 21:58:22,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 703 of 703 statements. [2025-02-05 21:58:22,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:22,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:22,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 1584 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 21:58:22,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:58:22,872 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 9228 proven. 84 refuted. 0 times theorem prover too weak. 14232 trivial. 0 not checked. [2025-02-05 21:58:22,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:58:23,197 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 240 proven. 84 refuted. 0 times theorem prover too weak. 23220 trivial. 0 not checked. [2025-02-05 21:58:23,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443648958] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:58:23,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:58:23,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-02-05 21:58:23,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757570236] [2025-02-05 21:58:23,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:58:23,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 21:58:23,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:23,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 21:58:23,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:58:23,199 INFO L87 Difference]: Start difference. First operand 33637 states and 53583 transitions. Second operand has 13 states, 13 states have (on average 25.846153846153847) internal successors, (336), 13 states have internal predecessors, (336), 4 states have call successors, (178), 2 states have call predecessors, (178), 4 states have return successors, (180), 4 states have call predecessors, (180), 4 states have call successors, (180) [2025-02-05 21:58:28,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:28,323 INFO L93 Difference]: Finished difference Result 87377 states and 137478 transitions. [2025-02-05 21:58:28,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 21:58:28,324 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 25.846153846153847) internal successors, (336), 13 states have internal predecessors, (336), 4 states have call successors, (178), 2 states have call predecessors, (178), 4 states have return successors, (180), 4 states have call predecessors, (180), 4 states have call successors, (180) Word has length 703 [2025-02-05 21:58:28,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:28,476 INFO L225 Difference]: With dead ends: 87377 [2025-02-05 21:58:28,476 INFO L226 Difference]: Without dead ends: 55049 [2025-02-05 21:58:28,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1434 GetRequests, 1403 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=756, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 21:58:28,523 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 1747 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 1343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1749 SdHoareTripleChecker+Valid, 1930 SdHoareTripleChecker+Invalid, 2533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1343 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:28,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1749 Valid, 1930 Invalid, 2533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1343 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:58:28,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55049 states. [2025-02-05 21:58:32,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55049 to 41759. [2025-02-05 21:58:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41759 states, 34507 states have (on average 1.546816587938679) internal successors, (53376), 34555 states have internal predecessors, (53376), 6541 states have call successors, (6541), 710 states have call predecessors, (6541), 710 states have return successors, (6541), 6493 states have call predecessors, (6541), 6541 states have call successors, (6541) [2025-02-05 21:58:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41759 states to 41759 states and 66458 transitions. [2025-02-05 21:58:32,238 INFO L78 Accepts]: Start accepts. Automaton has 41759 states and 66458 transitions. Word has length 703 [2025-02-05 21:58:32,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:32,239 INFO L471 AbstractCegarLoop]: Abstraction has 41759 states and 66458 transitions. [2025-02-05 21:58:32,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.846153846153847) internal successors, (336), 13 states have internal predecessors, (336), 4 states have call successors, (178), 2 states have call predecessors, (178), 4 states have return successors, (180), 4 states have call predecessors, (180), 4 states have call successors, (180) [2025-02-05 21:58:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 41759 states and 66458 transitions. [2025-02-05 21:58:32,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-02-05 21:58:32,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:32,246 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:58:32,255 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-05 21:58:32,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:58:32,447 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:32,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:32,448 INFO L85 PathProgramCache]: Analyzing trace with hash -435914714, now seen corresponding path program 1 times [2025-02-05 21:58:32,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:32,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402833605] [2025-02-05 21:58:32,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:32,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:32,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-02-05 21:58:32,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-02-05 21:58:32,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:32,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat