./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label56.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/Problem17_label56.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 6817325bf2ee6430e3e6b828534a0d98b8fcced6b8f752a4847958e1d99aaba4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:15:47,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:15:47,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:15:47,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:15:47,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:15:47,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:15:47,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:15:47,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:15:47,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:15:47,726 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:15:47,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:15:47,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:15:47,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:15:47,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:15:47,727 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:15:47,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:15:47,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:15:47,727 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:15:47,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:15:47,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:15:47,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:15:47,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:15:47,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:15:47,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:15:47,728 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:15:47,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:15:47,728 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:15:47,728 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:15:47,728 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:15:47,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:15:47,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:15:47,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:15:47,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:15:47,729 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:15:47,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:15:47,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:15:47,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:15:47,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:15:47,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:15:47,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:15:47,729 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:15:47,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:15:47,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:15:47,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:15:47,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:15:47,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:15:47,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:15:47,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:15:47,730 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 -> 6817325bf2ee6430e3e6b828534a0d98b8fcced6b8f752a4847958e1d99aaba4 [2025-01-09 00:15:47,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:15:47,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:15:47,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:15:47,929 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:15:47,929 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:15:47,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label56.c [2025-01-09 00:15:49,084 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73e83fb8b/3c77e1cfcfa84827925c91b35baa8db0/FLAGb8fa2a67c [2025-01-09 00:15:49,535 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:15:49,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label56.c [2025-01-09 00:15:49,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73e83fb8b/3c77e1cfcfa84827925c91b35baa8db0/FLAGb8fa2a67c [2025-01-09 00:15:49,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73e83fb8b/3c77e1cfcfa84827925c91b35baa8db0 [2025-01-09 00:15:49,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:15:49,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:15:49,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:15:49,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:15:49,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:15:49,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:15:49" (1/1) ... [2025-01-09 00:15:49,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ccc7516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:49, skipping insertion in model container [2025-01-09 00:15:49,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:15:49" (1/1) ... [2025-01-09 00:15:49,716 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:15:49,876 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/Problem17_label56.c[9824,9837] [2025-01-09 00:15:50,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:15:50,213 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:15:50,268 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/Problem17_label56.c[9824,9837] [2025-01-09 00:15:50,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:15:50,429 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:15:50,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:50 WrapperNode [2025-01-09 00:15:50,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:15:50,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:15:50,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:15:50,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:15:50,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:50" (1/1) ... [2025-01-09 00:15:50,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:50" (1/1) ... [2025-01-09 00:15:50,681 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-01-09 00:15:50,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:15:50,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:15:50,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:15:50,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:15:50,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:50" (1/1) ... [2025-01-09 00:15:50,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:50" (1/1) ... [2025-01-09 00:15:50,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:50" (1/1) ... [2025-01-09 00:15:50,922 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-09 00:15:50,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:50" (1/1) ... [2025-01-09 00:15:50,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:50" (1/1) ... [2025-01-09 00:15:51,035 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:50" (1/1) ... [2025-01-09 00:15:51,051 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:50" (1/1) ... [2025-01-09 00:15:51,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:50" (1/1) ... [2025-01-09 00:15:51,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:50" (1/1) ... [2025-01-09 00:15:51,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:50" (1/1) ... [2025-01-09 00:15:51,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:15:51,152 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:15:51,152 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:15:51,152 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:15:51,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:50" (1/1) ... [2025-01-09 00:15:51,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:15:51,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:15:51,175 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-09 00:15:51,179 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-09 00:15:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:15:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:15:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:15:51,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:15:51,231 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:15:51,233 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:15:53,709 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-01-09 00:15:53,710 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:15:53,726 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:15:53,726 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:15:53,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:15:53 BoogieIcfgContainer [2025-01-09 00:15:53,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:15:53,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:15:53,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:15:53,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:15:53,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:15:49" (1/3) ... [2025-01-09 00:15:53,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681f0a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:15:53, skipping insertion in model container [2025-01-09 00:15:53,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:50" (2/3) ... [2025-01-09 00:15:53,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681f0a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:15:53, skipping insertion in model container [2025-01-09 00:15:53,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:15:53" (3/3) ... [2025-01-09 00:15:53,734 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label56.c [2025-01-09 00:15:53,743 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:15:53,744 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label56.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:15:53,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:15:53,789 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;@46a18a06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:15:53,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:15:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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-09 00:15:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 00:15:53,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:53,798 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] [2025-01-09 00:15:53,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:53,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:53,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1864169478, now seen corresponding path program 1 times [2025-01-09 00:15:53,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:53,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044591997] [2025-01-09 00:15:53,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:53,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:53,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 00:15:53,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 00:15:53,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:53,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:54,058 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-09 00:15:54,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:54,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044591997] [2025-01-09 00:15:54,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044591997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:54,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:54,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:15:54,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380334886] [2025-01-09 00:15:54,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:54,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:54,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:54,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:54,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:54,077 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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-09 00:15:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:56,207 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-01-09 00:15:56,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:56,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 00:15:56,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:56,218 INFO L225 Difference]: With dead ends: 1644 [2025-01-09 00:15:56,219 INFO L226 Difference]: Without dead ends: 977 [2025-01-09 00:15:56,222 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-09 00:15:56,224 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 422 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:56,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:15:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-01-09 00:15:56,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-01-09 00:15:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 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-09 00:15:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-01-09 00:15:56,275 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 66 [2025-01-09 00:15:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:56,275 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-01-09 00:15:56,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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-09 00:15:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-01-09 00:15:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 00:15:56,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:56,278 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:56,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:15:56,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:56,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash -921011763, now seen corresponding path program 1 times [2025-01-09 00:15:56,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:56,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942679505] [2025-01-09 00:15:56,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:56,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:56,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 00:15:56,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 00:15:56,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:56,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:56,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:56,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942679505] [2025-01-09 00:15:56,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942679505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:56,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:56,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:15:56,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368899753] [2025-01-09 00:15:56,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:56,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:56,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:56,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:56,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:56,565 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:15:58,444 INFO L93 Difference]: Finished difference Result 2846 states and 4429 transitions. [2025-01-09 00:15:58,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:15:58,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-01-09 00:15:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:15:58,450 INFO L225 Difference]: With dead ends: 2846 [2025-01-09 00:15:58,450 INFO L226 Difference]: Without dead ends: 1877 [2025-01-09 00:15:58,452 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-09 00:15:58,455 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 444 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:15:58,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 241 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:15:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2025-01-09 00:15:58,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1854. [2025-01-09 00:15:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1853 states have (on average 1.489476524554776) internal successors, (2760), 1853 states have internal predecessors, (2760), 0 states have call successors, (0), 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-09 00:15:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2760 transitions. [2025-01-09 00:15:58,498 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2760 transitions. Word has length 133 [2025-01-09 00:15:58,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:15:58,500 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2760 transitions. [2025-01-09 00:15:58,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:15:58,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2760 transitions. [2025-01-09 00:15:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 00:15:58,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:15:58,505 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:15:58,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:15:58,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:15:58,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:15:58,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1223324070, now seen corresponding path program 1 times [2025-01-09 00:15:58,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:15:58,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368643717] [2025-01-09 00:15:58,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:15:58,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:15:58,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 00:15:58,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 00:15:58,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:15:58,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:15:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:15:58,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:15:58,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368643717] [2025-01-09 00:15:58,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368643717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:15:58,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:15:58,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:15:58,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247680047] [2025-01-09 00:15:58,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:15:58,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:15:58,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:15:58,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:15:58,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:15:58,718 INFO L87 Difference]: Start difference. First operand 1854 states and 2760 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-09 00:16:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:00,365 INFO L93 Difference]: Finished difference Result 4574 states and 7028 transitions. [2025-01-09 00:16:00,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:00,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-01-09 00:16:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:00,374 INFO L225 Difference]: With dead ends: 4574 [2025-01-09 00:16:00,374 INFO L226 Difference]: Without dead ends: 2722 [2025-01-09 00:16:00,376 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-09 00:16:00,379 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 426 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:00,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 919 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:16:00,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2025-01-09 00:16:00,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2720. [2025-01-09 00:16:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2720 states, 2719 states have (on average 1.4133872747333578) internal successors, (3843), 2719 states have internal predecessors, (3843), 0 states have call successors, (0), 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-09 00:16:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 3843 transitions. [2025-01-09 00:16:00,412 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 3843 transitions. Word has length 136 [2025-01-09 00:16:00,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:00,413 INFO L471 AbstractCegarLoop]: Abstraction has 2720 states and 3843 transitions. [2025-01-09 00:16:00,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-09 00:16:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 3843 transitions. [2025-01-09 00:16:00,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 00:16:00,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:00,417 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:00,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:16:00,417 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:00,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:00,417 INFO L85 PathProgramCache]: Analyzing trace with hash -510675487, now seen corresponding path program 1 times [2025-01-09 00:16:00,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:00,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502593043] [2025-01-09 00:16:00,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:00,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:00,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 00:16:00,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 00:16:00,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:00,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:00,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:00,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502593043] [2025-01-09 00:16:00,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502593043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:00,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:00,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:16:00,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448526065] [2025-01-09 00:16:00,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:00,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:00,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:00,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:00,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:00,611 INFO L87 Difference]: Start difference. First operand 2720 states and 3843 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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-09 00:16:02,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:02,291 INFO L93 Difference]: Finished difference Result 8023 states and 11344 transitions. [2025-01-09 00:16:02,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:02,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-01-09 00:16:02,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:02,308 INFO L225 Difference]: With dead ends: 8023 [2025-01-09 00:16:02,308 INFO L226 Difference]: Without dead ends: 5305 [2025-01-09 00:16:02,313 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-09 00:16:02,314 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 402 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:02,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 580 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:16:02,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5305 states. [2025-01-09 00:16:02,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5305 to 5299. [2025-01-09 00:16:02,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 5298 states have (on average 1.2659494148735373) internal successors, (6707), 5298 states have internal predecessors, (6707), 0 states have call successors, (0), 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-09 00:16:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 6707 transitions. [2025-01-09 00:16:02,383 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 6707 transitions. Word has length 138 [2025-01-09 00:16:02,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:02,384 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 6707 transitions. [2025-01-09 00:16:02,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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-09 00:16:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 6707 transitions. [2025-01-09 00:16:02,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 00:16:02,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:02,386 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, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:02,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:16:02,386 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:02,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:02,387 INFO L85 PathProgramCache]: Analyzing trace with hash 662321148, now seen corresponding path program 1 times [2025-01-09 00:16:02,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:02,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197601552] [2025-01-09 00:16:02,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:02,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:02,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 00:16:02,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 00:16:02,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:02,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-09 00:16:02,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:02,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197601552] [2025-01-09 00:16:02,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197601552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:02,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:02,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:16:02,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413331408] [2025-01-09 00:16:02,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:02,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:02,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:02,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:02,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:02,554 INFO L87 Difference]: Start difference. First operand 5299 states and 6707 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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-09 00:16:04,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:04,235 INFO L93 Difference]: Finished difference Result 15280 states and 19396 transitions. [2025-01-09 00:16:04,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:04,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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-09 00:16:04,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:04,256 INFO L225 Difference]: With dead ends: 15280 [2025-01-09 00:16:04,256 INFO L226 Difference]: Without dead ends: 8704 [2025-01-09 00:16:04,264 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-09 00:16:04,265 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:04,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:16:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8704 states. [2025-01-09 00:16:04,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8704 to 6998. [2025-01-09 00:16:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6998 states, 6997 states have (on average 1.1554952122338145) internal successors, (8085), 6997 states have internal predecessors, (8085), 0 states have call successors, (0), 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-09 00:16:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6998 states to 6998 states and 8085 transitions. [2025-01-09 00:16:04,391 INFO L78 Accepts]: Start accepts. Automaton has 6998 states and 8085 transitions. Word has length 205 [2025-01-09 00:16:04,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:04,391 INFO L471 AbstractCegarLoop]: Abstraction has 6998 states and 8085 transitions. [2025-01-09 00:16:04,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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-09 00:16:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 6998 states and 8085 transitions. [2025-01-09 00:16:04,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 00:16:04,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:04,395 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, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:04,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:16:04,395 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:04,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:04,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1767591901, now seen corresponding path program 1 times [2025-01-09 00:16:04,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:04,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037776388] [2025-01-09 00:16:04,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:04,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:04,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 00:16:04,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 00:16:04,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:04,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:04,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:04,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037776388] [2025-01-09 00:16:04,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037776388] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:04,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:04,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:04,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70435888] [2025-01-09 00:16:04,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:04,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:04,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:04,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:04,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:04,580 INFO L87 Difference]: Start difference. First operand 6998 states and 8085 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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-09 00:16:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:06,031 INFO L93 Difference]: Finished difference Result 17826 states and 20935 transitions. [2025-01-09 00:16:06,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:06,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 218 [2025-01-09 00:16:06,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:06,065 INFO L225 Difference]: With dead ends: 17826 [2025-01-09 00:16:06,065 INFO L226 Difference]: Without dead ends: 10830 [2025-01-09 00:16:06,071 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-09 00:16:06,072 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:06,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 779 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:16:06,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10830 states. [2025-01-09 00:16:06,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10830 to 10405. [2025-01-09 00:16:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10405 states, 10404 states have (on average 1.147443291041907) internal successors, (11938), 10404 states have internal predecessors, (11938), 0 states have call successors, (0), 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-09 00:16:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10405 states to 10405 states and 11938 transitions. [2025-01-09 00:16:06,189 INFO L78 Accepts]: Start accepts. Automaton has 10405 states and 11938 transitions. Word has length 218 [2025-01-09 00:16:06,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:06,189 INFO L471 AbstractCegarLoop]: Abstraction has 10405 states and 11938 transitions. [2025-01-09 00:16:06,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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-09 00:16:06,190 INFO L276 IsEmpty]: Start isEmpty. Operand 10405 states and 11938 transitions. [2025-01-09 00:16:06,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 00:16:06,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:06,193 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, 3, 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] [2025-01-09 00:16:06,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:16:06,193 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:06,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:06,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1267519224, now seen corresponding path program 1 times [2025-01-09 00:16:06,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:06,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804786161] [2025-01-09 00:16:06,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:06,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:06,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 00:16:06,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 00:16:06,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:06,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 127 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:06,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:06,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804786161] [2025-01-09 00:16:06,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804786161] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:06,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057149600] [2025-01-09 00:16:06,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:06,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:06,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:16:06,626 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-09 00:16:06,630 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-09 00:16:06,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 00:16:06,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 00:16:06,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:06,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:06,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:16:06,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:16:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 127 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:06,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:16:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:07,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057149600] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:07,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:16:07,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-01-09 00:16:07,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041314854] [2025-01-09 00:16:07,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:07,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:07,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:07,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:07,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:16:07,141 INFO L87 Difference]: Start difference. First operand 10405 states and 11938 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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-09 00:16:09,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:09,564 INFO L93 Difference]: Finished difference Result 31055 states and 36045 transitions. [2025-01-09 00:16:09,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:09,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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 220 [2025-01-09 00:16:09,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:09,592 INFO L225 Difference]: With dead ends: 31055 [2025-01-09 00:16:09,592 INFO L226 Difference]: Without dead ends: 18922 [2025-01-09 00:16:09,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:16:09,600 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 882 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2205 mSolverCounterSat, 630 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 630 IncrementalHoareTripleChecker+Valid, 2205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:09,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 168 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [630 Valid, 2205 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 00:16:09,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18922 states. [2025-01-09 00:16:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18922 to 18917. [2025-01-09 00:16:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18917 states, 18916 states have (on average 1.142154789596109) internal successors, (21605), 18916 states have internal predecessors, (21605), 0 states have call successors, (0), 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-09 00:16:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18917 states to 18917 states and 21605 transitions. [2025-01-09 00:16:09,776 INFO L78 Accepts]: Start accepts. Automaton has 18917 states and 21605 transitions. Word has length 220 [2025-01-09 00:16:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:09,776 INFO L471 AbstractCegarLoop]: Abstraction has 18917 states and 21605 transitions. [2025-01-09 00:16:09,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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-09 00:16:09,777 INFO L276 IsEmpty]: Start isEmpty. Operand 18917 states and 21605 transitions. [2025-01-09 00:16:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-01-09 00:16:09,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:09,781 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:09,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:16:09,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:09,983 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:09,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:09,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1833064362, now seen corresponding path program 1 times [2025-01-09 00:16:09,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:09,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762631154] [2025-01-09 00:16:09,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:09,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:10,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 00:16:10,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 00:16:10,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:10,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 191 proven. 214 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:10,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:10,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762631154] [2025-01-09 00:16:10,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762631154] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:10,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125938860] [2025-01-09 00:16:10,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:10,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:10,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:16:10,413 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-09 00:16:10,414 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-09 00:16:10,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 00:16:10,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 00:16:10,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:10,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:10,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:16:10,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:16:10,726 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 268 proven. 73 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 00:16:10,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:16:10,972 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 00:16:10,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125938860] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:10,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:16:10,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2025-01-09 00:16:10,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442707905] [2025-01-09 00:16:10,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:10,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:10,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:10,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:10,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:16:10,975 INFO L87 Difference]: Start difference. First operand 18917 states and 21605 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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-09 00:16:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:13,356 INFO L93 Difference]: Finished difference Result 51050 states and 58470 transitions. [2025-01-09 00:16:13,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:13,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 294 [2025-01-09 00:16:13,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:13,416 INFO L225 Difference]: With dead ends: 51050 [2025-01-09 00:16:13,416 INFO L226 Difference]: Without dead ends: 32135 [2025-01-09 00:16:13,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:16:13,450 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 884 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2233 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:13,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 172 Invalid, 2826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2233 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:16:13,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32135 states. [2025-01-09 00:16:13,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32135 to 32129. [2025-01-09 00:16:14,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32129 states, 32128 states have (on average 1.133777390438247) internal successors, (36426), 32128 states have internal predecessors, (36426), 0 states have call successors, (0), 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-09 00:16:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32129 states to 32129 states and 36426 transitions. [2025-01-09 00:16:14,069 INFO L78 Accepts]: Start accepts. Automaton has 32129 states and 36426 transitions. Word has length 294 [2025-01-09 00:16:14,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:14,070 INFO L471 AbstractCegarLoop]: Abstraction has 32129 states and 36426 transitions. [2025-01-09 00:16:14,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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-09 00:16:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 32129 states and 36426 transitions. [2025-01-09 00:16:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-01-09 00:16:14,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:14,076 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-01-09 00:16:14,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 00:16:14,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:14,281 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:14,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:14,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1392582015, now seen corresponding path program 1 times [2025-01-09 00:16:14,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:14,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867471355] [2025-01-09 00:16:14,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:14,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:14,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-01-09 00:16:14,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-01-09 00:16:14,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:14,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-09 00:16:14,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:14,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867471355] [2025-01-09 00:16:14,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867471355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:14,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:14,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:14,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197021604] [2025-01-09 00:16:14,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:14,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:14,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:14,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:14,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:14,605 INFO L87 Difference]: Start difference. First operand 32129 states and 36426 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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-09 00:16:16,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:16,449 INFO L93 Difference]: Finished difference Result 76229 states and 86170 transitions. [2025-01-09 00:16:16,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:16,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 399 [2025-01-09 00:16:16,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:16,572 INFO L225 Difference]: With dead ends: 76229 [2025-01-09 00:16:16,579 INFO L226 Difference]: Without dead ends: 44527 [2025-01-09 00:16:16,628 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-09 00:16:16,633 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 428 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:16,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 688 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:16:16,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44527 states. [2025-01-09 00:16:17,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44527 to 42366. [2025-01-09 00:16:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42366 states, 42365 states have (on average 1.128974389236398) internal successors, (47829), 42365 states have internal predecessors, (47829), 0 states have call successors, (0), 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-09 00:16:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42366 states to 42366 states and 47829 transitions. [2025-01-09 00:16:17,735 INFO L78 Accepts]: Start accepts. Automaton has 42366 states and 47829 transitions. Word has length 399 [2025-01-09 00:16:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:17,735 INFO L471 AbstractCegarLoop]: Abstraction has 42366 states and 47829 transitions. [2025-01-09 00:16:17,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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-09 00:16:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 42366 states and 47829 transitions. [2025-01-09 00:16:17,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2025-01-09 00:16:17,743 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:17,743 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:17,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:16:17,744 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:17,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:17,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1177230631, now seen corresponding path program 1 times [2025-01-09 00:16:17,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:17,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447392756] [2025-01-09 00:16:17,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:17,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:17,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-01-09 00:16:17,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-01-09 00:16:17,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:17,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:17,977 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 567 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 00:16:17,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:17,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447392756] [2025-01-09 00:16:17,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447392756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:17,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:17,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:17,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986819493] [2025-01-09 00:16:17,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:17,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:17,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:17,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:17,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:17,980 INFO L87 Difference]: Start difference. First operand 42366 states and 47829 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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-09 00:16:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:19,546 INFO L93 Difference]: Finished difference Result 97086 states and 109959 transitions. [2025-01-09 00:16:19,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:19,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 400 [2025-01-09 00:16:19,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:19,626 INFO L225 Difference]: With dead ends: 97086 [2025-01-09 00:16:19,630 INFO L226 Difference]: Without dead ends: 55146 [2025-01-09 00:16:19,672 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-09 00:16:19,673 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 436 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:19,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 642 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:16:19,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55146 states. [2025-01-09 00:16:20,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55146 to 51729. [2025-01-09 00:16:20,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51729 states, 51728 states have (on average 1.1286537271883699) internal successors, (58383), 51728 states have internal predecessors, (58383), 0 states have call successors, (0), 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-09 00:16:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51729 states to 51729 states and 58383 transitions. [2025-01-09 00:16:20,366 INFO L78 Accepts]: Start accepts. Automaton has 51729 states and 58383 transitions. Word has length 400 [2025-01-09 00:16:20,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:20,367 INFO L471 AbstractCegarLoop]: Abstraction has 51729 states and 58383 transitions. [2025-01-09 00:16:20,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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-09 00:16:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 51729 states and 58383 transitions. [2025-01-09 00:16:20,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-01-09 00:16:20,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:20,385 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:16:20,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:16:20,386 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:20,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:20,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1402544624, now seen corresponding path program 1 times [2025-01-09 00:16:20,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:20,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958633075] [2025-01-09 00:16:20,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:20,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:20,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-01-09 00:16:20,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-01-09 00:16:20,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:20,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:20,790 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 00:16:20,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:20,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958633075] [2025-01-09 00:16:20,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958633075] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:20,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:20,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:16:20,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342807848] [2025-01-09 00:16:20,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:20,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:20,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:20,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:20,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:16:20,792 INFO L87 Difference]: Start difference. First operand 51729 states and 58383 transitions. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 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-09 00:16:23,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:23,502 INFO L93 Difference]: Finished difference Result 133762 states and 150839 transitions. [2025-01-09 00:16:23,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:23,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 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 404 [2025-01-09 00:16:23,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:23,601 INFO L225 Difference]: With dead ends: 133762 [2025-01-09 00:16:23,603 INFO L226 Difference]: Without dead ends: 82460 [2025-01-09 00:16:23,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:16:23,646 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 825 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 2752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:23,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 196 Invalid, 2752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 00:16:23,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82460 states. [2025-01-09 00:16:24,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82460 to 76069. [2025-01-09 00:16:24,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76069 states, 76068 states have (on average 1.1304885102802755) internal successors, (85994), 76068 states have internal predecessors, (85994), 0 states have call successors, (0), 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-09 00:16:24,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76069 states to 76069 states and 85994 transitions. [2025-01-09 00:16:24,780 INFO L78 Accepts]: Start accepts. Automaton has 76069 states and 85994 transitions. Word has length 404 [2025-01-09 00:16:24,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:24,780 INFO L471 AbstractCegarLoop]: Abstraction has 76069 states and 85994 transitions. [2025-01-09 00:16:24,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 0 states have call successors, (0), 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-09 00:16:24,780 INFO L276 IsEmpty]: Start isEmpty. Operand 76069 states and 85994 transitions. [2025-01-09 00:16:24,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-01-09 00:16:24,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:24,785 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:16:24,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:16:24,785 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:24,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:24,786 INFO L85 PathProgramCache]: Analyzing trace with hash -478285333, now seen corresponding path program 1 times [2025-01-09 00:16:24,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:24,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783992125] [2025-01-09 00:16:24,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:24,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:24,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-01-09 00:16:24,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-01-09 00:16:24,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:24,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:16:24,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:24,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783992125] [2025-01-09 00:16:24,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783992125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:24,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:24,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:24,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168299159] [2025-01-09 00:16:24,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:24,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:24,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:24,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:24,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:16:24,994 INFO L87 Difference]: Start difference. First operand 76069 states and 85994 transitions. Second operand has 4 states, 4 states have (on average 101.25) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 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-09 00:16:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:27,018 INFO L93 Difference]: Finished difference Result 155961 states and 176069 transitions. [2025-01-09 00:16:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:27,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 101.25) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 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 405 [2025-01-09 00:16:27,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:27,104 INFO L225 Difference]: With dead ends: 155961 [2025-01-09 00:16:27,104 INFO L226 Difference]: Without dead ends: 79894 [2025-01-09 00:16:27,149 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-09 00:16:27,150 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 546 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 2518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:27,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 255 Invalid, 2518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:16:27,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79894 states. [2025-01-09 00:16:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79894 to 76069. [2025-01-09 00:16:27,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76069 states, 76068 states have (on average 1.1304753641478678) internal successors, (85993), 76068 states have internal predecessors, (85993), 0 states have call successors, (0), 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-09 00:16:28,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76069 states to 76069 states and 85993 transitions. [2025-01-09 00:16:28,214 INFO L78 Accepts]: Start accepts. Automaton has 76069 states and 85993 transitions. Word has length 405 [2025-01-09 00:16:28,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:28,214 INFO L471 AbstractCegarLoop]: Abstraction has 76069 states and 85993 transitions. [2025-01-09 00:16:28,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.25) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 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-09 00:16:28,214 INFO L276 IsEmpty]: Start isEmpty. Operand 76069 states and 85993 transitions. [2025-01-09 00:16:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2025-01-09 00:16:28,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:28,220 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-01-09 00:16:28,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:16:28,221 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:28,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:28,221 INFO L85 PathProgramCache]: Analyzing trace with hash -418352719, now seen corresponding path program 1 times [2025-01-09 00:16:28,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:28,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218808930] [2025-01-09 00:16:28,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:28,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:28,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-01-09 00:16:28,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-01-09 00:16:28,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:28,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 403 proven. 64 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-01-09 00:16:28,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:28,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218808930] [2025-01-09 00:16:28,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218808930] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:16:28,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601220482] [2025-01-09 00:16:28,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:28,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:28,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:16:28,784 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-09 00:16:28,786 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-09 00:16:28,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-01-09 00:16:28,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-01-09 00:16:28,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:28,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:28,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:16:28,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:16:29,088 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2025-01-09 00:16:29,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:16:29,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601220482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:29,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:16:29,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 00:16:29,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926398868] [2025-01-09 00:16:29,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:29,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:29,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:29,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:29,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:16:29,090 INFO L87 Difference]: Start difference. First operand 76069 states and 85993 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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-09 00:16:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:30,655 INFO L93 Difference]: Finished difference Result 161533 states and 183212 transitions. [2025-01-09 00:16:30,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:30,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 419 [2025-01-09 00:16:30,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:30,877 INFO L225 Difference]: With dead ends: 161533 [2025-01-09 00:16:30,877 INFO L226 Difference]: Without dead ends: 85462 [2025-01-09 00:16:30,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:16:30,905 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 428 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:30,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 765 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:16:30,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85462 states. [2025-01-09 00:16:31,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85462 to 85450. [2025-01-09 00:16:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85450 states, 85449 states have (on average 1.129656286205807) internal successors, (96528), 85449 states have internal predecessors, (96528), 0 states have call successors, (0), 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-09 00:16:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85450 states to 85450 states and 96528 transitions. [2025-01-09 00:16:31,693 INFO L78 Accepts]: Start accepts. Automaton has 85450 states and 96528 transitions. Word has length 419 [2025-01-09 00:16:31,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:31,693 INFO L471 AbstractCegarLoop]: Abstraction has 85450 states and 96528 transitions. [2025-01-09 00:16:31,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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-09 00:16:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 85450 states and 96528 transitions. [2025-01-09 00:16:31,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-09 00:16:31,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:31,705 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:16:31,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 00:16:31,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:16:31,909 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:31,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:31,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1719689419, now seen corresponding path program 1 times [2025-01-09 00:16:31,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:31,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693608003] [2025-01-09 00:16:31,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:31,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:31,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-09 00:16:31,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-09 00:16:31,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:31,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-01-09 00:16:32,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:32,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693608003] [2025-01-09 00:16:32,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693608003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:32,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:32,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:32,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992504102] [2025-01-09 00:16:32,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:32,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:32,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:32,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:32,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:32,054 INFO L87 Difference]: Start difference. First operand 85450 states and 96528 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-09 00:16:33,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:33,697 INFO L93 Difference]: Finished difference Result 178129 states and 201446 transitions. [2025-01-09 00:16:33,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:33,697 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 545 [2025-01-09 00:16:33,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:33,802 INFO L225 Difference]: With dead ends: 178129 [2025-01-09 00:16:33,802 INFO L226 Difference]: Without dead ends: 92674 [2025-01-09 00:16:33,859 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-09 00:16:33,859 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 501 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:33,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 686 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:16:33,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92674 states. [2025-01-09 00:16:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92674 to 83286. [2025-01-09 00:16:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83286 states, 83285 states have (on average 1.1198895359308398) internal successors, (93270), 83285 states have internal predecessors, (93270), 0 states have call successors, (0), 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-09 00:16:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83286 states to 83286 states and 93270 transitions. [2025-01-09 00:16:35,097 INFO L78 Accepts]: Start accepts. Automaton has 83286 states and 93270 transitions. Word has length 545 [2025-01-09 00:16:35,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:35,101 INFO L471 AbstractCegarLoop]: Abstraction has 83286 states and 93270 transitions. [2025-01-09 00:16:35,102 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-09 00:16:35,102 INFO L276 IsEmpty]: Start isEmpty. Operand 83286 states and 93270 transitions. [2025-01-09 00:16:35,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2025-01-09 00:16:35,118 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:35,118 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:16:35,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:16:35,118 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:35,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:35,119 INFO L85 PathProgramCache]: Analyzing trace with hash 896485733, now seen corresponding path program 1 times [2025-01-09 00:16:35,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:35,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873672419] [2025-01-09 00:16:35,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:35,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:35,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 554 statements into 1 equivalence classes. [2025-01-09 00:16:35,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 554 of 554 statements. [2025-01-09 00:16:35,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:35,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-01-09 00:16:35,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:35,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873672419] [2025-01-09 00:16:35,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873672419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:35,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:35,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:16:35,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477154707] [2025-01-09 00:16:35,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:35,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:35,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:35,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:35,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:16:35,457 INFO L87 Difference]: Start difference. First operand 83286 states and 93270 transitions. Second operand has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 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-09 00:16:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:37,741 INFO L93 Difference]: Finished difference Result 191734 states and 213796 transitions. [2025-01-09 00:16:37,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:37,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 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 554 [2025-01-09 00:16:37,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:38,045 INFO L225 Difference]: With dead ends: 191734 [2025-01-09 00:16:38,046 INFO L226 Difference]: Without dead ends: 107600 [2025-01-09 00:16:38,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:16:38,089 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 732 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2324 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 2324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:38,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 227 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 2324 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:16:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107600 states. [2025-01-09 00:16:39,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107600 to 103340. [2025-01-09 00:16:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103340 states, 103339 states have (on average 1.1131712131915346) internal successors, (115034), 103339 states have internal predecessors, (115034), 0 states have call successors, (0), 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-09 00:16:39,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103340 states to 103340 states and 115034 transitions. [2025-01-09 00:16:39,307 INFO L78 Accepts]: Start accepts. Automaton has 103340 states and 115034 transitions. Word has length 554 [2025-01-09 00:16:39,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:39,307 INFO L471 AbstractCegarLoop]: Abstraction has 103340 states and 115034 transitions. [2025-01-09 00:16:39,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 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-09 00:16:39,308 INFO L276 IsEmpty]: Start isEmpty. Operand 103340 states and 115034 transitions. [2025-01-09 00:16:39,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2025-01-09 00:16:39,327 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:39,327 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:16:39,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:16:39,328 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:39,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:39,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1288379693, now seen corresponding path program 1 times [2025-01-09 00:16:39,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:39,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94226930] [2025-01-09 00:16:39,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:39,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:39,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 558 statements into 1 equivalence classes. [2025-01-09 00:16:39,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 558 of 558 statements. [2025-01-09 00:16:39,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:39,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 802 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-09 00:16:39,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:39,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94226930] [2025-01-09 00:16:39,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94226930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:39,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:39,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:39,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718446803] [2025-01-09 00:16:39,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:39,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:39,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:39,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:39,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:39,829 INFO L87 Difference]: Start difference. First operand 103340 states and 115034 transitions. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 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-09 00:16:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:41,619 INFO L93 Difference]: Finished difference Result 236452 states and 263557 transitions. [2025-01-09 00:16:41,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:41,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 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 558 [2025-01-09 00:16:41,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:41,750 INFO L225 Difference]: With dead ends: 236452 [2025-01-09 00:16:41,750 INFO L226 Difference]: Without dead ends: 133539 [2025-01-09 00:16:41,794 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-09 00:16:41,795 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 391 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:41,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 290 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:16:41,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133539 states. [2025-01-09 00:16:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133539 to 130555. [2025-01-09 00:16:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130555 states, 130554 states have (on average 1.1067297823123) internal successors, (144488), 130554 states have internal predecessors, (144488), 0 states have call successors, (0), 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-09 00:16:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130555 states to 130555 states and 144488 transitions. [2025-01-09 00:16:43,405 INFO L78 Accepts]: Start accepts. Automaton has 130555 states and 144488 transitions. Word has length 558 [2025-01-09 00:16:43,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:43,406 INFO L471 AbstractCegarLoop]: Abstraction has 130555 states and 144488 transitions. [2025-01-09 00:16:43,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 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-09 00:16:43,406 INFO L276 IsEmpty]: Start isEmpty. Operand 130555 states and 144488 transitions. [2025-01-09 00:16:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2025-01-09 00:16:43,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:43,425 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-09 00:16:43,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:16:43,425 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:43,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:43,426 INFO L85 PathProgramCache]: Analyzing trace with hash 237858136, now seen corresponding path program 1 times [2025-01-09 00:16:43,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:43,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472808845] [2025-01-09 00:16:43,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:43,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:43,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 559 statements into 1 equivalence classes. [2025-01-09 00:16:43,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 559 of 559 statements. [2025-01-09 00:16:43,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:43,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:44,034 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 541 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-09 00:16:44,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:44,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472808845] [2025-01-09 00:16:44,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472808845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:44,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:44,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:16:44,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328278336] [2025-01-09 00:16:44,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:44,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:16:44,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:44,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:16:44,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:16:44,036 INFO L87 Difference]: Start difference. First operand 130555 states and 144488 transitions. Second operand has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 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-09 00:16:46,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:46,666 INFO L93 Difference]: Finished difference Result 285827 states and 315525 transitions. [2025-01-09 00:16:46,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:16:46,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 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 559 [2025-01-09 00:16:46,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:46,816 INFO L225 Difference]: With dead ends: 285827 [2025-01-09 00:16:46,817 INFO L226 Difference]: Without dead ends: 154424 [2025-01-09 00:16:46,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:16:46,886 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 731 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 2713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:46,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 226 Invalid, 2713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:16:46,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154424 states. [2025-01-09 00:16:48,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154424 to 130980. [2025-01-09 00:16:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130980 states, 130979 states have (on average 1.106551431908932) internal successors, (144935), 130979 states have internal predecessors, (144935), 0 states have call successors, (0), 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-09 00:16:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130980 states to 130980 states and 144935 transitions. [2025-01-09 00:16:48,563 INFO L78 Accepts]: Start accepts. Automaton has 130980 states and 144935 transitions. Word has length 559 [2025-01-09 00:16:48,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:48,564 INFO L471 AbstractCegarLoop]: Abstraction has 130980 states and 144935 transitions. [2025-01-09 00:16:48,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 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-09 00:16:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 130980 states and 144935 transitions. [2025-01-09 00:16:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-01-09 00:16:48,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:48,587 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:16:48,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:16:48,588 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:48,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:48,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1747548367, now seen corresponding path program 1 times [2025-01-09 00:16:48,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:48,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464515939] [2025-01-09 00:16:48,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:48,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:48,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-01-09 00:16:48,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-01-09 00:16:48,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:48,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2025-01-09 00:16:49,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:49,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464515939] [2025-01-09 00:16:49,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464515939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:49,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:49,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:49,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647319398] [2025-01-09 00:16:49,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:49,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:49,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:49,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:49,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:49,190 INFO L87 Difference]: Start difference. First operand 130980 states and 144935 transitions. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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-09 00:16:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:51,221 INFO L93 Difference]: Finished difference Result 276019 states and 304651 transitions. [2025-01-09 00:16:51,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:51,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 632 [2025-01-09 00:16:51,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:51,378 INFO L225 Difference]: With dead ends: 276019 [2025-01-09 00:16:51,378 INFO L226 Difference]: Without dead ends: 143341 [2025-01-09 00:16:51,432 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-09 00:16:51,432 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 384 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:51,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 798 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:16:51,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143341 states. [2025-01-09 00:16:52,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143341 to 142036. [2025-01-09 00:16:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142036 states, 142035 states have (on average 1.0982785933044672) internal successors, (155994), 142035 states have internal predecessors, (155994), 0 states have call successors, (0), 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-09 00:16:53,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142036 states to 142036 states and 155994 transitions. [2025-01-09 00:16:53,136 INFO L78 Accepts]: Start accepts. Automaton has 142036 states and 155994 transitions. Word has length 632 [2025-01-09 00:16:53,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:53,136 INFO L471 AbstractCegarLoop]: Abstraction has 142036 states and 155994 transitions. [2025-01-09 00:16:53,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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-09 00:16:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 142036 states and 155994 transitions. [2025-01-09 00:16:53,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-01-09 00:16:53,159 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:53,160 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:16:53,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:16:53,160 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:53,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:53,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1645246017, now seen corresponding path program 1 times [2025-01-09 00:16:53,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:53,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917928606] [2025-01-09 00:16:53,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:53,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:53,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-01-09 00:16:53,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-01-09 00:16:53,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:53,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 00:16:53,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:53,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917928606] [2025-01-09 00:16:53,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917928606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:53,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:53,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:16:53,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587863232] [2025-01-09 00:16:53,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:53,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:16:53,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:53,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:16:53,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:16:53,577 INFO L87 Difference]: Start difference. First operand 142036 states and 155994 transitions. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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-09 00:16:55,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:16:55,544 INFO L93 Difference]: Finished difference Result 294710 states and 323666 transitions. [2025-01-09 00:16:55,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:16:55,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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 641 [2025-01-09 00:16:55,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:16:55,758 INFO L225 Difference]: With dead ends: 294710 [2025-01-09 00:16:55,759 INFO L226 Difference]: Without dead ends: 152675 [2025-01-09 00:16:55,847 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-09 00:16:55,848 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 422 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:16:55,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 664 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:16:56,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152675 states. [2025-01-09 00:16:57,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152675 to 152195. [2025-01-09 00:16:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152195 states, 152194 states have (on average 1.0894516209574623) internal successors, (165808), 152194 states have internal predecessors, (165808), 0 states have call successors, (0), 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-09 00:16:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152195 states to 152195 states and 165808 transitions. [2025-01-09 00:16:57,497 INFO L78 Accepts]: Start accepts. Automaton has 152195 states and 165808 transitions. Word has length 641 [2025-01-09 00:16:57,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:16:57,498 INFO L471 AbstractCegarLoop]: Abstraction has 152195 states and 165808 transitions. [2025-01-09 00:16:57,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 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-09 00:16:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 152195 states and 165808 transitions. [2025-01-09 00:16:57,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2025-01-09 00:16:57,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:16:57,599 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1] [2025-01-09 00:16:57,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:16:57,600 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:16:57,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:16:57,601 INFO L85 PathProgramCache]: Analyzing trace with hash 849344806, now seen corresponding path program 1 times [2025-01-09 00:16:57,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:16:57,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479110940] [2025-01-09 00:16:57,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:16:57,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:16:57,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 842 statements into 1 equivalence classes. [2025-01-09 00:16:57,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 842 of 842 statements. [2025-01-09 00:16:57,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:16:57,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:16:58,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2025-01-09 00:16:58,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:16:58,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479110940] [2025-01-09 00:16:58,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479110940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:16:58,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:16:58,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:16:58,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488238918] [2025-01-09 00:16:58,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:16:58,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:16:58,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:16:58,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:16:58,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:16:58,887 INFO L87 Difference]: Start difference. First operand 152195 states and 165808 transitions. Second operand has 5 states, 5 states have (on average 76.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 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-09 00:17:01,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:01,212 INFO L93 Difference]: Finished difference Result 296375 states and 322544 transitions. [2025-01-09 00:17:01,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:17:01,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 76.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 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 842 [2025-01-09 00:17:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:01,382 INFO L225 Difference]: With dead ends: 296375 [2025-01-09 00:17:01,382 INFO L226 Difference]: Without dead ends: 144509 [2025-01-09 00:17:01,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:17:01,467 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 838 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 2213 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:01,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 156 Invalid, 2300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2213 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:17:01,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144509 states. [2025-01-09 00:17:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144509 to 140653. [2025-01-09 00:17:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140653 states, 140652 states have (on average 1.0856937690185706) internal successors, (152705), 140652 states have internal predecessors, (152705), 0 states have call successors, (0), 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-09 00:17:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140653 states to 140653 states and 152705 transitions. [2025-01-09 00:17:03,177 INFO L78 Accepts]: Start accepts. Automaton has 140653 states and 152705 transitions. Word has length 842 [2025-01-09 00:17:03,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:17:03,178 INFO L471 AbstractCegarLoop]: Abstraction has 140653 states and 152705 transitions. [2025-01-09 00:17:03,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 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-09 00:17:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 140653 states and 152705 transitions. [2025-01-09 00:17:03,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 873 [2025-01-09 00:17:03,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:17:03,228 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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] [2025-01-09 00:17:03,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:17:03,228 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:17:03,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:17:03,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1643900651, now seen corresponding path program 1 times [2025-01-09 00:17:03,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:17:03,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004460799] [2025-01-09 00:17:03,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:17:03,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:17:03,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 872 statements into 1 equivalence classes. [2025-01-09 00:17:03,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 872 of 872 statements. [2025-01-09 00:17:03,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:17:03,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:17:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 931 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:17:03,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:17:03,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004460799] [2025-01-09 00:17:03,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004460799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:17:03,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:17:03,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:17:03,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437749150] [2025-01-09 00:17:03,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:17:03,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:17:03,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:17:03,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:17:03,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:17:03,923 INFO L87 Difference]: Start difference. First operand 140653 states and 152705 transitions. Second operand has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 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-09 00:17:06,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:17:06,437 INFO L93 Difference]: Finished difference Result 312793 states and 338749 transitions. [2025-01-09 00:17:06,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:17:06,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 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 872 [2025-01-09 00:17:06,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:17:06,625 INFO L225 Difference]: With dead ends: 312793 [2025-01-09 00:17:06,626 INFO L226 Difference]: Without dead ends: 172567 [2025-01-09 00:17:06,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:17:06,710 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 347 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 2450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:17:06,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 660 Invalid, 2450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:17:06,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172567 states.