./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-18.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-250_file-18.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 44903c27af28474fa8f64f9be68c4119ba3454622360f31f5c3d951f7d2ecb67 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:32:39,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:32:39,252 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:32:39,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:32:39,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:32:39,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:32:39,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:32:39,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:32:39,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:32:39,287 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:32:39,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:32:39,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:32:39,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:32:39,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:32:39,289 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:32:39,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:32:39,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:32:39,289 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:32:39,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:32:39,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:32:39,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:32:39,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:32:39,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:32:39,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:32:39,290 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:32:39,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:32:39,290 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:32:39,290 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:32:39,290 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:32:39,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:32:39,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:32:39,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:32:39,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:32:39,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:32:39,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:32:39,291 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:32:39,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:32:39,291 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:32:39,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:32:39,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:32:39,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:32:39,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:32:39,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:32:39,292 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 -> 44903c27af28474fa8f64f9be68c4119ba3454622360f31f5c3d951f7d2ecb67 [2025-02-05 21:32:39,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:32:39,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:32:39,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:32:39,507 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:32:39,507 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:32:39,508 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-250_file-18.i [2025-02-05 21:32:40,770 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e501dc22/ebfc671adc194f2490dcc6544607f5c7/FLAGf1fa3761b [2025-02-05 21:32:41,073 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:32:41,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-18.i [2025-02-05 21:32:41,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e501dc22/ebfc671adc194f2490dcc6544607f5c7/FLAGf1fa3761b [2025-02-05 21:32:41,108 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e501dc22/ebfc671adc194f2490dcc6544607f5c7 [2025-02-05 21:32:41,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:32:41,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:32:41,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:32:41,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:32:41,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:32:41,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:32:41" (1/1) ... [2025-02-05 21:32:41,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ece4ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:41, skipping insertion in model container [2025-02-05 21:32:41,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:32:41" (1/1) ... [2025-02-05 21:32:41,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:32:41,249 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-250_file-18.i[916,929] [2025-02-05 21:32:41,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:32:41,345 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:32:41,357 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-250_file-18.i[916,929] [2025-02-05 21:32:41,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:32:41,420 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:32:41,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:41 WrapperNode [2025-02-05 21:32:41,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:32:41,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:32:41,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:32:41,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:32:41,426 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:32:41" (1/1) ... [2025-02-05 21:32:41,444 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:32:41" (1/1) ... [2025-02-05 21:32:41,477 INFO L138 Inliner]: procedures = 26, calls = 95, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 575 [2025-02-05 21:32:41,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:32:41,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:32:41,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:32:41,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:32:41,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:41" (1/1) ... [2025-02-05 21:32:41,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:41" (1/1) ... [2025-02-05 21:32:41,490 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:41" (1/1) ... [2025-02-05 21:32:41,508 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:32:41,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:41" (1/1) ... [2025-02-05 21:32:41,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:41" (1/1) ... [2025-02-05 21:32:41,519 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:41" (1/1) ... [2025-02-05 21:32:41,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:41" (1/1) ... [2025-02-05 21:32:41,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:41" (1/1) ... [2025-02-05 21:32:41,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:41" (1/1) ... [2025-02-05 21:32:41,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:32:41,531 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:32:41,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:32:41,531 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:32:41,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:41" (1/1) ... [2025-02-05 21:32:41,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:32:41,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:32:41,557 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:32:41,561 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:32:41,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:32:41,575 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:32:41,575 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:32:41,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:32:41,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:32:41,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:32:41,681 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:32:41,683 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:32:42,329 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-05 21:32:42,330 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:32:42,356 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:32:42,356 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:32:42,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:32:42 BoogieIcfgContainer [2025-02-05 21:32:42,359 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:32:42,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:32:42,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:32:42,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:32:42,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:32:41" (1/3) ... [2025-02-05 21:32:42,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8cce78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:32:42, skipping insertion in model container [2025-02-05 21:32:42,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:32:41" (2/3) ... [2025-02-05 21:32:42,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8cce78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:32:42, skipping insertion in model container [2025-02-05 21:32:42,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:32:42" (3/3) ... [2025-02-05 21:32:42,365 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-18.i [2025-02-05 21:32:42,375 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:32:42,378 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-18.i that has 2 procedures, 240 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:32:42,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:32:42,421 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;@7479c13c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:32:42,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:32:42,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 155 states have (on average 1.5161290322580645) internal successors, (235), 156 states have internal predecessors, (235), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 21:32:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-02-05 21:32:42,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:42,439 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:42,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:42,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:42,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1550701607, now seen corresponding path program 1 times [2025-02-05 21:32:42,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:42,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750786890] [2025-02-05 21:32:42,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:42,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:42,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-02-05 21:32:42,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-02-05 21:32:42,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:42,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2025-02-05 21:32:42,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:32:42,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750786890] [2025-02-05 21:32:42,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750786890] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:32:42,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791538365] [2025-02-05 21:32:42,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:42,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:32:42,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:32:42,963 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:32:42,965 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:32:43,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-02-05 21:32:43,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-02-05 21:32:43,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:43,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:43,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:32:43,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:32:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2025-02-05 21:32:43,338 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:32:43,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791538365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:32:43,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:32:43,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:32:43,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824441060] [2025-02-05 21:32:43,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:32:43,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:32:43,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:32:43,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:32:43,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:32:43,369 INFO L87 Difference]: Start difference. First operand has 240 states, 155 states have (on average 1.5161290322580645) internal successors, (235), 156 states have internal predecessors, (235), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) Second operand has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-05 21:32:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:32:43,416 INFO L93 Difference]: Finished difference Result 474 states and 875 transitions. [2025-02-05 21:32:43,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:32:43,419 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) Word has length 518 [2025-02-05 21:32:43,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:32:43,428 INFO L225 Difference]: With dead ends: 474 [2025-02-05 21:32:43,429 INFO L226 Difference]: Without dead ends: 237 [2025-02-05 21:32:43,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:32:43,437 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:32:43,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 384 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:32:43,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-02-05 21:32:43,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2025-02-05 21:32:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 153 states have (on average 1.4901960784313726) internal successors, (228), 153 states have internal predecessors, (228), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 21:32:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 392 transitions. [2025-02-05 21:32:43,510 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 392 transitions. Word has length 518 [2025-02-05 21:32:43,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:32:43,511 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 392 transitions. [2025-02-05 21:32:43,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-05 21:32:43,512 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 392 transitions. [2025-02-05 21:32:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-02-05 21:32:43,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:43,525 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:43,537 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:32:43,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:32:43,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:43,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:43,728 INFO L85 PathProgramCache]: Analyzing trace with hash 288418745, now seen corresponding path program 1 times [2025-02-05 21:32:43,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:43,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921300062] [2025-02-05 21:32:43,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:43,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:43,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-02-05 21:32:43,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-02-05 21:32:43,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:43,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:32:44,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:32:44,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921300062] [2025-02-05 21:32:44,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921300062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:32:44,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:32:44,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:32:44,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935992792] [2025-02-05 21:32:44,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:32:44,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:32:44,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:32:44,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:32:44,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:32:44,163 INFO L87 Difference]: Start difference. First operand 237 states and 392 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:32:44,267 INFO L93 Difference]: Finished difference Result 704 states and 1168 transitions. [2025-02-05 21:32:44,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:32:44,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-02-05 21:32:44,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:32:44,275 INFO L225 Difference]: With dead ends: 704 [2025-02-05 21:32:44,275 INFO L226 Difference]: Without dead ends: 470 [2025-02-05 21:32:44,276 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:32:44,277 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 376 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:32:44,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 747 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:32:44,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-02-05 21:32:44,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2025-02-05 21:32:44,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 301 states have (on average 1.478405315614618) internal successors, (445), 301 states have internal predecessors, (445), 164 states have call successors, (164), 2 states have call predecessors, (164), 2 states have return successors, (164), 164 states have call predecessors, (164), 164 states have call successors, (164) [2025-02-05 21:32:44,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 773 transitions. [2025-02-05 21:32:44,358 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 773 transitions. Word has length 518 [2025-02-05 21:32:44,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:32:44,361 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 773 transitions. [2025-02-05 21:32:44,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:44,361 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 773 transitions. [2025-02-05 21:32:44,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-02-05 21:32:44,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:44,367 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:44,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:32:44,367 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:44,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:44,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1405462729, now seen corresponding path program 1 times [2025-02-05 21:32:44,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:44,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323445636] [2025-02-05 21:32:44,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:44,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:44,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-02-05 21:32:44,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-02-05 21:32:44,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:44,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:32:44,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:32:44,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323445636] [2025-02-05 21:32:44,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323445636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:32:44,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:32:44,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:32:44,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124651063] [2025-02-05 21:32:44,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:32:44,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:32:44,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:32:44,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:32:44,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:32:44,681 INFO L87 Difference]: Start difference. First operand 468 states and 773 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:44,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:32:44,756 INFO L93 Difference]: Finished difference Result 1181 states and 1954 transitions. [2025-02-05 21:32:44,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:32:44,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-02-05 21:32:44,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:32:44,766 INFO L225 Difference]: With dead ends: 1181 [2025-02-05 21:32:44,767 INFO L226 Difference]: Without dead ends: 716 [2025-02-05 21:32:44,769 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:32:44,771 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 184 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:32:44,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 747 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:32:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-02-05 21:32:44,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 712. [2025-02-05 21:32:44,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 509 states have (on average 1.5343811394891944) internal successors, (781), 511 states have internal predecessors, (781), 198 states have call successors, (198), 4 states have call predecessors, (198), 4 states have return successors, (198), 196 states have call predecessors, (198), 198 states have call successors, (198) [2025-02-05 21:32:44,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1177 transitions. [2025-02-05 21:32:44,846 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1177 transitions. Word has length 518 [2025-02-05 21:32:44,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:32:44,851 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 1177 transitions. [2025-02-05 21:32:44,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:44,852 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1177 transitions. [2025-02-05 21:32:44,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-02-05 21:32:44,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:44,858 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:44,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:32:44,859 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:44,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:44,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1374442922, now seen corresponding path program 1 times [2025-02-05 21:32:44,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:44,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279595045] [2025-02-05 21:32:44,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:44,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:44,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-02-05 21:32:44,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-02-05 21:32:44,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:44,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:32:45,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:32:45,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279595045] [2025-02-05 21:32:45,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279595045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:32:45,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:32:45,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:32:45,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537552832] [2025-02-05 21:32:45,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:32:45,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:32:45,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:32:45,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:32:45,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:32:45,247 INFO L87 Difference]: Start difference. First operand 712 states and 1177 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:32:45,353 INFO L93 Difference]: Finished difference Result 1919 states and 3176 transitions. [2025-02-05 21:32:45,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:32:45,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-02-05 21:32:45,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:32:45,363 INFO L225 Difference]: With dead ends: 1919 [2025-02-05 21:32:45,363 INFO L226 Difference]: Without dead ends: 1210 [2025-02-05 21:32:45,365 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:32:45,366 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 222 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:32:45,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 864 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:32:45,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2025-02-05 21:32:45,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1206. [2025-02-05 21:32:45,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 915 states have (on average 1.5595628415300546) internal successors, (1427), 921 states have internal predecessors, (1427), 282 states have call successors, (282), 8 states have call predecessors, (282), 8 states have return successors, (282), 276 states have call predecessors, (282), 282 states have call successors, (282) [2025-02-05 21:32:45,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1991 transitions. [2025-02-05 21:32:45,452 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1991 transitions. Word has length 518 [2025-02-05 21:32:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:32:45,453 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 1991 transitions. [2025-02-05 21:32:45,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1991 transitions. [2025-02-05 21:32:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-02-05 21:32:45,459 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:45,460 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:45,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:32:45,460 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:45,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:45,461 INFO L85 PathProgramCache]: Analyzing trace with hash -605272907, now seen corresponding path program 1 times [2025-02-05 21:32:45,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:45,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199732310] [2025-02-05 21:32:45,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:45,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:45,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-02-05 21:32:45,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-02-05 21:32:45,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:45,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:32:45,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:32:45,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199732310] [2025-02-05 21:32:45,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199732310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:32:45,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:32:45,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:32:45,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572100180] [2025-02-05 21:32:45,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:32:45,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:32:45,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:32:45,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:32:45,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:32:45,882 INFO L87 Difference]: Start difference. First operand 1206 states and 1991 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:32:46,569 INFO L93 Difference]: Finished difference Result 4137 states and 6785 transitions. [2025-02-05 21:32:46,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:32:46,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-02-05 21:32:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:32:46,586 INFO L225 Difference]: With dead ends: 4137 [2025-02-05 21:32:46,586 INFO L226 Difference]: Without dead ends: 2934 [2025-02-05 21:32:46,590 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:32:46,591 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 514 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:32:46,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1080 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:32:46,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2025-02-05 21:32:46,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2294. [2025-02-05 21:32:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 1759 states have (on average 1.5616827743035815) internal successors, (2747), 1773 states have internal predecessors, (2747), 518 states have call successors, (518), 16 states have call predecessors, (518), 16 states have return successors, (518), 504 states have call predecessors, (518), 518 states have call successors, (518) [2025-02-05 21:32:46,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 3783 transitions. [2025-02-05 21:32:46,734 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 3783 transitions. Word has length 518 [2025-02-05 21:32:46,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:32:46,735 INFO L471 AbstractCegarLoop]: Abstraction has 2294 states and 3783 transitions. [2025-02-05 21:32:46,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 3783 transitions. [2025-02-05 21:32:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-02-05 21:32:46,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:46,762 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:46,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:32:46,763 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:46,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:46,763 INFO L85 PathProgramCache]: Analyzing trace with hash 748036790, now seen corresponding path program 1 times [2025-02-05 21:32:46,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:46,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721457338] [2025-02-05 21:32:46,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:46,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:46,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-02-05 21:32:46,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-02-05 21:32:46,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:46,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:32:47,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:32:47,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721457338] [2025-02-05 21:32:47,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721457338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:32:47,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:32:47,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:32:47,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098649336] [2025-02-05 21:32:47,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:32:47,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:32:47,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:32:47,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:32:47,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:32:47,035 INFO L87 Difference]: Start difference. First operand 2294 states and 3783 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:47,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:32:47,257 INFO L93 Difference]: Finished difference Result 5665 states and 9316 transitions. [2025-02-05 21:32:47,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:32:47,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-02-05 21:32:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:32:47,277 INFO L225 Difference]: With dead ends: 5665 [2025-02-05 21:32:47,277 INFO L226 Difference]: Without dead ends: 3374 [2025-02-05 21:32:47,284 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:32:47,285 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 386 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:32:47,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1051 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:32:47,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3374 states. [2025-02-05 21:32:47,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3374 to 2179. [2025-02-05 21:32:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2179 states, 1582 states have (on average 1.5183312262958282) internal successors, (2402), 1597 states have internal predecessors, (2402), 577 states have call successors, (577), 19 states have call predecessors, (577), 19 states have return successors, (577), 562 states have call predecessors, (577), 577 states have call successors, (577) [2025-02-05 21:32:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 3556 transitions. [2025-02-05 21:32:47,479 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 3556 transitions. Word has length 518 [2025-02-05 21:32:47,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:32:47,480 INFO L471 AbstractCegarLoop]: Abstraction has 2179 states and 3556 transitions. [2025-02-05 21:32:47,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 3556 transitions. [2025-02-05 21:32:47,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-02-05 21:32:47,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:47,487 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:47,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:32:47,487 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:47,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:47,488 INFO L85 PathProgramCache]: Analyzing trace with hash -254472970, now seen corresponding path program 1 times [2025-02-05 21:32:47,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:47,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275261892] [2025-02-05 21:32:47,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:47,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:47,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-02-05 21:32:47,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-02-05 21:32:47,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:47,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:47,951 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:32:47,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:32:47,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275261892] [2025-02-05 21:32:47,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275261892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:32:47,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:32:47,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:32:47,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702551480] [2025-02-05 21:32:47,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:32:47,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:32:47,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:32:47,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:32:47,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:32:47,953 INFO L87 Difference]: Start difference. First operand 2179 states and 3556 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-05 21:32:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:32:49,496 INFO L93 Difference]: Finished difference Result 10967 states and 17731 transitions. [2025-02-05 21:32:49,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:32:49,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 518 [2025-02-05 21:32:49,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:32:49,538 INFO L225 Difference]: With dead ends: 10967 [2025-02-05 21:32:49,538 INFO L226 Difference]: Without dead ends: 8900 [2025-02-05 21:32:49,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:32:49,545 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 1173 mSDsluCounter, 2069 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:32:49,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 2451 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:32:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8900 states. [2025-02-05 21:32:50,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8900 to 4990. [2025-02-05 21:32:50,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4990 states, 3683 states have (on average 1.5329894108064077) internal successors, (5646), 3716 states have internal predecessors, (5646), 1263 states have call successors, (1263), 43 states have call predecessors, (1263), 43 states have return successors, (1263), 1230 states have call predecessors, (1263), 1263 states have call successors, (1263) [2025-02-05 21:32:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4990 states to 4990 states and 8172 transitions. [2025-02-05 21:32:50,071 INFO L78 Accepts]: Start accepts. Automaton has 4990 states and 8172 transitions. Word has length 518 [2025-02-05 21:32:50,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:32:50,072 INFO L471 AbstractCegarLoop]: Abstraction has 4990 states and 8172 transitions. [2025-02-05 21:32:50,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-05 21:32:50,072 INFO L276 IsEmpty]: Start isEmpty. Operand 4990 states and 8172 transitions. [2025-02-05 21:32:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-02-05 21:32:50,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:50,078 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:50,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:32:50,078 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:50,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:50,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1098836727, now seen corresponding path program 1 times [2025-02-05 21:32:50,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:50,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143007931] [2025-02-05 21:32:50,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:50,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:50,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-02-05 21:32:50,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-02-05 21:32:50,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:50,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:32:50,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:32:50,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143007931] [2025-02-05 21:32:50,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143007931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:32:50,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:32:50,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:32:50,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187878415] [2025-02-05 21:32:50,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:32:50,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:32:50,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:32:50,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:32:50,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:32:50,378 INFO L87 Difference]: Start difference. First operand 4990 states and 8172 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:50,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:32:50,789 INFO L93 Difference]: Finished difference Result 14746 states and 24180 transitions. [2025-02-05 21:32:50,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:32:50,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-02-05 21:32:50,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:32:50,844 INFO L225 Difference]: With dead ends: 14746 [2025-02-05 21:32:50,844 INFO L226 Difference]: Without dead ends: 9868 [2025-02-05 21:32:50,860 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:32:50,860 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 247 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:32:50,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1173 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:32:50,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9868 states. [2025-02-05 21:32:51,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9868 to 9866. [2025-02-05 21:32:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9866 states, 7315 states have (on average 1.5312371838687628) internal successors, (11201), 7380 states have internal predecessors, (11201), 2467 states have call successors, (2467), 83 states have call predecessors, (2467), 83 states have return successors, (2467), 2402 states have call predecessors, (2467), 2467 states have call successors, (2467) [2025-02-05 21:32:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9866 states to 9866 states and 16135 transitions. [2025-02-05 21:32:51,687 INFO L78 Accepts]: Start accepts. Automaton has 9866 states and 16135 transitions. Word has length 518 [2025-02-05 21:32:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:32:51,690 INFO L471 AbstractCegarLoop]: Abstraction has 9866 states and 16135 transitions. [2025-02-05 21:32:51,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 9866 states and 16135 transitions. [2025-02-05 21:32:51,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-02-05 21:32:51,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:51,707 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:51,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:32:51,708 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:51,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:51,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1262067051, now seen corresponding path program 1 times [2025-02-05 21:32:51,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:51,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833461319] [2025-02-05 21:32:51,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:51,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:51,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-02-05 21:32:51,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-02-05 21:32:51,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:51,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:32:52,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:32:52,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833461319] [2025-02-05 21:32:52,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833461319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:32:52,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:32:52,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:32:52,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991534562] [2025-02-05 21:32:52,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:32:52,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:32:52,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:32:52,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:32:52,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:32:52,279 INFO L87 Difference]: Start difference. First operand 9866 states and 16135 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-05 21:32:53,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:32:53,893 INFO L93 Difference]: Finished difference Result 27578 states and 45043 transitions. [2025-02-05 21:32:53,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:32:53,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 518 [2025-02-05 21:32:53,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:32:53,956 INFO L225 Difference]: With dead ends: 27578 [2025-02-05 21:32:53,957 INFO L226 Difference]: Without dead ends: 17824 [2025-02-05 21:32:53,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:32:53,989 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 1411 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:32:53,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1411 Valid, 2063 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:32:54,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17824 states. [2025-02-05 21:32:55,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17824 to 16810. [2025-02-05 21:32:55,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16810 states, 12591 states have (on average 1.5316495909776824) internal successors, (19285), 12720 states have internal predecessors, (19285), 4067 states have call successors, (4067), 151 states have call predecessors, (4067), 151 states have return successors, (4067), 3938 states have call predecessors, (4067), 4067 states have call successors, (4067) [2025-02-05 21:32:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16810 states to 16810 states and 27419 transitions. [2025-02-05 21:32:55,342 INFO L78 Accepts]: Start accepts. Automaton has 16810 states and 27419 transitions. Word has length 518 [2025-02-05 21:32:55,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:32:55,343 INFO L471 AbstractCegarLoop]: Abstraction has 16810 states and 27419 transitions. [2025-02-05 21:32:55,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-05 21:32:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 16810 states and 27419 transitions. [2025-02-05 21:32:55,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-02-05 21:32:55,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:55,357 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:55,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:32:55,357 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:55,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:55,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1439050419, now seen corresponding path program 1 times [2025-02-05 21:32:55,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:55,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112019259] [2025-02-05 21:32:55,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:55,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:55,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-02-05 21:32:55,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-02-05 21:32:55,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:55,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:32:55,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:32:55,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112019259] [2025-02-05 21:32:55,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112019259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:32:55,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:32:55,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:32:55,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752679482] [2025-02-05 21:32:55,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:32:55,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:32:55,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:32:55,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:32:55,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:32:55,510 INFO L87 Difference]: Start difference. First operand 16810 states and 27419 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:56,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:32:56,265 INFO L93 Difference]: Finished difference Result 30674 states and 49801 transitions. [2025-02-05 21:32:56,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:32:56,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-02-05 21:32:56,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:32:56,325 INFO L225 Difference]: With dead ends: 30674 [2025-02-05 21:32:56,325 INFO L226 Difference]: Without dead ends: 13976 [2025-02-05 21:32:56,362 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:32:56,363 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 203 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:32:56,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 846 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:32:56,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13976 states. [2025-02-05 21:32:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13976 to 11542. [2025-02-05 21:32:57,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11542 states, 8411 states have (on average 1.5012483652360005) internal successors, (12627), 8476 states have internal predecessors, (12627), 2979 states have call successors, (2979), 151 states have call predecessors, (2979), 151 states have return successors, (2979), 2914 states have call predecessors, (2979), 2979 states have call successors, (2979) [2025-02-05 21:32:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11542 states to 11542 states and 18585 transitions. [2025-02-05 21:32:57,088 INFO L78 Accepts]: Start accepts. Automaton has 11542 states and 18585 transitions. Word has length 518 [2025-02-05 21:32:57,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:32:57,089 INFO L471 AbstractCegarLoop]: Abstraction has 11542 states and 18585 transitions. [2025-02-05 21:32:57,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 11542 states and 18585 transitions. [2025-02-05 21:32:57,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-02-05 21:32:57,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:32:57,096 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:57,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:32:57,097 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:32:57,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:32:57,097 INFO L85 PathProgramCache]: Analyzing trace with hash -915997227, now seen corresponding path program 1 times [2025-02-05 21:32:57,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:32:57,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420157271] [2025-02-05 21:32:57,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:32:57,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:32:57,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-02-05 21:32:57,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-02-05 21:32:57,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:32:57,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:32:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:32:57,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:32:57,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420157271] [2025-02-05 21:32:57,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420157271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:32:57,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:32:57,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:32:57,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652379588] [2025-02-05 21:32:57,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:32:57,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:32:57,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:32:57,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:32:57,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:32:57,326 INFO L87 Difference]: Start difference. First operand 11542 states and 18585 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:32:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:32:58,398 INFO L93 Difference]: Finished difference Result 31930 states and 51345 transitions. [2025-02-05 21:32:58,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:32:58,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-02-05 21:32:58,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:32:58,469 INFO L225 Difference]: With dead ends: 31930 [2025-02-05 21:32:58,469 INFO L226 Difference]: Without dead ends: 20500 [2025-02-05 21:32:58,496 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:32:58,496 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 230 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:32:58,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1029 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:32:58,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20500 states. [2025-02-05 21:33:00,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20500 to 20498. [2025-02-05 21:33:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20498 states, 14655 states have (on average 1.4745138178096213) internal successors, (21609), 14776 states have internal predecessors, (21609), 5563 states have call successors, (5563), 279 states have call predecessors, (5563), 279 states have return successors, (5563), 5442 states have call predecessors, (5563), 5563 states have call successors, (5563) [2025-02-05 21:33:00,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20498 states to 20498 states and 32735 transitions. [2025-02-05 21:33:00,241 INFO L78 Accepts]: Start accepts. Automaton has 20498 states and 32735 transitions. Word has length 518 [2025-02-05 21:33:00,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:00,242 INFO L471 AbstractCegarLoop]: Abstraction has 20498 states and 32735 transitions. [2025-02-05 21:33:00,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:33:00,243 INFO L276 IsEmpty]: Start isEmpty. Operand 20498 states and 32735 transitions. [2025-02-05 21:33:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-02-05 21:33:00,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:00,253 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:00,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:33:00,253 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:00,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:00,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1034303028, now seen corresponding path program 1 times [2025-02-05 21:33:00,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:00,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048362283] [2025-02-05 21:33:00,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:00,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:00,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-02-05 21:33:00,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-02-05 21:33:00,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:00,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:00,551 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:33:00,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:00,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048362283] [2025-02-05 21:33:00,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048362283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:00,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:00,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:33:00,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125213296] [2025-02-05 21:33:00,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:00,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:33:00,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:00,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:33:00,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:33:00,554 INFO L87 Difference]: Start difference. First operand 20498 states and 32735 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-05 21:33:02,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:02,642 INFO L93 Difference]: Finished difference Result 52858 states and 84017 transitions. [2025-02-05 21:33:02,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:33:02,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 518 [2025-02-05 21:33:02,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:02,777 INFO L225 Difference]: With dead ends: 52858 [2025-02-05 21:33:02,777 INFO L226 Difference]: Without dead ends: 32472 [2025-02-05 21:33:02,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:33:02,835 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 713 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:02,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 2051 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:33:02,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32472 states. [2025-02-05 21:33:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32472 to 21650. [2025-02-05 21:33:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21650 states, 15807 states have (on average 1.484468906180806) internal successors, (23465), 15928 states have internal predecessors, (23465), 5563 states have call successors, (5563), 279 states have call predecessors, (5563), 279 states have return successors, (5563), 5442 states have call predecessors, (5563), 5563 states have call successors, (5563) [2025-02-05 21:33:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21650 states to 21650 states and 34591 transitions. [2025-02-05 21:33:04,297 INFO L78 Accepts]: Start accepts. Automaton has 21650 states and 34591 transitions. Word has length 518 [2025-02-05 21:33:04,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:04,298 INFO L471 AbstractCegarLoop]: Abstraction has 21650 states and 34591 transitions. [2025-02-05 21:33:04,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-05 21:33:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 21650 states and 34591 transitions. [2025-02-05 21:33:04,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-02-05 21:33:04,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:04,307 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:04,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:33:04,308 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:04,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:04,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1907354571, now seen corresponding path program 1 times [2025-02-05 21:33:04,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:04,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758970169] [2025-02-05 21:33:04,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:04,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:04,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-02-05 21:33:04,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-02-05 21:33:04,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:04,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:33:04,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:04,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758970169] [2025-02-05 21:33:04,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758970169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:04,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:04,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:33:04,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690448296] [2025-02-05 21:33:04,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:04,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:33:04,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:04,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:33:04,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:33:04,624 INFO L87 Difference]: Start difference. First operand 21650 states and 34591 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-05 21:33:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:07,708 INFO L93 Difference]: Finished difference Result 52778 states and 84011 transitions. [2025-02-05 21:33:07,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:33:07,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 518 [2025-02-05 21:33:07,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:07,862 INFO L225 Difference]: With dead ends: 52778 [2025-02-05 21:33:07,863 INFO L226 Difference]: Without dead ends: 31240 [2025-02-05 21:33:07,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:33:07,926 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 1069 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:07,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1979 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:33:07,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31240 states. [2025-02-05 21:33:09,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31240 to 21074. [2025-02-05 21:33:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21074 states, 15231 states have (on average 1.4791543562471277) internal successors, (22529), 15352 states have internal predecessors, (22529), 5563 states have call successors, (5563), 279 states have call predecessors, (5563), 279 states have return successors, (5563), 5442 states have call predecessors, (5563), 5563 states have call successors, (5563) [2025-02-05 21:33:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21074 states to 21074 states and 33655 transitions. [2025-02-05 21:33:09,485 INFO L78 Accepts]: Start accepts. Automaton has 21074 states and 33655 transitions. Word has length 518 [2025-02-05 21:33:09,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:09,486 INFO L471 AbstractCegarLoop]: Abstraction has 21074 states and 33655 transitions. [2025-02-05 21:33:09,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-05 21:33:09,486 INFO L276 IsEmpty]: Start isEmpty. Operand 21074 states and 33655 transitions. [2025-02-05 21:33:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-02-05 21:33:09,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:09,494 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:09,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:33:09,495 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:09,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:09,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1129501724, now seen corresponding path program 1 times [2025-02-05 21:33:09,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:09,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630831179] [2025-02-05 21:33:09,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:09,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:09,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-02-05 21:33:09,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-02-05 21:33:09,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:09,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:33:09,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:09,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630831179] [2025-02-05 21:33:09,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630831179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:09,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:09,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:33:09,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301581390] [2025-02-05 21:33:09,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:09,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:33:09,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:09,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:33:09,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:33:09,787 INFO L87 Difference]: Start difference. First operand 21074 states and 33655 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:33:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:13,105 INFO L93 Difference]: Finished difference Result 58830 states and 93663 transitions. [2025-02-05 21:33:13,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:33:13,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 519 [2025-02-05 21:33:13,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:13,408 INFO L225 Difference]: With dead ends: 58830 [2025-02-05 21:33:13,411 INFO L226 Difference]: Without dead ends: 47400 [2025-02-05 21:33:13,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:33:13,493 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 862 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:13,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1176 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:33:13,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47400 states. [2025-02-05 21:33:15,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47400 to 25050. [2025-02-05 21:33:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25050 states, 18495 states have (on average 1.4979724249797242) internal successors, (27705), 18632 states have internal predecessors, (27705), 6235 states have call successors, (6235), 319 states have call predecessors, (6235), 319 states have return successors, (6235), 6098 states have call predecessors, (6235), 6235 states have call successors, (6235) [2025-02-05 21:33:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25050 states to 25050 states and 40175 transitions. [2025-02-05 21:33:15,473 INFO L78 Accepts]: Start accepts. Automaton has 25050 states and 40175 transitions. Word has length 519 [2025-02-05 21:33:15,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:15,473 INFO L471 AbstractCegarLoop]: Abstraction has 25050 states and 40175 transitions. [2025-02-05 21:33:15,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:33:15,474 INFO L276 IsEmpty]: Start isEmpty. Operand 25050 states and 40175 transitions. [2025-02-05 21:33:15,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-02-05 21:33:15,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:15,482 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:15,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:33:15,482 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:15,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:15,483 INFO L85 PathProgramCache]: Analyzing trace with hash 223807973, now seen corresponding path program 1 times [2025-02-05 21:33:15,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:15,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471386414] [2025-02-05 21:33:15,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:15,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:15,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-02-05 21:33:15,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-02-05 21:33:15,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:15,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:33:15,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:15,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471386414] [2025-02-05 21:33:15,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471386414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:15,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:15,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:33:15,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478108460] [2025-02-05 21:33:15,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:15,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:33:15,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:15,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:33:15,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:33:15,773 INFO L87 Difference]: Start difference. First operand 25050 states and 40175 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:33:18,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:18,635 INFO L93 Difference]: Finished difference Result 53388 states and 85708 transitions. [2025-02-05 21:33:18,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:33:18,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 519 [2025-02-05 21:33:18,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:18,781 INFO L225 Difference]: With dead ends: 53388 [2025-02-05 21:33:18,782 INFO L226 Difference]: Without dead ends: 39662 [2025-02-05 21:33:18,821 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:33:18,821 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 536 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:18,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1598 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:33:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39662 states. [2025-02-05 21:33:21,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39662 to 33342. [2025-02-05 21:33:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33342 states, 24075 states have (on average 1.48398753894081) internal successors, (35727), 24268 states have internal predecessors, (35727), 8819 states have call successors, (8819), 447 states have call predecessors, (8819), 447 states have return successors, (8819), 8626 states have call predecessors, (8819), 8819 states have call successors, (8819) [2025-02-05 21:33:21,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33342 states to 33342 states and 53365 transitions. [2025-02-05 21:33:21,405 INFO L78 Accepts]: Start accepts. Automaton has 33342 states and 53365 transitions. Word has length 519 [2025-02-05 21:33:21,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:21,406 INFO L471 AbstractCegarLoop]: Abstraction has 33342 states and 53365 transitions. [2025-02-05 21:33:21,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:33:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 33342 states and 53365 transitions. [2025-02-05 21:33:21,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-02-05 21:33:21,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:21,417 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:21,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 21:33:21,418 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:21,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:21,419 INFO L85 PathProgramCache]: Analyzing trace with hash 421164389, now seen corresponding path program 1 times [2025-02-05 21:33:21,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:21,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560989534] [2025-02-05 21:33:21,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:21,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:21,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-02-05 21:33:21,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-02-05 21:33:21,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:21,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:33:21,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:21,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560989534] [2025-02-05 21:33:21,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560989534] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:21,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:21,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:33:21,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795360404] [2025-02-05 21:33:21,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:21,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:33:21,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:21,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:33:21,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:33:21,917 INFO L87 Difference]: Start difference. First operand 33342 states and 53365 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:33:24,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:24,979 INFO L93 Difference]: Finished difference Result 83350 states and 133257 transitions. [2025-02-05 21:33:24,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:33:24,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 519 [2025-02-05 21:33:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:25,172 INFO L225 Difference]: With dead ends: 83350 [2025-02-05 21:33:25,173 INFO L226 Difference]: Without dead ends: 50120 [2025-02-05 21:33:25,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:33:25,250 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 235 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:25,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 751 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:33:25,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50120 states. [2025-02-05 21:33:28,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50120 to 50118. [2025-02-05 21:33:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50118 states, 36249 states have (on average 1.4787994151562802) internal successors, (53605), 36538 states have internal predecessors, (53605), 13199 states have call successors, (13199), 669 states have call predecessors, (13199), 669 states have return successors, (13199), 12910 states have call predecessors, (13199), 13199 states have call successors, (13199) [2025-02-05 21:33:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50118 states to 50118 states and 80003 transitions. [2025-02-05 21:33:29,254 INFO L78 Accepts]: Start accepts. Automaton has 50118 states and 80003 transitions. Word has length 519 [2025-02-05 21:33:29,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:29,255 INFO L471 AbstractCegarLoop]: Abstraction has 50118 states and 80003 transitions. [2025-02-05 21:33:29,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:33:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 50118 states and 80003 transitions. [2025-02-05 21:33:29,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-02-05 21:33:29,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:29,266 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:29,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 21:33:29,267 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:29,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:29,272 INFO L85 PathProgramCache]: Analyzing trace with hash -501519194, now seen corresponding path program 1 times [2025-02-05 21:33:29,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:29,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588701665] [2025-02-05 21:33:29,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:29,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:29,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-02-05 21:33:29,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-02-05 21:33:29,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:29,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:33:30,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:30,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588701665] [2025-02-05 21:33:30,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588701665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:30,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:30,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 21:33:30,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236737964] [2025-02-05 21:33:30,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:30,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:33:30,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:30,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:33:30,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:33:30,918 INFO L87 Difference]: Start difference. First operand 50118 states and 80003 transitions. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-05 21:33:38,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:38,456 INFO L93 Difference]: Finished difference Result 84774 states and 135759 transitions. [2025-02-05 21:33:38,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 21:33:38,457 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 519 [2025-02-05 21:33:38,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:38,644 INFO L225 Difference]: With dead ends: 84774 [2025-02-05 21:33:38,644 INFO L226 Difference]: Without dead ends: 51440 [2025-02-05 21:33:38,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:33:38,719 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 2132 mSDsluCounter, 3270 mSDsCounter, 0 mSdLazyCounter, 3769 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2132 SdHoareTripleChecker+Valid, 4267 SdHoareTripleChecker+Invalid, 4490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 721 IncrementalHoareTripleChecker+Valid, 3769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:38,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2132 Valid, 4267 Invalid, 4490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 3769 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-02-05 21:33:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51440 states. [2025-02-05 21:33:43,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51440 to 48272. [2025-02-05 21:33:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48272 states, 35095 states have (on average 1.4788716341359167) internal successors, (51901), 35370 states have internal predecessors, (51901), 12533 states have call successors, (12533), 643 states have call predecessors, (12533), 643 states have return successors, (12533), 12258 states have call predecessors, (12533), 12533 states have call successors, (12533) [2025-02-05 21:33:43,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48272 states to 48272 states and 76967 transitions. [2025-02-05 21:33:43,303 INFO L78 Accepts]: Start accepts. Automaton has 48272 states and 76967 transitions. Word has length 519 [2025-02-05 21:33:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:43,304 INFO L471 AbstractCegarLoop]: Abstraction has 48272 states and 76967 transitions. [2025-02-05 21:33:43,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-02-05 21:33:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 48272 states and 76967 transitions. [2025-02-05 21:33:43,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-02-05 21:33:43,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:43,315 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:43,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 21:33:43,315 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:43,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:43,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2092707623, now seen corresponding path program 1 times [2025-02-05 21:33:43,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:43,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886772290] [2025-02-05 21:33:43,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:43,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:43,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-02-05 21:33:43,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-02-05 21:33:43,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:43,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:43,586 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:33:43,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:43,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886772290] [2025-02-05 21:33:43,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886772290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:43,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:43,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:33:43,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131477818] [2025-02-05 21:33:43,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:43,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:33:43,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:43,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:33:43,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:33:43,588 INFO L87 Difference]: Start difference. First operand 48272 states and 76967 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:33:49,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:33:49,421 INFO L93 Difference]: Finished difference Result 98526 states and 157335 transitions. [2025-02-05 21:33:49,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:33:49,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 519 [2025-02-05 21:33:49,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:33:49,692 INFO L225 Difference]: With dead ends: 98526 [2025-02-05 21:33:49,693 INFO L226 Difference]: Without dead ends: 67230 [2025-02-05 21:33:49,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:33:49,783 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 1269 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:33:49,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 1690 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 21:33:49,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67230 states. [2025-02-05 21:33:55,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67230 to 65716. [2025-02-05 21:33:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65716 states, 47391 states have (on average 1.467092907936106) internal successors, (69527), 47760 states have internal predecessors, (69527), 17423 states have call successors, (17423), 901 states have call predecessors, (17423), 901 states have return successors, (17423), 17054 states have call predecessors, (17423), 17423 states have call successors, (17423) [2025-02-05 21:33:55,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65716 states to 65716 states and 104373 transitions. [2025-02-05 21:33:55,535 INFO L78 Accepts]: Start accepts. Automaton has 65716 states and 104373 transitions. Word has length 519 [2025-02-05 21:33:55,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:33:55,536 INFO L471 AbstractCegarLoop]: Abstraction has 65716 states and 104373 transitions. [2025-02-05 21:33:55,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-02-05 21:33:55,536 INFO L276 IsEmpty]: Start isEmpty. Operand 65716 states and 104373 transitions. [2025-02-05 21:33:55,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-02-05 21:33:55,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:33:55,550 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:55,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 21:33:55,550 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:33:55,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:33:55,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1899998376, now seen corresponding path program 1 times [2025-02-05 21:33:55,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:33:55,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728534518] [2025-02-05 21:33:55,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:33:55,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:33:55,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-02-05 21:33:55,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-02-05 21:33:55,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:33:55,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:33:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-02-05 21:33:56,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:33:56,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728534518] [2025-02-05 21:33:56,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728534518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:33:56,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:33:56,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:33:56,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782056997] [2025-02-05 21:33:56,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:33:56,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:33:56,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:33:56,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:33:56,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:33:56,513 INFO L87 Difference]: Start difference. First operand 65716 states and 104373 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82)