./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label47.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/eca-rers2012/Problem03_label47.c -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 c56a954c6b6423eb9dc896d65464ae85499e68477be4edbb5172c2d6eb981204 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:57:36,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:57:36,157 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:57:36,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:57:36,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:57:36,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:57:36,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:57:36,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:57:36,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:57:36,175 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:57:36,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:57:36,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:57:36,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:57:36,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:57:36,175 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:57:36,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:57:36,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:57:36,176 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:57:36,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:57:36,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:57:36,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:57:36,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:57:36,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:57:36,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:57:36,176 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:57:36,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:57:36,176 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:57:36,177 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:57:36,177 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:57:36,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:57:36,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:57:36,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:57:36,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:57:36,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:57:36,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:57:36,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:57:36,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:57:36,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:57:36,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:57:36,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:57:36,178 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:57:36,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:57:36,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:57:36,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:57:36,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:57:36,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:57:36,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:57:36,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:57:36,178 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 -> c56a954c6b6423eb9dc896d65464ae85499e68477be4edbb5172c2d6eb981204 [2025-01-08 22:57:36,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:57:36,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:57:36,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:57:36,423 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:57:36,423 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:57:36,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label47.c [2025-01-08 22:57:37,572 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/058710250/17099655568c4142921ce273aa845e3f/FLAG95edbb56e [2025-01-08 22:57:37,975 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:57:37,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label47.c [2025-01-08 22:57:37,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/058710250/17099655568c4142921ce273aa845e3f/FLAG95edbb56e [2025-01-08 22:57:38,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/058710250/17099655568c4142921ce273aa845e3f [2025-01-08 22:57:38,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:57:38,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:57:38,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:57:38,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:57:38,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:57:38,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:57:38" (1/1) ... [2025-01-08 22:57:38,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6b090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:38, skipping insertion in model container [2025-01-08 22:57:38,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:57:38" (1/1) ... [2025-01-08 22:57:38,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:57:38,373 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/eca-rers2012/Problem03_label47.c[60825,60838] [2025-01-08 22:57:38,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:57:38,410 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:57:38,539 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/eca-rers2012/Problem03_label47.c[60825,60838] [2025-01-08 22:57:38,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:57:38,566 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:57:38,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:38 WrapperNode [2025-01-08 22:57:38,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:57:38,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:57:38,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:57:38,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:57:38,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:38" (1/1) ... [2025-01-08 22:57:38,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:38" (1/1) ... [2025-01-08 22:57:38,684 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-01-08 22:57:38,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:57:38,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:57:38,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:57:38,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:57:38,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:38" (1/1) ... [2025-01-08 22:57:38,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:38" (1/1) ... [2025-01-08 22:57:38,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:38" (1/1) ... [2025-01-08 22:57:38,738 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-01-08 22:57:38,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:38" (1/1) ... [2025-01-08 22:57:38,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:38" (1/1) ... [2025-01-08 22:57:38,779 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:38" (1/1) ... [2025-01-08 22:57:38,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:38" (1/1) ... [2025-01-08 22:57:38,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:38" (1/1) ... [2025-01-08 22:57:38,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:38" (1/1) ... [2025-01-08 22:57:38,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:38" (1/1) ... [2025-01-08 22:57:38,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:57:38,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:57:38,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:57:38,818 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:57:38,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:38" (1/1) ... [2025-01-08 22:57:38,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:57:38,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:57:38,840 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-01-08 22:57:38,846 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-01-08 22:57:38,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:57:38,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:57:38,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:57:38,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:57:38,918 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:57:38,919 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:57:40,238 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-01-08 22:57:40,239 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:57:40,254 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:57:40,257 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:57:40,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:57:40 BoogieIcfgContainer [2025-01-08 22:57:40,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:57:40,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:57:40,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:57:40,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:57:40,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:57:38" (1/3) ... [2025-01-08 22:57:40,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451fd9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:57:40, skipping insertion in model container [2025-01-08 22:57:40,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:38" (2/3) ... [2025-01-08 22:57:40,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451fd9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:57:40, skipping insertion in model container [2025-01-08 22:57:40,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:57:40" (3/3) ... [2025-01-08 22:57:40,266 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label47.c [2025-01-08 22:57:40,276 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:57:40,278 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label47.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:57:40,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:57:40,337 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;@64d5c2ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:57:40,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:57:40,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:40,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-08 22:57:40,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:40,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:57:40,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:40,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:40,357 INFO L85 PathProgramCache]: Analyzing trace with hash -80322202, now seen corresponding path program 1 times [2025-01-08 22:57:40,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:40,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104578409] [2025-01-08 22:57:40,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:40,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:40,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-08 22:57:40,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-08 22:57:40,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:40,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:57:41,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:41,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104578409] [2025-01-08 22:57:41,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104578409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:41,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:41,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:41,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192509823] [2025-01-08 22:57:41,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:41,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:41,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:41,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:41,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:41,182 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:41,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:41,998 INFO L93 Difference]: Finished difference Result 864 states and 1511 transitions. [2025-01-08 22:57:41,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:42,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 197 [2025-01-08 22:57:42,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:42,008 INFO L225 Difference]: With dead ends: 864 [2025-01-08 22:57:42,008 INFO L226 Difference]: Without dead ends: 468 [2025-01-08 22:57:42,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:42,013 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 81 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:42,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 165 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:57:42,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-08 22:57:42,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 454. [2025-01-08 22:57:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.6269315673289184) internal successors, (737), 453 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 737 transitions. [2025-01-08 22:57:42,060 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 737 transitions. Word has length 197 [2025-01-08 22:57:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:42,061 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 737 transitions. [2025-01-08 22:57:42,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 737 transitions. [2025-01-08 22:57:42,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-08 22:57:42,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:42,064 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:42,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:57:42,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:42,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:42,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1903729797, now seen corresponding path program 1 times [2025-01-08 22:57:42,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:42,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877362134] [2025-01-08 22:57:42,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:42,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:42,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-08 22:57:42,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-08 22:57:42,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:42,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:57:42,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:42,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877362134] [2025-01-08 22:57:42,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877362134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:42,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:42,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:42,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849247745] [2025-01-08 22:57:42,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:42,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:42,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:42,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:42,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:42,287 INFO L87 Difference]: Start difference. First operand 454 states and 737 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:42,482 INFO L93 Difference]: Finished difference Result 1354 states and 2203 transitions. [2025-01-08 22:57:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:42,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2025-01-08 22:57:42,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:42,485 INFO L225 Difference]: With dead ends: 1354 [2025-01-08 22:57:42,485 INFO L226 Difference]: Without dead ends: 902 [2025-01-08 22:57:42,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:42,487 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 366 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:42,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 601 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:57:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2025-01-08 22:57:42,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 899. [2025-01-08 22:57:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 898 states have (on average 1.6291759465478841) internal successors, (1463), 898 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1463 transitions. [2025-01-08 22:57:42,523 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1463 transitions. Word has length 202 [2025-01-08 22:57:42,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:42,523 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1463 transitions. [2025-01-08 22:57:42,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1463 transitions. [2025-01-08 22:57:42,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-08 22:57:42,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:42,529 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:42,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:57:42,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:42,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:42,530 INFO L85 PathProgramCache]: Analyzing trace with hash 260412730, now seen corresponding path program 1 times [2025-01-08 22:57:42,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:42,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431673582] [2025-01-08 22:57:42,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:42,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:42,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-08 22:57:42,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-08 22:57:42,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:42,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:57:42,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:42,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431673582] [2025-01-08 22:57:42,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431673582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:42,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:42,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:42,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313882221] [2025-01-08 22:57:42,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:42,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:42,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:42,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:42,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:42,764 INFO L87 Difference]: Start difference. First operand 899 states and 1463 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:43,358 INFO L93 Difference]: Finished difference Result 2640 states and 4313 transitions. [2025-01-08 22:57:43,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:43,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-01-08 22:57:43,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:43,364 INFO L225 Difference]: With dead ends: 2640 [2025-01-08 22:57:43,364 INFO L226 Difference]: Without dead ends: 1743 [2025-01-08 22:57:43,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:43,366 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 260 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:43,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 142 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:43,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2025-01-08 22:57:43,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1739. [2025-01-08 22:57:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1738 states have (on average 1.5391254315304947) internal successors, (2675), 1738 states have internal predecessors, (2675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2675 transitions. [2025-01-08 22:57:43,399 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2675 transitions. Word has length 203 [2025-01-08 22:57:43,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:43,399 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2675 transitions. [2025-01-08 22:57:43,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2675 transitions. [2025-01-08 22:57:43,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-08 22:57:43,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:43,402 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:43,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:57:43,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:43,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:43,403 INFO L85 PathProgramCache]: Analyzing trace with hash -100806233, now seen corresponding path program 1 times [2025-01-08 22:57:43,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:43,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872145403] [2025-01-08 22:57:43,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:43,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:43,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-08 22:57:43,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-08 22:57:43,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:43,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:57:43,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:43,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872145403] [2025-01-08 22:57:43,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872145403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:43,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:43,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:43,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204188870] [2025-01-08 22:57:43,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:43,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:43,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:43,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:43,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:43,582 INFO L87 Difference]: Start difference. First operand 1739 states and 2675 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:44,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:44,223 INFO L93 Difference]: Finished difference Result 5141 states and 7941 transitions. [2025-01-08 22:57:44,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:44,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2025-01-08 22:57:44,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:44,232 INFO L225 Difference]: With dead ends: 5141 [2025-01-08 22:57:44,232 INFO L226 Difference]: Without dead ends: 3404 [2025-01-08 22:57:44,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:44,239 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 238 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:44,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 153 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2025-01-08 22:57:44,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3368. [2025-01-08 22:57:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3367 states have (on average 1.5117315117315118) internal successors, (5090), 3367 states have internal predecessors, (5090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:44,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 5090 transitions. [2025-01-08 22:57:44,297 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 5090 transitions. Word has length 205 [2025-01-08 22:57:44,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:44,297 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 5090 transitions. [2025-01-08 22:57:44,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:44,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 5090 transitions. [2025-01-08 22:57:44,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-08 22:57:44,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:44,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:44,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:57:44,301 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:44,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:44,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1528603372, now seen corresponding path program 1 times [2025-01-08 22:57:44,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:44,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558700476] [2025-01-08 22:57:44,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:44,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:44,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-08 22:57:44,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-08 22:57:44,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:44,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:44,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:57:44,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:44,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558700476] [2025-01-08 22:57:44,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558700476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:44,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:44,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:44,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644204852] [2025-01-08 22:57:44,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:44,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:44,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:44,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:44,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:44,635 INFO L87 Difference]: Start difference. First operand 3368 states and 5090 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:45,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:45,280 INFO L93 Difference]: Finished difference Result 8405 states and 12665 transitions. [2025-01-08 22:57:45,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:45,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2025-01-08 22:57:45,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:45,295 INFO L225 Difference]: With dead ends: 8405 [2025-01-08 22:57:45,296 INFO L226 Difference]: Without dead ends: 5039 [2025-01-08 22:57:45,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:45,300 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 228 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:45,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 162 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:45,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5039 states. [2025-01-08 22:57:45,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5039 to 5015. [2025-01-08 22:57:45,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5015 states, 5014 states have (on average 1.4930195452732349) internal successors, (7486), 5014 states have internal predecessors, (7486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5015 states to 5015 states and 7486 transitions. [2025-01-08 22:57:45,384 INFO L78 Accepts]: Start accepts. Automaton has 5015 states and 7486 transitions. Word has length 207 [2025-01-08 22:57:45,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:45,384 INFO L471 AbstractCegarLoop]: Abstraction has 5015 states and 7486 transitions. [2025-01-08 22:57:45,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:45,384 INFO L276 IsEmpty]: Start isEmpty. Operand 5015 states and 7486 transitions. [2025-01-08 22:57:45,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-08 22:57:45,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:45,390 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:45,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:57:45,390 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:45,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:45,391 INFO L85 PathProgramCache]: Analyzing trace with hash 678539638, now seen corresponding path program 1 times [2025-01-08 22:57:45,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:45,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663210336] [2025-01-08 22:57:45,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:45,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:45,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-08 22:57:45,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-08 22:57:45,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:45,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:57:45,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:45,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663210336] [2025-01-08 22:57:45,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663210336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:45,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:45,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:45,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280243839] [2025-01-08 22:57:45,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:45,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:45,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:45,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:45,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:45,581 INFO L87 Difference]: Start difference. First operand 5015 states and 7486 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:46,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:46,214 INFO L93 Difference]: Finished difference Result 14727 states and 22032 transitions. [2025-01-08 22:57:46,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:46,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211 [2025-01-08 22:57:46,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:46,240 INFO L225 Difference]: With dead ends: 14727 [2025-01-08 22:57:46,240 INFO L226 Difference]: Without dead ends: 9714 [2025-01-08 22:57:46,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:46,247 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 240 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:46,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 182 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:46,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9714 states. [2025-01-08 22:57:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9714 to 9708. [2025-01-08 22:57:46,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9708 states, 9707 states have (on average 1.4130009271659627) internal successors, (13716), 9707 states have internal predecessors, (13716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9708 states to 9708 states and 13716 transitions. [2025-01-08 22:57:46,398 INFO L78 Accepts]: Start accepts. Automaton has 9708 states and 13716 transitions. Word has length 211 [2025-01-08 22:57:46,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:46,398 INFO L471 AbstractCegarLoop]: Abstraction has 9708 states and 13716 transitions. [2025-01-08 22:57:46,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:46,398 INFO L276 IsEmpty]: Start isEmpty. Operand 9708 states and 13716 transitions. [2025-01-08 22:57:46,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-08 22:57:46,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:46,409 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:57:46,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:57:46,410 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:46,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:46,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1650306015, now seen corresponding path program 1 times [2025-01-08 22:57:46,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:46,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473217369] [2025-01-08 22:57:46,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:46,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:46,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-08 22:57:46,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-08 22:57:46,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:46,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:46,905 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:57:46,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:46,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473217369] [2025-01-08 22:57:46,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473217369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:46,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:46,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:46,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579958236] [2025-01-08 22:57:46,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:46,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:57:46,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:46,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:57:46,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:57:46,906 INFO L87 Difference]: Start difference. First operand 9708 states and 13716 transitions. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:47,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:47,644 INFO L93 Difference]: Finished difference Result 19837 states and 28248 transitions. [2025-01-08 22:57:47,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:57:47,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2025-01-08 22:57:47,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:47,677 INFO L225 Difference]: With dead ends: 19837 [2025-01-08 22:57:47,677 INFO L226 Difference]: Without dead ends: 9638 [2025-01-08 22:57:47,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-01-08 22:57:47,690 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 331 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:47,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 47 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:57:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9638 states. [2025-01-08 22:57:47,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9638 to 9638. [2025-01-08 22:57:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9638 states, 9637 states have (on average 1.3069419943965965) internal successors, (12595), 9637 states have internal predecessors, (12595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9638 states to 9638 states and 12595 transitions. [2025-01-08 22:57:47,819 INFO L78 Accepts]: Start accepts. Automaton has 9638 states and 12595 transitions. Word has length 212 [2025-01-08 22:57:47,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:47,820 INFO L471 AbstractCegarLoop]: Abstraction has 9638 states and 12595 transitions. [2025-01-08 22:57:47,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:47,821 INFO L276 IsEmpty]: Start isEmpty. Operand 9638 states and 12595 transitions. [2025-01-08 22:57:47,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-08 22:57:47,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:47,833 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:47,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:57:47,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:47,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash 662550144, now seen corresponding path program 1 times [2025-01-08 22:57:47,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:47,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755052284] [2025-01-08 22:57:47,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:47,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:47,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-08 22:57:47,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-08 22:57:47,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:47,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:57:48,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:48,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755052284] [2025-01-08 22:57:48,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755052284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:48,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:48,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:48,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167672029] [2025-01-08 22:57:48,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:48,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:48,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:48,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:48,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:48,016 INFO L87 Difference]: Start difference. First operand 9638 states and 12595 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:48,701 INFO L93 Difference]: Finished difference Result 24399 states and 31920 transitions. [2025-01-08 22:57:48,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:48,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2025-01-08 22:57:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:48,725 INFO L225 Difference]: With dead ends: 24399 [2025-01-08 22:57:48,725 INFO L226 Difference]: Without dead ends: 14966 [2025-01-08 22:57:48,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:48,734 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 203 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:48,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 61 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:48,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14966 states. [2025-01-08 22:57:48,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14966 to 14962. [2025-01-08 22:57:48,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14962 states, 14961 states have (on average 1.302987768197313) internal successors, (19494), 14961 states have internal predecessors, (19494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14962 states to 14962 states and 19494 transitions. [2025-01-08 22:57:48,985 INFO L78 Accepts]: Start accepts. Automaton has 14962 states and 19494 transitions. Word has length 225 [2025-01-08 22:57:48,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:48,985 INFO L471 AbstractCegarLoop]: Abstraction has 14962 states and 19494 transitions. [2025-01-08 22:57:48,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 14962 states and 19494 transitions. [2025-01-08 22:57:49,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-08 22:57:49,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:49,002 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:49,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:57:49,002 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:49,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:49,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2032607420, now seen corresponding path program 1 times [2025-01-08 22:57:49,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:49,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555707521] [2025-01-08 22:57:49,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:49,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:49,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-08 22:57:49,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-08 22:57:49,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:49,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:57:49,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:49,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555707521] [2025-01-08 22:57:49,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555707521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:49,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:49,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:49,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329604639] [2025-01-08 22:57:49,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:49,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:57:49,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:49,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:57:49,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:57:49,411 INFO L87 Difference]: Start difference. First operand 14962 states and 19494 transitions. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:50,403 INFO L93 Difference]: Finished difference Result 37446 states and 48987 transitions. [2025-01-08 22:57:50,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:57:50,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228 [2025-01-08 22:57:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:50,438 INFO L225 Difference]: With dead ends: 37446 [2025-01-08 22:57:50,438 INFO L226 Difference]: Without dead ends: 21297 [2025-01-08 22:57:50,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-01-08 22:57:50,456 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 193 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:50,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 130 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 22:57:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21297 states. [2025-01-08 22:57:50,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21297 to 21295. [2025-01-08 22:57:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21295 states, 21294 states have (on average 1.2826617826617828) internal successors, (27313), 21294 states have internal predecessors, (27313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21295 states to 21295 states and 27313 transitions. [2025-01-08 22:57:50,684 INFO L78 Accepts]: Start accepts. Automaton has 21295 states and 27313 transitions. Word has length 228 [2025-01-08 22:57:50,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:50,684 INFO L471 AbstractCegarLoop]: Abstraction has 21295 states and 27313 transitions. [2025-01-08 22:57:50,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 21295 states and 27313 transitions. [2025-01-08 22:57:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-08 22:57:50,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:50,707 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:57:50,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:57:50,708 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:50,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:50,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1051867130, now seen corresponding path program 1 times [2025-01-08 22:57:50,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:50,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431457725] [2025-01-08 22:57:50,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:50,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:50,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-08 22:57:50,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-08 22:57:50,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:50,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:57:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431457725] [2025-01-08 22:57:50,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431457725] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:57:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139805361] [2025-01-08 22:57:50,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:50,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:57:50,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:57:50,981 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-01-08 22:57:50,985 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-01-08 22:57:51,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-08 22:57:51,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-08 22:57:51,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:51,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:51,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:57:51,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:57:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-08 22:57:51,473 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:57:51,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139805361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:51,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:57:51,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-08 22:57:51,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279761411] [2025-01-08 22:57:51,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:51,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:51,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:51,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:51,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:57:51,474 INFO L87 Difference]: Start difference. First operand 21295 states and 27313 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:52,143 INFO L93 Difference]: Finished difference Result 62429 states and 80210 transitions. [2025-01-08 22:57:52,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:52,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2025-01-08 22:57:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:52,202 INFO L225 Difference]: With dead ends: 62429 [2025-01-08 22:57:52,203 INFO L226 Difference]: Without dead ends: 41339 [2025-01-08 22:57:52,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:57:52,226 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 58 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:52,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 100 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:57:52,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41339 states. [2025-01-08 22:57:52,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41339 to 41319. [2025-01-08 22:57:52,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41319 states, 41318 states have (on average 1.249310227987802) internal successors, (51619), 41318 states have internal predecessors, (51619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41319 states to 41319 states and 51619 transitions. [2025-01-08 22:57:52,667 INFO L78 Accepts]: Start accepts. Automaton has 41319 states and 51619 transitions. Word has length 232 [2025-01-08 22:57:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:52,667 INFO L471 AbstractCegarLoop]: Abstraction has 41319 states and 51619 transitions. [2025-01-08 22:57:52,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 41319 states and 51619 transitions. [2025-01-08 22:57:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-01-08 22:57:52,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:52,698 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:57:52,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:57:52,898 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,SelfDestructingSolverStorable9 [2025-01-08 22:57:52,899 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:52,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:52,900 INFO L85 PathProgramCache]: Analyzing trace with hash -531729150, now seen corresponding path program 1 times [2025-01-08 22:57:52,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:52,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909422295] [2025-01-08 22:57:52,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:52,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:52,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-08 22:57:52,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-08 22:57:52,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:52,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:53,187 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:57:53,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:53,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909422295] [2025-01-08 22:57:53,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909422295] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:57:53,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187799055] [2025-01-08 22:57:53,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:53,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:57:53,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:57:53,191 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:57:53,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:57:53,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-08 22:57:53,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-08 22:57:53,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:53,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:53,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:57:53,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:57:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-08 22:57:53,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:57:53,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187799055] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:53,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:57:53,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:57:53,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257693868] [2025-01-08 22:57:53,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:53,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:53,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:53,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:53,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:57:53,531 INFO L87 Difference]: Start difference. First operand 41319 states and 51619 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:54,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:54,187 INFO L93 Difference]: Finished difference Result 82053 states and 102543 transitions. [2025-01-08 22:57:54,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:54,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 235 [2025-01-08 22:57:54,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:54,271 INFO L225 Difference]: With dead ends: 82053 [2025-01-08 22:57:54,272 INFO L226 Difference]: Without dead ends: 41142 [2025-01-08 22:57:54,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:57:54,304 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 27 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:54,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 306 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:57:54,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41142 states. [2025-01-08 22:57:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41142 to 41116. [2025-01-08 22:57:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41116 states, 41115 states have (on average 1.241955490696826) internal successors, (51063), 41115 states have internal predecessors, (51063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41116 states to 41116 states and 51063 transitions. [2025-01-08 22:57:54,900 INFO L78 Accepts]: Start accepts. Automaton has 41116 states and 51063 transitions. Word has length 235 [2025-01-08 22:57:54,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:54,900 INFO L471 AbstractCegarLoop]: Abstraction has 41116 states and 51063 transitions. [2025-01-08 22:57:54,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:54,901 INFO L276 IsEmpty]: Start isEmpty. Operand 41116 states and 51063 transitions. [2025-01-08 22:57:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-01-08 22:57:54,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:54,935 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:54,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 22:57:55,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:57:55,139 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:55,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:55,140 INFO L85 PathProgramCache]: Analyzing trace with hash 343835648, now seen corresponding path program 1 times [2025-01-08 22:57:55,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:55,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9814363] [2025-01-08 22:57:55,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:55,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:55,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-01-08 22:57:55,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-01-08 22:57:55,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:55,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:55,498 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-08 22:57:55,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:55,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9814363] [2025-01-08 22:57:55,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9814363] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:57:55,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688030639] [2025-01-08 22:57:55,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:55,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:57:55,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:57:55,501 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:57:55,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:57:55,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-01-08 22:57:55,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-01-08 22:57:55,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:55,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:55,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:57:55,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:57:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-08 22:57:55,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:57:55,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688030639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:55,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:57:55,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:57:55,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20027608] [2025-01-08 22:57:55,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:55,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:55,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:55,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:55,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:57:55,875 INFO L87 Difference]: Start difference. First operand 41116 states and 51063 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:56,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:56,651 INFO L93 Difference]: Finished difference Result 112895 states and 140395 transitions. [2025-01-08 22:57:56,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:56,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 242 [2025-01-08 22:57:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:56,729 INFO L225 Difference]: With dead ends: 112895 [2025-01-08 22:57:56,729 INFO L226 Difference]: Without dead ends: 72187 [2025-01-08 22:57:56,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:57:56,766 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 22 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:56,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 342 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:57:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72187 states. [2025-01-08 22:57:57,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72187 to 55529. [2025-01-08 22:57:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55529 states, 55528 states have (on average 1.190696585506411) internal successors, (66117), 55528 states have internal predecessors, (66117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55529 states to 55529 states and 66117 transitions. [2025-01-08 22:57:57,525 INFO L78 Accepts]: Start accepts. Automaton has 55529 states and 66117 transitions. Word has length 242 [2025-01-08 22:57:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:57,526 INFO L471 AbstractCegarLoop]: Abstraction has 55529 states and 66117 transitions. [2025-01-08 22:57:57,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 55529 states and 66117 transitions. [2025-01-08 22:57:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-01-08 22:57:57,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:57,598 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:57:57,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 22:57:57,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:57:57,799 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:57,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:57,800 INFO L85 PathProgramCache]: Analyzing trace with hash 573123706, now seen corresponding path program 1 times [2025-01-08 22:57:57,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:57,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059952576] [2025-01-08 22:57:57,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:57,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:57,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-01-08 22:57:57,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-01-08 22:57:57,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:57,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:57:58,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:58,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059952576] [2025-01-08 22:57:58,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059952576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:58,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:58,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:58,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948936301] [2025-01-08 22:57:58,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:58,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:58,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:58,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:58,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:58,161 INFO L87 Difference]: Start difference. First operand 55529 states and 66117 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 2 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:58,887 INFO L93 Difference]: Finished difference Result 127386 states and 150545 transitions. [2025-01-08 22:57:58,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:58,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 2 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 260 [2025-01-08 22:57:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:58,972 INFO L225 Difference]: With dead ends: 127386 [2025-01-08 22:57:58,973 INFO L226 Difference]: Without dead ends: 72265 [2025-01-08 22:57:59,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:59,021 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 154 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:59,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 125 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:57:59,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72265 states. [2025-01-08 22:57:59,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72265 to 68927. [2025-01-08 22:57:59,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68927 states, 68926 states have (on average 1.1556306763775643) internal successors, (79653), 68926 states have internal predecessors, (79653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68927 states to 68927 states and 79653 transitions. [2025-01-08 22:58:00,108 INFO L78 Accepts]: Start accepts. Automaton has 68927 states and 79653 transitions. Word has length 260 [2025-01-08 22:58:00,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:00,108 INFO L471 AbstractCegarLoop]: Abstraction has 68927 states and 79653 transitions. [2025-01-08 22:58:00,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 2 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 68927 states and 79653 transitions. [2025-01-08 22:58:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-01-08 22:58:00,152 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:00,152 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:58:00,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:58:00,152 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:00,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:00,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1610475712, now seen corresponding path program 1 times [2025-01-08 22:58:00,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:00,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998477481] [2025-01-08 22:58:00,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:00,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:00,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-01-08 22:58:00,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-08 22:58:00,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:00,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:00,537 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:58:00,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:00,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998477481] [2025-01-08 22:58:00,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998477481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:00,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:00,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:58:00,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962979871] [2025-01-08 22:58:00,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:00,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:00,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:00,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:00,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:00,538 INFO L87 Difference]: Start difference. First operand 68927 states and 79653 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:01,325 INFO L93 Difference]: Finished difference Result 166830 states and 192665 transitions. [2025-01-08 22:58:01,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:01,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 267 [2025-01-08 22:58:01,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:01,594 INFO L225 Difference]: With dead ends: 166830 [2025-01-08 22:58:01,594 INFO L226 Difference]: Without dead ends: 98311 [2025-01-08 22:58:01,622 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-01-08 22:58:01,622 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 155 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:01,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 109 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:58:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98311 states. [2025-01-08 22:58:02,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98311 to 87052. [2025-01-08 22:58:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87052 states, 87051 states have (on average 1.1483727929604484) internal successors, (99967), 87051 states have internal predecessors, (99967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87052 states to 87052 states and 99967 transitions. [2025-01-08 22:58:02,595 INFO L78 Accepts]: Start accepts. Automaton has 87052 states and 99967 transitions. Word has length 267 [2025-01-08 22:58:02,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:02,595 INFO L471 AbstractCegarLoop]: Abstraction has 87052 states and 99967 transitions. [2025-01-08 22:58:02,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 87052 states and 99967 transitions. [2025-01-08 22:58:02,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-01-08 22:58:02,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:02,856 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:58:02,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 22:58:02,856 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:02,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:02,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2020614076, now seen corresponding path program 1 times [2025-01-08 22:58:02,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:02,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998623564] [2025-01-08 22:58:02,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:02,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:02,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-01-08 22:58:02,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-01-08 22:58:02,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:02,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-08 22:58:03,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:03,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998623564] [2025-01-08 22:58:03,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998623564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:03,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:03,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:58:03,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464685352] [2025-01-08 22:58:03,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:03,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:03,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:03,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:03,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:03,070 INFO L87 Difference]: Start difference. First operand 87052 states and 99967 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:04,061 INFO L93 Difference]: Finished difference Result 201664 states and 232424 transitions. [2025-01-08 22:58:04,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:04,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 286 [2025-01-08 22:58:04,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:04,175 INFO L225 Difference]: With dead ends: 201664 [2025-01-08 22:58:04,175 INFO L226 Difference]: Without dead ends: 114817 [2025-01-08 22:58:04,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:04,227 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 196 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:04,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 128 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:58:04,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114817 states. [2025-01-08 22:58:05,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114817 to 112990. [2025-01-08 22:58:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112990 states, 112989 states have (on average 1.1087450990804415) internal successors, (125276), 112989 states have internal predecessors, (125276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112990 states to 112990 states and 125276 transitions. [2025-01-08 22:58:06,076 INFO L78 Accepts]: Start accepts. Automaton has 112990 states and 125276 transitions. Word has length 286 [2025-01-08 22:58:06,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:06,076 INFO L471 AbstractCegarLoop]: Abstraction has 112990 states and 125276 transitions. [2025-01-08 22:58:06,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:06,076 INFO L276 IsEmpty]: Start isEmpty. Operand 112990 states and 125276 transitions. [2025-01-08 22:58:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-08 22:58:06,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:06,128 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:58:06,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 22:58:06,128 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:06,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:06,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1579913145, now seen corresponding path program 1 times [2025-01-08 22:58:06,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:06,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099464332] [2025-01-08 22:58:06,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:06,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:06,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-08 22:58:06,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-08 22:58:06,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:06,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:58:06,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:06,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099464332] [2025-01-08 22:58:06,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099464332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:06,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:06,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:58:06,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547065026] [2025-01-08 22:58:06,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:06,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:06,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:06,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:06,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:06,240 INFO L87 Difference]: Start difference. First operand 112990 states and 125276 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:07,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:07,283 INFO L93 Difference]: Finished difference Result 222706 states and 246461 transitions. [2025-01-08 22:58:07,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:07,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 320 [2025-01-08 22:58:07,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:07,436 INFO L225 Difference]: With dead ends: 222706 [2025-01-08 22:58:07,437 INFO L226 Difference]: Without dead ends: 109718 [2025-01-08 22:58:07,501 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-01-08 22:58:07,502 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 214 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:07,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 287 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:58:07,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109718 states. [2025-01-08 22:58:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109718 to 106864. [2025-01-08 22:58:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106864 states, 106863 states have (on average 1.0755733977148312) internal successors, (114939), 106863 states have internal predecessors, (114939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:08,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106864 states to 106864 states and 114939 transitions. [2025-01-08 22:58:08,995 INFO L78 Accepts]: Start accepts. Automaton has 106864 states and 114939 transitions. Word has length 320 [2025-01-08 22:58:08,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:08,995 INFO L471 AbstractCegarLoop]: Abstraction has 106864 states and 114939 transitions. [2025-01-08 22:58:08,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:08,995 INFO L276 IsEmpty]: Start isEmpty. Operand 106864 states and 114939 transitions. [2025-01-08 22:58:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-01-08 22:58:09,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:09,054 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:58:09,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 22:58:09,055 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:09,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:09,055 INFO L85 PathProgramCache]: Analyzing trace with hash -993068250, now seen corresponding path program 1 times [2025-01-08 22:58:09,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:09,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130737162] [2025-01-08 22:58:09,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:09,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:09,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-01-08 22:58:09,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-01-08 22:58:09,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:09,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:58:09,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:09,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130737162] [2025-01-08 22:58:09,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130737162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:09,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:09,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:58:09,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964440993] [2025-01-08 22:58:09,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:09,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:09,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:09,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:09,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:09,674 INFO L87 Difference]: Start difference. First operand 106864 states and 114939 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:10,758 INFO L93 Difference]: Finished difference Result 233648 states and 251272 transitions. [2025-01-08 22:58:10,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:10,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 334 [2025-01-08 22:58:10,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:10,907 INFO L225 Difference]: With dead ends: 233648 [2025-01-08 22:58:10,907 INFO L226 Difference]: Without dead ends: 126786 [2025-01-08 22:58:10,973 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-01-08 22:58:10,974 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 144 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:10,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 344 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:58:11,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126786 states. [2025-01-08 22:58:12,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126786 to 124728. [2025-01-08 22:58:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124728 states, 124727 states have (on average 1.0676998564865667) internal successors, (133171), 124727 states have internal predecessors, (133171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124728 states to 124728 states and 133171 transitions. [2025-01-08 22:58:12,826 INFO L78 Accepts]: Start accepts. Automaton has 124728 states and 133171 transitions. Word has length 334 [2025-01-08 22:58:12,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:12,826 INFO L471 AbstractCegarLoop]: Abstraction has 124728 states and 133171 transitions. [2025-01-08 22:58:12,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:12,826 INFO L276 IsEmpty]: Start isEmpty. Operand 124728 states and 133171 transitions. [2025-01-08 22:58:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-01-08 22:58:12,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:12,878 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:58:12,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 22:58:12,879 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:12,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:12,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2073728849, now seen corresponding path program 1 times [2025-01-08 22:58:12,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:12,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139469250] [2025-01-08 22:58:12,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:12,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:12,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-01-08 22:58:12,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-01-08 22:58:12,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:12,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-08 22:58:12,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:12,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139469250] [2025-01-08 22:58:12,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139469250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:12,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:12,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:58:12,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523262620] [2025-01-08 22:58:12,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:12,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:12,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:12,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:12,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:12,993 INFO L87 Difference]: Start difference. First operand 124728 states and 133171 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:13,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:13,995 INFO L93 Difference]: Finished difference Result 217067 states and 232205 transitions. [2025-01-08 22:58:13,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:13,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 335 [2025-01-08 22:58:13,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:14,096 INFO L225 Difference]: With dead ends: 217067 [2025-01-08 22:58:14,097 INFO L226 Difference]: Without dead ends: 92341 [2025-01-08 22:58:14,156 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-01-08 22:58:14,156 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 226 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:14,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 314 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:58:14,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92341 states. [2025-01-08 22:58:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92341 to 87259. [2025-01-08 22:58:15,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87259 states, 87258 states have (on average 1.0559604849985103) internal successors, (92141), 87258 states have internal predecessors, (92141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87259 states to 87259 states and 92141 transitions. [2025-01-08 22:58:15,789 INFO L78 Accepts]: Start accepts. Automaton has 87259 states and 92141 transitions. Word has length 335 [2025-01-08 22:58:15,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:15,789 INFO L471 AbstractCegarLoop]: Abstraction has 87259 states and 92141 transitions. [2025-01-08 22:58:15,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:15,789 INFO L276 IsEmpty]: Start isEmpty. Operand 87259 states and 92141 transitions. [2025-01-08 22:58:15,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-01-08 22:58:15,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:15,831 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:58:15,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 22:58:15,831 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:15,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:15,832 INFO L85 PathProgramCache]: Analyzing trace with hash 67815896, now seen corresponding path program 1 times [2025-01-08 22:58:15,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:15,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036474002] [2025-01-08 22:58:15,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:15,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:15,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-08 22:58:15,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-08 22:58:15,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:15,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-08 22:58:16,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:16,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036474002] [2025-01-08 22:58:16,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036474002] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:58:16,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237871585] [2025-01-08 22:58:16,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:16,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:58:16,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:58:16,057 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:58:16,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 22:58:16,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-08 22:58:16,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-08 22:58:16,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:16,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:16,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:58:16,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:58:16,292 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-08 22:58:16,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:58:16,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237871585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:16,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:58:16,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:58:16,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212490781] [2025-01-08 22:58:16,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:16,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:58:16,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:16,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:58:16,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:58:16,295 INFO L87 Difference]: Start difference. First operand 87259 states and 92141 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:17,519 INFO L93 Difference]: Finished difference Result 233854 states and 246991 transitions. [2025-01-08 22:58:17,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:58:17,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 336 [2025-01-08 22:58:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:17,680 INFO L225 Difference]: With dead ends: 233854 [2025-01-08 22:58:17,681 INFO L226 Difference]: Without dead ends: 146597 [2025-01-08 22:58:17,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:58:17,752 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 717 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:17,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 287 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:58:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146597 states. [2025-01-08 22:58:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146597 to 139076. [2025-01-08 22:58:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139076 states, 139075 states have (on average 1.0566241236742764) internal successors, (146950), 139075 states have internal predecessors, (146950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:19,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139076 states to 139076 states and 146950 transitions. [2025-01-08 22:58:19,817 INFO L78 Accepts]: Start accepts. Automaton has 139076 states and 146950 transitions. Word has length 336 [2025-01-08 22:58:19,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:19,818 INFO L471 AbstractCegarLoop]: Abstraction has 139076 states and 146950 transitions. [2025-01-08 22:58:19,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:19,824 INFO L276 IsEmpty]: Start isEmpty. Operand 139076 states and 146950 transitions. [2025-01-08 22:58:19,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-01-08 22:58:19,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:19,874 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 22:58:19,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 22:58:20,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:58:20,075 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:20,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:20,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1740316384, now seen corresponding path program 1 times [2025-01-08 22:58:20,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:20,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185602730] [2025-01-08 22:58:20,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:20,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:20,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-01-08 22:58:20,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-01-08 22:58:20,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:20,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-08 22:58:20,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:20,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185602730] [2025-01-08 22:58:20,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185602730] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:58:20,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73253914] [2025-01-08 22:58:20,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:20,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:58:20,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:58:20,659 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:58:20,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 22:58:20,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-01-08 22:58:20,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-01-08 22:58:20,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:20,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:20,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 22:58:20,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:58:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:58:21,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:58:21,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73253914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:21,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:58:21,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-01-08 22:58:21,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670584977] [2025-01-08 22:58:21,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:21,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:58:21,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:21,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:58:21,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:58:21,151 INFO L87 Difference]: Start difference. First operand 139076 states and 146950 transitions. Second operand has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:23,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:23,778 INFO L93 Difference]: Finished difference Result 633445 states and 669856 transitions. [2025-01-08 22:58:23,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:58:23,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 339 [2025-01-08 22:58:23,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:24,373 INFO L225 Difference]: With dead ends: 633445 [2025-01-08 22:58:24,373 INFO L226 Difference]: Without dead ends: 494371 [2025-01-08 22:58:24,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:58:24,453 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 970 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:24,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 924 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 22:58:24,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494371 states.