./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label31.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_label31.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 af3862af5b8a27b2989fe566f1104f15a4544b51e9167db28055ff534e84b220 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:13:05,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:13:05,874 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:13:05,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:13:05,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:13:05,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:13:05,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:13:05,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:13:05,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:13:05,904 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:13:05,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:13:05,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:13:05,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:13:05,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:13:05,905 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:13:05,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:13:05,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:13:05,905 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:13:05,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:13:05,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:13:05,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:13:05,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:13:05,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:13:05,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:13:05,906 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:13:05,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:13:05,906 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:13:05,906 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:13:05,906 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:13:05,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:13:05,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:13:05,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:13:05,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:13:05,907 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:13:05,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:13:05,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:13:05,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:13:05,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:13:05,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:13:05,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:13:05,908 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:13:05,908 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:13:05,908 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:13:05,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:13:05,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:13:05,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:13:05,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:13:05,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:13:05,909 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 -> af3862af5b8a27b2989fe566f1104f15a4544b51e9167db28055ff534e84b220 [2025-01-09 00:13:06,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:13:06,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:13:06,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:13:06,182 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:13:06,182 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:13:06,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label31.c [2025-01-09 00:13:07,471 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95363fd0d/e5da95050c6f474e81c57904d3780b8b/FLAG17cbc2005 [2025-01-09 00:13:07,874 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:13:07,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label31.c [2025-01-09 00:13:07,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95363fd0d/e5da95050c6f474e81c57904d3780b8b/FLAG17cbc2005 [2025-01-09 00:13:07,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95363fd0d/e5da95050c6f474e81c57904d3780b8b [2025-01-09 00:13:07,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:13:07,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:13:07,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:13:07,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:13:07,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:13:07,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:13:07" (1/1) ... [2025-01-09 00:13:07,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4687e745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:07, skipping insertion in model container [2025-01-09 00:13:07,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:13:07" (1/1) ... [2025-01-09 00:13:08,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:13:08,159 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_label31.c[1403,1416] [2025-01-09 00:13:08,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:13:08,747 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:13:08,760 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_label31.c[1403,1416] [2025-01-09 00:13:09,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:13:09,069 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:13:09,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:09 WrapperNode [2025-01-09 00:13:09,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:13:09,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:13:09,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:13:09,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:13:09,078 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:13:09" (1/1) ... [2025-01-09 00:13:09,136 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:13:09" (1/1) ... [2025-01-09 00:13:09,385 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-01-09 00:13:09,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:13:09,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:13:09,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:13:09,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:13:09,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:09" (1/1) ... [2025-01-09 00:13:09,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:09" (1/1) ... [2025-01-09 00:13:09,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:09" (1/1) ... [2025-01-09 00:13:09,615 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:13:09,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:09" (1/1) ... [2025-01-09 00:13:09,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:09" (1/1) ... [2025-01-09 00:13:09,703 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:09" (1/1) ... [2025-01-09 00:13:09,722 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:09" (1/1) ... [2025-01-09 00:13:09,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:09" (1/1) ... [2025-01-09 00:13:09,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:09" (1/1) ... [2025-01-09 00:13:09,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:09" (1/1) ... [2025-01-09 00:13:09,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:13:09,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:13:09,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:13:09,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:13:09,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:09" (1/1) ... [2025-01-09 00:13:09,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:13:09,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:13:09,885 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:13:09,891 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:13:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:13:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:13:09,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:13:09,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:13:09,965 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:13:09,966 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:13:13,514 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-01-09 00:13:13,514 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:13:13,547 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:13:13,548 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:13:13,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:13:13 BoogieIcfgContainer [2025-01-09 00:13:13,548 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:13:13,554 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:13:13,554 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:13:13,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:13:13,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:13:07" (1/3) ... [2025-01-09 00:13:13,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726e2874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:13:13, skipping insertion in model container [2025-01-09 00:13:13,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:09" (2/3) ... [2025-01-09 00:13:13,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726e2874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:13:13, skipping insertion in model container [2025-01-09 00:13:13,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:13:13" (3/3) ... [2025-01-09 00:13:13,564 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label31.c [2025-01-09 00:13:13,577 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:13:13,579 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label31.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:13:13,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:13:13,662 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;@7d42e28c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:13:13,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:13:13,670 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:13:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 00:13:13,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:13,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:13,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:13,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash 150048722, now seen corresponding path program 1 times [2025-01-09 00:13:13,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:13,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234038072] [2025-01-09 00:13:13,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:13,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:13,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 00:13:13,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 00:13:13,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:13,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:13,891 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:13:13,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:13,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234038072] [2025-01-09 00:13:13,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234038072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:13,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:13,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:13:13,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794351992] [2025-01-09 00:13:13,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:13,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:13,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:13,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:13,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:13,919 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 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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:13:16,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:16,216 INFO L93 Difference]: Finished difference Result 1642 states and 3021 transitions. [2025-01-09 00:13:16,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:16,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2025-01-09 00:13:16,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:16,230 INFO L225 Difference]: With dead ends: 1642 [2025-01-09 00:13:16,230 INFO L226 Difference]: Without dead ends: 975 [2025-01-09 00:13:16,237 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:13:16,241 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 482 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:16,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 550 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:13:16,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-01-09 00:13:16,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2025-01-09 00:13:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 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:13:16,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2025-01-09 00:13:16,334 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 8 [2025-01-09 00:13:16,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:16,335 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2025-01-09 00:13:16,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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:13:16,335 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2025-01-09 00:13:16,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 00:13:16,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:16,337 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 00:13:16,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:13:16,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:16,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:16,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1177609246, now seen corresponding path program 1 times [2025-01-09 00:13:16,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:16,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047056204] [2025-01-09 00:13:16,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:16,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:16,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 00:13:16,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 00:13:16,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:16,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:16,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:16,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047056204] [2025-01-09 00:13:16,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047056204] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:16,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:16,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:16,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829078635] [2025-01-09 00:13:16,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:16,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:13:16,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:16,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:13:16,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:13:16,920 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 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:13:20,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:20,417 INFO L93 Difference]: Finished difference Result 3291 states and 5100 transitions. [2025-01-09 00:13:20,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:13:20,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2025-01-09 00:13:20,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:20,427 INFO L225 Difference]: With dead ends: 3291 [2025-01-09 00:13:20,427 INFO L226 Difference]: Without dead ends: 2321 [2025-01-09 00:13:20,429 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:13:20,430 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 1045 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 2671 mSolverCounterSat, 814 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 3485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 814 IncrementalHoareTripleChecker+Valid, 2671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:20,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 217 Invalid, 3485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [814 Valid, 2671 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-09 00:13:20,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2025-01-09 00:13:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2317. [2025-01-09 00:13:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 2316 states have (on average 1.455958549222798) internal successors, (3372), 2316 states have internal predecessors, (3372), 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:13:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 3372 transitions. [2025-01-09 00:13:20,498 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 3372 transitions. Word has length 78 [2025-01-09 00:13:20,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:20,499 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 3372 transitions. [2025-01-09 00:13:20,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 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:13:20,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 3372 transitions. [2025-01-09 00:13:20,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 00:13:20,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:20,504 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 00:13:20,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:13:20,504 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:20,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:20,508 INFO L85 PathProgramCache]: Analyzing trace with hash 753676321, now seen corresponding path program 1 times [2025-01-09 00:13:20,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:20,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477426494] [2025-01-09 00:13:20,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:20,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:20,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 00:13:20,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 00:13:20,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:20,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:20,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:20,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477426494] [2025-01-09 00:13:20,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477426494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:20,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:20,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:13:20,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602876838] [2025-01-09 00:13:20,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:20,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:20,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:20,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:20,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:20,725 INFO L87 Difference]: Start difference. First operand 2317 states and 3372 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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:13:22,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:22,682 INFO L93 Difference]: Finished difference Result 6838 states and 9971 transitions. [2025-01-09 00:13:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:22,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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 100 [2025-01-09 00:13:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:22,741 INFO L225 Difference]: With dead ends: 6838 [2025-01-09 00:13:22,742 INFO L226 Difference]: Without dead ends: 4523 [2025-01-09 00:13:22,747 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:13:22,749 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 436 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:22,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 292 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:13:22,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4523 states. [2025-01-09 00:13:22,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4523 to 4497. [2025-01-09 00:13:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4497 states, 4496 states have (on average 1.4270462633451957) internal successors, (6416), 4496 states have internal predecessors, (6416), 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:13:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4497 states to 4497 states and 6416 transitions. [2025-01-09 00:13:22,874 INFO L78 Accepts]: Start accepts. Automaton has 4497 states and 6416 transitions. Word has length 100 [2025-01-09 00:13:22,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:22,875 INFO L471 AbstractCegarLoop]: Abstraction has 4497 states and 6416 transitions. [2025-01-09 00:13:22,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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:13:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 4497 states and 6416 transitions. [2025-01-09 00:13:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 00:13:22,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:22,878 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:22,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:13:22,878 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:22,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash -401347882, now seen corresponding path program 1 times [2025-01-09 00:13:22,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:22,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525157700] [2025-01-09 00:13:22,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:22,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:22,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 00:13:22,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 00:13:22,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:22,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:23,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:23,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525157700] [2025-01-09 00:13:23,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525157700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:23,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:23,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:13:23,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650429555] [2025-01-09 00:13:23,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:23,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:23,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:23,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:23,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:23,140 INFO L87 Difference]: Start difference. First operand 4497 states and 6416 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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:13:24,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:24,804 INFO L93 Difference]: Finished difference Result 11974 states and 17431 transitions. [2025-01-09 00:13:24,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:24,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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 114 [2025-01-09 00:13:24,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:24,826 INFO L225 Difference]: With dead ends: 11974 [2025-01-09 00:13:24,826 INFO L226 Difference]: Without dead ends: 7479 [2025-01-09 00:13:24,832 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:13:24,833 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 364 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:24,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 497 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:13:24,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7479 states. [2025-01-09 00:13:24,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7479 to 7046. [2025-01-09 00:13:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7046 states, 7045 states have (on average 1.3349893541518807) internal successors, (9405), 7045 states have internal predecessors, (9405), 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:13:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7046 states to 7046 states and 9405 transitions. [2025-01-09 00:13:24,962 INFO L78 Accepts]: Start accepts. Automaton has 7046 states and 9405 transitions. Word has length 114 [2025-01-09 00:13:24,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:24,963 INFO L471 AbstractCegarLoop]: Abstraction has 7046 states and 9405 transitions. [2025-01-09 00:13:24,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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:13:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 7046 states and 9405 transitions. [2025-01-09 00:13:24,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 00:13:24,968 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:24,968 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:24,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:13:24,969 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:24,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:24,969 INFO L85 PathProgramCache]: Analyzing trace with hash 163314910, now seen corresponding path program 1 times [2025-01-09 00:13:24,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:24,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885717988] [2025-01-09 00:13:24,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:24,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:24,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 00:13:25,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 00:13:25,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:25,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 00:13:25,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:25,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885717988] [2025-01-09 00:13:25,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885717988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:25,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:25,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:13:25,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175048556] [2025-01-09 00:13:25,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:25,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:25,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:25,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:25,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:25,175 INFO L87 Difference]: Start difference. First operand 7046 states and 9405 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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:13:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:26,963 INFO L93 Difference]: Finished difference Result 18773 states and 25521 transitions. [2025-01-09 00:13:26,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:26,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 143 [2025-01-09 00:13:26,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:26,989 INFO L225 Difference]: With dead ends: 18773 [2025-01-09 00:13:26,990 INFO L226 Difference]: Without dead ends: 11300 [2025-01-09 00:13:26,999 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:13:27,000 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:27,001 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.7s Time] [2025-01-09 00:13:27,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11300 states. [2025-01-09 00:13:27,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11300 to 8323. [2025-01-09 00:13:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8323 states, 8322 states have (on average 1.2595529920692141) internal successors, (10482), 8322 states have internal predecessors, (10482), 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:13:27,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8323 states to 8323 states and 10482 transitions. [2025-01-09 00:13:27,335 INFO L78 Accepts]: Start accepts. Automaton has 8323 states and 10482 transitions. Word has length 143 [2025-01-09 00:13:27,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:27,335 INFO L471 AbstractCegarLoop]: Abstraction has 8323 states and 10482 transitions. [2025-01-09 00:13:27,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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:13:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 8323 states and 10482 transitions. [2025-01-09 00:13:27,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 00:13:27,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:27,340 INFO L218 NwaCegarLoop]: trace histogram [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, 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:13:27,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:13:27,340 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:27,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:27,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1139332031, now seen corresponding path program 1 times [2025-01-09 00:13:27,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:27,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466019231] [2025-01-09 00:13:27,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:27,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:27,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 00:13:27,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 00:13:27,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:27,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:27,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:27,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466019231] [2025-01-09 00:13:27,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466019231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:27,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:27,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 00:13:27,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107810792] [2025-01-09 00:13:27,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:27,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:13:27,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:27,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:13:27,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:13:27,703 INFO L87 Difference]: Start difference. First operand 8323 states and 10482 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 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:13:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:29,855 INFO L93 Difference]: Finished difference Result 21332 states and 27372 transitions. [2025-01-09 00:13:29,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:13:29,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 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 156 [2025-01-09 00:13:29,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:29,879 INFO L225 Difference]: With dead ends: 21332 [2025-01-09 00:13:29,879 INFO L226 Difference]: Without dead ends: 13011 [2025-01-09 00:13:29,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:13:29,884 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 593 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2425 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 3014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 2425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:29,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 905 Invalid, 3014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 2425 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:13:29,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13011 states. [2025-01-09 00:13:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13011 to 12996. [2025-01-09 00:13:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12996 states, 12995 states have (on average 1.2273951519815314) internal successors, (15950), 12995 states have internal predecessors, (15950), 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:13:30,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12996 states to 12996 states and 15950 transitions. [2025-01-09 00:13:30,051 INFO L78 Accepts]: Start accepts. Automaton has 12996 states and 15950 transitions. Word has length 156 [2025-01-09 00:13:30,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:30,051 INFO L471 AbstractCegarLoop]: Abstraction has 12996 states and 15950 transitions. [2025-01-09 00:13:30,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 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:13:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 12996 states and 15950 transitions. [2025-01-09 00:13:30,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-01-09 00:13:30,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:30,055 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:13:30,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:13:30,055 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:30,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:30,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1921294590, now seen corresponding path program 1 times [2025-01-09 00:13:30,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:30,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247388267] [2025-01-09 00:13:30,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:30,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:30,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-01-09 00:13:30,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-01-09 00:13:30,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:30,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-01-09 00:13:30,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:30,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247388267] [2025-01-09 00:13:30,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247388267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:30,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:30,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:30,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738576218] [2025-01-09 00:13:30,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:30,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:30,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:30,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:30,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:30,340 INFO L87 Difference]: Start difference. First operand 12996 states and 15950 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:13:32,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:32,280 INFO L93 Difference]: Finished difference Result 31503 states and 38604 transitions. [2025-01-09 00:13:32,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:32,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 261 [2025-01-09 00:13:32,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:32,317 INFO L225 Difference]: With dead ends: 31503 [2025-01-09 00:13:32,317 INFO L226 Difference]: Without dead ends: 17659 [2025-01-09 00:13:32,329 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:13:32,330 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 436 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:32,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 951 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:13:32,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17659 states. [2025-01-09 00:13:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17659 to 12122. [2025-01-09 00:13:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12122 states, 12121 states have (on average 1.1796881445425296) internal successors, (14299), 12121 states have internal predecessors, (14299), 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:13:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12122 states to 12122 states and 14299 transitions. [2025-01-09 00:13:32,485 INFO L78 Accepts]: Start accepts. Automaton has 12122 states and 14299 transitions. Word has length 261 [2025-01-09 00:13:32,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:32,486 INFO L471 AbstractCegarLoop]: Abstraction has 12122 states and 14299 transitions. [2025-01-09 00:13:32,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:13:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 12122 states and 14299 transitions. [2025-01-09 00:13:32,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-09 00:13:32,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:32,491 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 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:13:32,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:13:32,492 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:32,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:32,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1531566459, now seen corresponding path program 1 times [2025-01-09 00:13:32,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:32,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846972697] [2025-01-09 00:13:32,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:32,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:32,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-09 00:13:32,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-09 00:13:32,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:32,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:32,701 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-01-09 00:13:32,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:32,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846972697] [2025-01-09 00:13:32,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846972697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:32,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:32,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:32,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224184026] [2025-01-09 00:13:32,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:32,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:32,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:32,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:32,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:32,703 INFO L87 Difference]: Start difference. First operand 12122 states and 14299 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:13:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:34,523 INFO L93 Difference]: Finished difference Result 31047 states and 36683 transitions. [2025-01-09 00:13:34,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:34,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 278 [2025-01-09 00:13:34,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:34,558 INFO L225 Difference]: With dead ends: 31047 [2025-01-09 00:13:34,559 INFO L226 Difference]: Without dead ends: 18927 [2025-01-09 00:13:34,568 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:13:34,568 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 485 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:34,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 407 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:13:34,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18927 states. [2025-01-09 00:13:34,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18927 to 16794. [2025-01-09 00:13:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16794 states, 16793 states have (on average 1.1678675638658964) internal successors, (19612), 16793 states have internal predecessors, (19612), 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:13:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16794 states to 16794 states and 19612 transitions. [2025-01-09 00:13:34,869 INFO L78 Accepts]: Start accepts. Automaton has 16794 states and 19612 transitions. Word has length 278 [2025-01-09 00:13:34,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:34,871 INFO L471 AbstractCegarLoop]: Abstraction has 16794 states and 19612 transitions. [2025-01-09 00:13:34,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:13:34,872 INFO L276 IsEmpty]: Start isEmpty. Operand 16794 states and 19612 transitions. [2025-01-09 00:13:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-01-09 00:13:34,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:34,877 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:13:34,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:13:34,879 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:34,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:34,880 INFO L85 PathProgramCache]: Analyzing trace with hash 801118824, now seen corresponding path program 1 times [2025-01-09 00:13:34,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:34,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875403713] [2025-01-09 00:13:34,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:34,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:34,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-01-09 00:13:34,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-01-09 00:13:34,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:34,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 00:13:35,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:35,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875403713] [2025-01-09 00:13:35,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875403713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:35,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:35,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:35,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265392461] [2025-01-09 00:13:35,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:35,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:35,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:35,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:35,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:35,305 INFO L87 Difference]: Start difference. First operand 16794 states and 19612 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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:13:37,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:37,049 INFO L93 Difference]: Finished difference Result 40447 states and 47562 transitions. [2025-01-09 00:13:37,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:37,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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 322 [2025-01-09 00:13:37,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:37,091 INFO L225 Difference]: With dead ends: 40447 [2025-01-09 00:13:37,091 INFO L226 Difference]: Without dead ends: 22805 [2025-01-09 00:13:37,159 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:13:37,164 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 382 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:37,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 920 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:13:37,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22805 states. [2025-01-09 00:13:37,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22805 to 22370. [2025-01-09 00:13:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22370 states, 22369 states have (on average 1.1468550225758862) internal successors, (25654), 22369 states have internal predecessors, (25654), 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:13:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22370 states to 22370 states and 25654 transitions. [2025-01-09 00:13:37,635 INFO L78 Accepts]: Start accepts. Automaton has 22370 states and 25654 transitions. Word has length 322 [2025-01-09 00:13:37,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:37,636 INFO L471 AbstractCegarLoop]: Abstraction has 22370 states and 25654 transitions. [2025-01-09 00:13:37,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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:13:37,636 INFO L276 IsEmpty]: Start isEmpty. Operand 22370 states and 25654 transitions. [2025-01-09 00:13:37,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-01-09 00:13:37,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:37,644 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:13:37,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:13:37,644 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:37,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:37,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1487810423, now seen corresponding path program 1 times [2025-01-09 00:13:37,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:37,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908701555] [2025-01-09 00:13:37,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:37,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:37,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-09 00:13:37,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-09 00:13:37,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:37,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:38,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:38,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908701555] [2025-01-09 00:13:38,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908701555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:38,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:38,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:13:38,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710922097] [2025-01-09 00:13:38,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:38,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:13:38,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:38,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:13:38,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:13:38,242 INFO L87 Difference]: Start difference. First operand 22370 states and 25654 transitions. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 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:13:40,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:40,996 INFO L93 Difference]: Finished difference Result 55869 states and 64459 transitions. [2025-01-09 00:13:40,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:13:40,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 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 329 [2025-01-09 00:13:40,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:41,040 INFO L225 Difference]: With dead ends: 55869 [2025-01-09 00:13:41,040 INFO L226 Difference]: Without dead ends: 33501 [2025-01-09 00:13:41,056 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:13:41,057 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 807 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 3024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:41,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 190 Invalid, 3024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 00:13:41,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33501 states. [2025-01-09 00:13:41,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33501 to 28805. [2025-01-09 00:13:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28805 states, 28804 states have (on average 1.1681016525482573) internal successors, (33646), 28804 states have internal predecessors, (33646), 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:13:41,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28805 states to 28805 states and 33646 transitions. [2025-01-09 00:13:41,431 INFO L78 Accepts]: Start accepts. Automaton has 28805 states and 33646 transitions. Word has length 329 [2025-01-09 00:13:41,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:41,432 INFO L471 AbstractCegarLoop]: Abstraction has 28805 states and 33646 transitions. [2025-01-09 00:13:41,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 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:13:41,432 INFO L276 IsEmpty]: Start isEmpty. Operand 28805 states and 33646 transitions. [2025-01-09 00:13:41,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-01-09 00:13:41,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:41,492 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:13:41,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:13:41,493 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:41,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:41,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2015134152, now seen corresponding path program 1 times [2025-01-09 00:13:41,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:41,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057422260] [2025-01-09 00:13:41,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:41,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:41,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-01-09 00:13:41,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-01-09 00:13:41,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:41,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:13:41,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:41,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057422260] [2025-01-09 00:13:41,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057422260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:41,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:41,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:41,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94193817] [2025-01-09 00:13:41,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:41,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:41,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:41,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:41,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:42,000 INFO L87 Difference]: Start difference. First operand 28805 states and 33646 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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:13:43,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:43,634 INFO L93 Difference]: Finished difference Result 72109 states and 84109 transitions. [2025-01-09 00:13:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:43,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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 372 [2025-01-09 00:13:43,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:43,677 INFO L225 Difference]: With dead ends: 72109 [2025-01-09 00:13:43,677 INFO L226 Difference]: Without dead ends: 42869 [2025-01-09 00:13:43,701 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:13:43,702 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 394 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:43,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 792 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:13:43,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42869 states. [2025-01-09 00:13:44,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42869 to 42005. [2025-01-09 00:13:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42005 states, 42004 states have (on average 1.1513903437767832) internal successors, (48363), 42004 states have internal predecessors, (48363), 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:13:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42005 states to 42005 states and 48363 transitions. [2025-01-09 00:13:44,269 INFO L78 Accepts]: Start accepts. Automaton has 42005 states and 48363 transitions. Word has length 372 [2025-01-09 00:13:44,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:44,270 INFO L471 AbstractCegarLoop]: Abstraction has 42005 states and 48363 transitions. [2025-01-09 00:13:44,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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:13:44,270 INFO L276 IsEmpty]: Start isEmpty. Operand 42005 states and 48363 transitions. [2025-01-09 00:13:44,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-01-09 00:13:44,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:44,278 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-09 00:13:44,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:13:44,279 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:44,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:44,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1603746913, now seen corresponding path program 1 times [2025-01-09 00:13:44,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:44,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867779309] [2025-01-09 00:13:44,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:44,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:44,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-01-09 00:13:44,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-01-09 00:13:44,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:44,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-01-09 00:13:44,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:44,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867779309] [2025-01-09 00:13:44,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867779309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:44,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:44,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:44,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608086962] [2025-01-09 00:13:44,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:44,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:44,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:44,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:44,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:44,836 INFO L87 Difference]: Start difference. First operand 42005 states and 48363 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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:13:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:46,764 INFO L93 Difference]: Finished difference Result 102328 states and 117774 transitions. [2025-01-09 00:13:46,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:46,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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:13:46,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:46,835 INFO L225 Difference]: With dead ends: 102328 [2025-01-09 00:13:46,835 INFO L226 Difference]: Without dead ends: 59458 [2025-01-09 00:13:46,866 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:13:46,867 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 460 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:46,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 639 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:13:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59458 states. [2025-01-09 00:13:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59458 to 54764. [2025-01-09 00:13:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54764 states, 54763 states have (on average 1.1325347406095356) internal successors, (62021), 54763 states have internal predecessors, (62021), 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:13:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54764 states to 54764 states and 62021 transitions. [2025-01-09 00:13:47,744 INFO L78 Accepts]: Start accepts. Automaton has 54764 states and 62021 transitions. Word has length 404 [2025-01-09 00:13:47,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:47,746 INFO L471 AbstractCegarLoop]: Abstraction has 54764 states and 62021 transitions. [2025-01-09 00:13:47,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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:13:47,746 INFO L276 IsEmpty]: Start isEmpty. Operand 54764 states and 62021 transitions. [2025-01-09 00:13:47,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-01-09 00:13:47,755 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:47,755 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-09 00:13:47,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:13:47,755 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:47,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash 340646001, now seen corresponding path program 1 times [2025-01-09 00:13:47,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:47,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288630810] [2025-01-09 00:13:47,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:47,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:47,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-01-09 00:13:47,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-01-09 00:13:47,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:47,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-01-09 00:13:48,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:48,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288630810] [2025-01-09 00:13:48,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288630810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:48,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:48,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:48,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144180670] [2025-01-09 00:13:48,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:48,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:48,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:48,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:48,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:48,227 INFO L87 Difference]: Start difference. First operand 54764 states and 62021 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 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:13:50,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:50,301 INFO L93 Difference]: Finished difference Result 129528 states and 147208 transitions. [2025-01-09 00:13:50,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:50,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 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 427 [2025-01-09 00:13:50,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:50,385 INFO L225 Difference]: With dead ends: 129528 [2025-01-09 00:13:50,385 INFO L226 Difference]: Without dead ends: 74766 [2025-01-09 00:13:50,412 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:13:50,413 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 407 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:50,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 313 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:13:50,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74766 states. [2025-01-09 00:13:51,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74766 to 73051. [2025-01-09 00:13:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73051 states, 73050 states have (on average 1.1258726899383984) internal successors, (82245), 73050 states have internal predecessors, (82245), 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:13:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73051 states to 73051 states and 82245 transitions. [2025-01-09 00:13:51,426 INFO L78 Accepts]: Start accepts. Automaton has 73051 states and 82245 transitions. Word has length 427 [2025-01-09 00:13:51,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:51,427 INFO L471 AbstractCegarLoop]: Abstraction has 73051 states and 82245 transitions. [2025-01-09 00:13:51,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 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:13:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 73051 states and 82245 transitions. [2025-01-09 00:13:51,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-09 00:13:51,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:51,449 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:13:51,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:13:51,450 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:51,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:51,451 INFO L85 PathProgramCache]: Analyzing trace with hash -673565850, now seen corresponding path program 1 times [2025-01-09 00:13:51,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:51,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745483870] [2025-01-09 00:13:51,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:51,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:51,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 00:13:51,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 00:13:51,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:51,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-01-09 00:13:52,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:52,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745483870] [2025-01-09 00:13:52,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745483870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:52,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:52,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:52,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587445461] [2025-01-09 00:13:52,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:52,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:52,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:52,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:52,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:52,093 INFO L87 Difference]: Start difference. First operand 73051 states and 82245 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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:13:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:53,897 INFO L93 Difference]: Finished difference Result 160154 states and 179776 transitions. [2025-01-09 00:13:53,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:53,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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 428 [2025-01-09 00:13:53,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:53,983 INFO L225 Difference]: With dead ends: 160154 [2025-01-09 00:13:53,983 INFO L226 Difference]: Without dead ends: 86254 [2025-01-09 00:13:54,021 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:13:54,022 INFO L435 NwaCegarLoop]: 768 mSDtfsCounter, 370 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:54,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 823 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:13:54,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86254 states. [2025-01-09 00:13:54,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86254 to 83681. [2025-01-09 00:13:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83681 states, 83680 states have (on average 1.1163718929254303) internal successors, (93418), 83680 states have internal predecessors, (93418), 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:13:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83681 states to 83681 states and 93418 transitions. [2025-01-09 00:13:55,106 INFO L78 Accepts]: Start accepts. Automaton has 83681 states and 93418 transitions. Word has length 428 [2025-01-09 00:13:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:55,111 INFO L471 AbstractCegarLoop]: Abstraction has 83681 states and 93418 transitions. [2025-01-09 00:13:55,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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:13:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 83681 states and 93418 transitions. [2025-01-09 00:13:55,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-01-09 00:13:55,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:55,122 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:13:55,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:13:55,122 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:55,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:55,125 INFO L85 PathProgramCache]: Analyzing trace with hash 243237510, now seen corresponding path program 1 times [2025-01-09 00:13:55,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:55,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096345903] [2025-01-09 00:13:55,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:55,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:55,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-01-09 00:13:55,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-01-09 00:13:55,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:55,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-01-09 00:13:55,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:55,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096345903] [2025-01-09 00:13:55,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096345903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:55,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:55,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:55,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722739613] [2025-01-09 00:13:55,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:55,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:55,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:55,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:55,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:55,692 INFO L87 Difference]: Start difference. First operand 83681 states and 93418 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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:13:57,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:57,529 INFO L93 Difference]: Finished difference Result 177154 states and 198136 transitions. [2025-01-09 00:13:57,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:57,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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 446 [2025-01-09 00:13:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:57,626 INFO L225 Difference]: With dead ends: 177154 [2025-01-09 00:13:57,626 INFO L226 Difference]: Without dead ends: 93475 [2025-01-09 00:13:57,659 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:13:57,660 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 341 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:57,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 768 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:13:57,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93475 states. [2025-01-09 00:13:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93475 to 83645. [2025-01-09 00:13:58,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83645 states, 83644 states have (on average 1.1070608770503563) internal successors, (92599), 83644 states have internal predecessors, (92599), 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:13:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83645 states to 83645 states and 92599 transitions. [2025-01-09 00:13:58,696 INFO L78 Accepts]: Start accepts. Automaton has 83645 states and 92599 transitions. Word has length 446 [2025-01-09 00:13:58,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:58,696 INFO L471 AbstractCegarLoop]: Abstraction has 83645 states and 92599 transitions. [2025-01-09 00:13:58,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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:13:58,696 INFO L276 IsEmpty]: Start isEmpty. Operand 83645 states and 92599 transitions. [2025-01-09 00:13:58,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-01-09 00:13:58,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:58,704 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:13:58,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:13:58,705 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:58,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:58,705 INFO L85 PathProgramCache]: Analyzing trace with hash 148290775, now seen corresponding path program 1 times [2025-01-09 00:13:58,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:58,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908530242] [2025-01-09 00:13:58,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:58,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:58,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-01-09 00:13:58,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-01-09 00:13:58,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:58,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-01-09 00:13:59,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:59,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908530242] [2025-01-09 00:13:59,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908530242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:59,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:59,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:59,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744128328] [2025-01-09 00:13:59,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:59,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:59,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:59,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:59,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:59,273 INFO L87 Difference]: Start difference. First operand 83645 states and 92599 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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:14:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:01,065 INFO L93 Difference]: Finished difference Result 182627 states and 201964 transitions. [2025-01-09 00:14:01,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:01,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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 451 [2025-01-09 00:14:01,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:01,183 INFO L225 Difference]: With dead ends: 182627 [2025-01-09 00:14:01,183 INFO L226 Difference]: Without dead ends: 98984 [2025-01-09 00:14:01,224 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:14:01,225 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 292 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:01,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 827 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:14:01,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98984 states. [2025-01-09 00:14:02,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98984 to 98107. [2025-01-09 00:14:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98107 states, 98106 states have (on average 1.0979348867551424) internal successors, (107714), 98106 states have internal predecessors, (107714), 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:14:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98107 states to 98107 states and 107714 transitions. [2025-01-09 00:14:02,530 INFO L78 Accepts]: Start accepts. Automaton has 98107 states and 107714 transitions. Word has length 451 [2025-01-09 00:14:02,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:02,531 INFO L471 AbstractCegarLoop]: Abstraction has 98107 states and 107714 transitions. [2025-01-09 00:14:02,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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:14:02,531 INFO L276 IsEmpty]: Start isEmpty. Operand 98107 states and 107714 transitions. [2025-01-09 00:14:02,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-01-09 00:14:02,539 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:02,540 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:14:02,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:14:02,540 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:02,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:02,541 INFO L85 PathProgramCache]: Analyzing trace with hash -159895495, now seen corresponding path program 1 times [2025-01-09 00:14:02,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:02,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887834153] [2025-01-09 00:14:02,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:02,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:02,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-01-09 00:14:02,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-01-09 00:14:02,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:02,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-01-09 00:14:03,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:03,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887834153] [2025-01-09 00:14:03,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887834153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:03,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:03,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:03,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253425879] [2025-01-09 00:14:03,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:03,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:03,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:03,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:03,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:03,036 INFO L87 Difference]: Start difference. First operand 98107 states and 107714 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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:14:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:04,804 INFO L93 Difference]: Finished difference Result 208585 states and 229323 transitions. [2025-01-09 00:14:04,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:04,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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 451 [2025-01-09 00:14:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:04,946 INFO L225 Difference]: With dead ends: 208585 [2025-01-09 00:14:04,946 INFO L226 Difference]: Without dead ends: 110050 [2025-01-09 00:14:05,018 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:14:05,019 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 445 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:05,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 257 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:14:05,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110050 states. [2025-01-09 00:14:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110050 to 106619. [2025-01-09 00:14:06,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106619 states, 106618 states have (on average 1.098735673150875) internal successors, (117145), 106618 states have internal predecessors, (117145), 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:14:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106619 states to 106619 states and 117145 transitions. [2025-01-09 00:14:06,532 INFO L78 Accepts]: Start accepts. Automaton has 106619 states and 117145 transitions. Word has length 451 [2025-01-09 00:14:06,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:06,533 INFO L471 AbstractCegarLoop]: Abstraction has 106619 states and 117145 transitions. [2025-01-09 00:14:06,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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:14:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 106619 states and 117145 transitions. [2025-01-09 00:14:06,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-01-09 00:14:06,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:06,543 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:14:06,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:14:06,543 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:06,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:06,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1926276145, now seen corresponding path program 1 times [2025-01-09 00:14:06,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:06,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770281540] [2025-01-09 00:14:06,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:06,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:06,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-01-09 00:14:06,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-01-09 00:14:06,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:06,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:14:07,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:07,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770281540] [2025-01-09 00:14:07,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770281540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:07,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:07,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:07,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104121702] [2025-01-09 00:14:07,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:07,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:07,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:07,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:07,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:07,381 INFO L87 Difference]: Start difference. First operand 106619 states and 117145 transitions. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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:14:09,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:09,322 INFO L93 Difference]: Finished difference Result 220487 states and 242183 transitions. [2025-01-09 00:14:09,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:09,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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 454 [2025-01-09 00:14:09,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:09,457 INFO L225 Difference]: With dead ends: 220487 [2025-01-09 00:14:09,457 INFO L226 Difference]: Without dead ends: 113445 [2025-01-09 00:14:09,481 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:14:09,482 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 248 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:09,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 795 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:14:09,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113445 states. [2025-01-09 00:14:10,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113445 to 110030. [2025-01-09 00:14:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110030 states, 110029 states have (on average 1.0948295449381527) internal successors, (120463), 110029 states have internal predecessors, (120463), 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:14:10,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110030 states to 110030 states and 120463 transitions. [2025-01-09 00:14:10,925 INFO L78 Accepts]: Start accepts. Automaton has 110030 states and 120463 transitions. Word has length 454 [2025-01-09 00:14:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:10,926 INFO L471 AbstractCegarLoop]: Abstraction has 110030 states and 120463 transitions. [2025-01-09 00:14:10,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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:14:10,928 INFO L276 IsEmpty]: Start isEmpty. Operand 110030 states and 120463 transitions. [2025-01-09 00:14:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-01-09 00:14:10,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:10,943 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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:14:10,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:14:10,943 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:10,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:10,944 INFO L85 PathProgramCache]: Analyzing trace with hash -573547191, now seen corresponding path program 1 times [2025-01-09 00:14:10,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:10,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268472499] [2025-01-09 00:14:10,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:10,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:10,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-01-09 00:14:11,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-01-09 00:14:11,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:11,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-01-09 00:14:11,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:11,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268472499] [2025-01-09 00:14:11,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268472499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:11,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:11,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:11,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808308992] [2025-01-09 00:14:11,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:11,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:11,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:11,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:11,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:11,373 INFO L87 Difference]: Start difference. First operand 110030 states and 120463 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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:14:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:13,432 INFO L93 Difference]: Finished difference Result 238406 states and 261006 transitions. [2025-01-09 00:14:13,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:13,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 543 [2025-01-09 00:14:13,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:13,583 INFO L225 Difference]: With dead ends: 238406 [2025-01-09 00:14:13,583 INFO L226 Difference]: Without dead ends: 128378 [2025-01-09 00:14:13,644 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:14:13,645 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 321 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:13,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 321 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:14:13,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128378 states. [2025-01-09 00:14:15,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128378 to 125793. [2025-01-09 00:14:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125793 states, 125792 states have (on average 1.0923985627066903) internal successors, (137415), 125792 states have internal predecessors, (137415), 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:14:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125793 states to 125793 states and 137415 transitions. [2025-01-09 00:14:15,283 INFO L78 Accepts]: Start accepts. Automaton has 125793 states and 137415 transitions. Word has length 543 [2025-01-09 00:14:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:15,283 INFO L471 AbstractCegarLoop]: Abstraction has 125793 states and 137415 transitions. [2025-01-09 00:14:15,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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:14:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 125793 states and 137415 transitions. [2025-01-09 00:14:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-01-09 00:14:15,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:15,294 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:15,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:14:15,295 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:15,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:15,295 INFO L85 PathProgramCache]: Analyzing trace with hash 925976242, now seen corresponding path program 1 times [2025-01-09 00:14:15,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:15,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417160771] [2025-01-09 00:14:15,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:15,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:15,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-01-09 00:14:15,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-01-09 00:14:15,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:15,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-01-09 00:14:15,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:15,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417160771] [2025-01-09 00:14:15,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417160771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:15,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:15,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 00:14:15,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148471592] [2025-01-09 00:14:15,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:15,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:14:15,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:15,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:14:15,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:14:15,833 INFO L87 Difference]: Start difference. First operand 125793 states and 137415 transitions. Second operand has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 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:14:19,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:19,893 INFO L93 Difference]: Finished difference Result 303156 states and 331079 transitions. [2025-01-09 00:14:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:14:19,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 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 563 [2025-01-09 00:14:19,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:20,106 INFO L225 Difference]: With dead ends: 303156 [2025-01-09 00:14:20,106 INFO L226 Difference]: Without dead ends: 176512 [2025-01-09 00:14:20,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:14:20,162 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 1310 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 3986 mSolverCounterSat, 621 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 4607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 621 IncrementalHoareTripleChecker+Valid, 3986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:20,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1310 Valid, 325 Invalid, 4607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [621 Valid, 3986 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 00:14:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176512 states.