./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label17.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 09db197a4bc835c4357a369c0d6e9c99a50322d20849e0303ed04dd1e516e51b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:50:43,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:50:43,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:50:43,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:50:43,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:50:44,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:50:44,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:50:44,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:50:44,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:50:44,005 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:50:44,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:50:44,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:50:44,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:50:44,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:50:44,007 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:50:44,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:50:44,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:50:44,007 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:50:44,007 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:50:44,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:50:44,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:50:44,008 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:50:44,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:50:44,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:50:44,008 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:50:44,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:50:44,008 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:50:44,008 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:50:44,008 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:50:44,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:50:44,009 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:50:44,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:50:44,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:50:44,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:50:44,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:50:44,009 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:50:44,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:50:44,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:50:44,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:50:44,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:50:44,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:50:44,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:50:44,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:50:44,010 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/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 -> 09db197a4bc835c4357a369c0d6e9c99a50322d20849e0303ed04dd1e516e51b [2025-03-03 09:50:44,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:50:44,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:50:44,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:50:44,254 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:50:44,254 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:50:44,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label17.c [2025-03-03 09:50:45,313 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/871bd8101/d93a555a8f404547b72fe1cfe57da655/FLAG74e92730e [2025-03-03 09:50:45,680 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:50:45,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label17.c [2025-03-03 09:50:45,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/871bd8101/d93a555a8f404547b72fe1cfe57da655/FLAG74e92730e [2025-03-03 09:50:45,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/871bd8101/d93a555a8f404547b72fe1cfe57da655 [2025-03-03 09:50:45,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:50:45,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:50:45,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:50:45,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:50:45,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:50:45,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:50:45" (1/1) ... [2025-03-03 09:50:45,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1763583b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:45, skipping insertion in model container [2025-03-03 09:50:45,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:50:45" (1/1) ... [2025-03-03 09:50:45,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:50:46,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label17.c[61094,61107] [2025-03-03 09:50:46,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:50:46,365 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:50:46,491 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label17.c[61094,61107] [2025-03-03 09:50:46,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:50:46,518 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:50:46,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:46 WrapperNode [2025-03-03 09:50:46,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:50:46,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:50:46,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:50:46,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:50:46,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:46" (1/1) ... [2025-03-03 09:50:46,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:46" (1/1) ... [2025-03-03 09:50:46,610 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-03 09:50:46,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:50:46,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:50:46,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:50:46,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:50:46,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:46" (1/1) ... [2025-03-03 09:50:46,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:46" (1/1) ... [2025-03-03 09:50:46,626 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:46" (1/1) ... [2025-03-03 09:50:46,660 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-03-03 09:50:46,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:46" (1/1) ... [2025-03-03 09:50:46,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:46" (1/1) ... [2025-03-03 09:50:46,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:46" (1/1) ... [2025-03-03 09:50:46,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:46" (1/1) ... [2025-03-03 09:50:46,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:46" (1/1) ... [2025-03-03 09:50:46,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:46" (1/1) ... [2025-03-03 09:50:46,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:50:46,756 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:50:46,756 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:50:46,756 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:50:46,757 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:46" (1/1) ... [2025-03-03 09:50:46,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:50:46,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:50:46,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:50:46,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:50:46,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:50:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:50:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:50:46,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:50:46,880 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:50:46,881 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:50:48,245 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-03 09:50:48,245 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:50:48,255 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:50:48,255 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:50:48,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:50:48 BoogieIcfgContainer [2025-03-03 09:50:48,256 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:50:48,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:50:48,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:50:48,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:50:48,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:50:45" (1/3) ... [2025-03-03 09:50:48,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469a2ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:50:48, skipping insertion in model container [2025-03-03 09:50:48,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:46" (2/3) ... [2025-03-03 09:50:48,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469a2ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:50:48, skipping insertion in model container [2025-03-03 09:50:48,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:50:48" (3/3) ... [2025-03-03 09:50:48,263 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label17.c [2025-03-03 09:50:48,273 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:50:48,276 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label17.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:50:48,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:50:48,333 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;@56fea0d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:50:48,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:50:48,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:48,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-03 09:50:48,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:48,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:48,351 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:48,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:48,355 INFO L85 PathProgramCache]: Analyzing trace with hash -994847914, now seen corresponding path program 1 times [2025-03-03 09:50:48,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:48,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611161206] [2025-03-03 09:50:48,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:48,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:48,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-03 09:50:48,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-03 09:50:48,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:48,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:50:49,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:49,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611161206] [2025-03-03 09:50:49,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611161206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:49,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:49,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:50:49,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670901048] [2025-03-03 09:50:49,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:49,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:49,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:49,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:49,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:49,190 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 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-03-03 09:50:50,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:50,105 INFO L93 Difference]: Finished difference Result 860 states and 1504 transitions. [2025-03-03 09:50:50,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:50,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 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 199 [2025-03-03 09:50:50,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:50,115 INFO L225 Difference]: With dead ends: 860 [2025-03-03 09:50:50,115 INFO L226 Difference]: Without dead ends: 465 [2025-03-03 09:50:50,117 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-03-03 09:50:50,119 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:50,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 170 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 09:50:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-03 09:50:50,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 459. [2025-03-03 09:50:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.556768558951965) internal successors, (713), 458 states have internal predecessors, (713), 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-03-03 09:50:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 713 transitions. [2025-03-03 09:50:50,179 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 713 transitions. Word has length 199 [2025-03-03 09:50:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:50,179 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 713 transitions. [2025-03-03 09:50:50,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 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-03-03 09:50:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 713 transitions. [2025-03-03 09:50:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 09:50:50,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:50,182 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:50,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:50:50,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:50,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:50,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1577573568, now seen corresponding path program 1 times [2025-03-03 09:50:50,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:50,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385202460] [2025-03-03 09:50:50,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:50,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:50,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 09:50:50,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 09:50:50,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:50,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:50:50,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:50,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385202460] [2025-03-03 09:50:50,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385202460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:50,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:50,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:50:50,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252277136] [2025-03-03 09:50:50,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:50,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:50,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:50,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:50,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:50,352 INFO L87 Difference]: Start difference. First operand 459 states and 713 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:51,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:51,031 INFO L93 Difference]: Finished difference Result 1343 states and 2102 transitions. [2025-03-03 09:50:51,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:51,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2025-03-03 09:50:51,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:51,035 INFO L225 Difference]: With dead ends: 1343 [2025-03-03 09:50:51,035 INFO L226 Difference]: Without dead ends: 886 [2025-03-03 09:50:51,036 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-03-03 09:50:51,037 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:51,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 92 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:50:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-03 09:50:51,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 868. [2025-03-03 09:50:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 867 states have (on average 1.532871972318339) internal successors, (1329), 867 states have internal predecessors, (1329), 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-03-03 09:50:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1329 transitions. [2025-03-03 09:50:51,062 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1329 transitions. Word has length 207 [2025-03-03 09:50:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:51,062 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1329 transitions. [2025-03-03 09:50:51,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1329 transitions. [2025-03-03 09:50:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 09:50:51,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:51,069 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:51,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:50:51,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:51,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:51,070 INFO L85 PathProgramCache]: Analyzing trace with hash -36554944, now seen corresponding path program 1 times [2025-03-03 09:50:51,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:51,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945743782] [2025-03-03 09:50:51,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:51,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:51,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 09:50:51,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 09:50:51,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:51,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:50:51,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:51,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945743782] [2025-03-03 09:50:51,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945743782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:51,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:51,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:50:51,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321590914] [2025-03-03 09:50:51,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:51,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:51,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:51,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:51,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:51,248 INFO L87 Difference]: Start difference. First operand 868 states and 1329 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 2 states have internal predecessors, (212), 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-03-03 09:50:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:51,554 INFO L93 Difference]: Finished difference Result 1710 states and 2622 transitions. [2025-03-03 09:50:51,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:51,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 2 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2025-03-03 09:50:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:51,557 INFO L225 Difference]: With dead ends: 1710 [2025-03-03 09:50:51,558 INFO L226 Difference]: Without dead ends: 844 [2025-03-03 09:50:51,559 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-03-03 09:50:51,559 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 329 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:51,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:50:51,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2025-03-03 09:50:51,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 844. [2025-03-03 09:50:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 1.4768683274021353) internal successors, (1245), 843 states have internal predecessors, (1245), 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-03-03 09:50:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1245 transitions. [2025-03-03 09:50:51,573 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1245 transitions. Word has length 212 [2025-03-03 09:50:51,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:51,573 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1245 transitions. [2025-03-03 09:50:51,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 2 states have internal predecessors, (212), 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-03-03 09:50:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1245 transitions. [2025-03-03 09:50:51,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-03 09:50:51,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:51,575 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:51,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:50:51,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:51,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:51,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1508448308, now seen corresponding path program 1 times [2025-03-03 09:50:51,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:51,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33941410] [2025-03-03 09:50:51,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:51,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:51,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-03 09:50:51,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-03 09:50:51,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:51,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:50:51,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:51,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33941410] [2025-03-03 09:50:51,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33941410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:51,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:51,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:50:51,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262283655] [2025-03-03 09:50:51,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:51,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:51,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:51,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:51,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:51,771 INFO L87 Difference]: Start difference. First operand 844 states and 1245 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 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-03-03 09:50:52,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:52,386 INFO L93 Difference]: Finished difference Result 2498 states and 3690 transitions. [2025-03-03 09:50:52,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:52,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 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 213 [2025-03-03 09:50:52,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:52,391 INFO L225 Difference]: With dead ends: 2498 [2025-03-03 09:50:52,391 INFO L226 Difference]: Without dead ends: 1656 [2025-03-03 09:50:52,392 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-03-03 09:50:52,393 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 207 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:52,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 144 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:50:52,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2025-03-03 09:50:52,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2025-03-03 09:50:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1655 states have (on average 1.3063444108761328) internal successors, (2162), 1655 states have internal predecessors, (2162), 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-03-03 09:50:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2162 transitions. [2025-03-03 09:50:52,417 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2162 transitions. Word has length 213 [2025-03-03 09:50:52,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:52,417 INFO L471 AbstractCegarLoop]: Abstraction has 1656 states and 2162 transitions. [2025-03-03 09:50:52,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 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-03-03 09:50:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2162 transitions. [2025-03-03 09:50:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 09:50:52,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:52,420 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:50:52,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:50:52,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:52,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:52,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1737438151, now seen corresponding path program 1 times [2025-03-03 09:50:52,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:52,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782586527] [2025-03-03 09:50:52,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:52,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:52,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 09:50:52,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 09:50:52,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:52,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:50:52,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:52,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782586527] [2025-03-03 09:50:52,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782586527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:50:52,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174438178] [2025-03-03 09:50:52,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:52,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:50:52,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:50:52,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:50:52,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:50:52,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 09:50:52,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 09:50:52,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:52,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:52,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:50:52,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:50:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:50:52,894 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:50:52,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174438178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:52,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:50:52,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 09:50:52,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15881245] [2025-03-03 09:50:52,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:52,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:52,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:52,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:52,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:50:52,896 INFO L87 Difference]: Start difference. First operand 1656 states and 2162 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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-03-03 09:50:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:53,106 INFO L93 Difference]: Finished difference Result 4961 states and 6479 transitions. [2025-03-03 09:50:53,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:53,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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 219 [2025-03-03 09:50:53,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:53,115 INFO L225 Difference]: With dead ends: 4961 [2025-03-03 09:50:53,115 INFO L226 Difference]: Without dead ends: 3307 [2025-03-03 09:50:53,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:50:53,117 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 321 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:53,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 539 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:50:53,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3307 states. [2025-03-03 09:50:53,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3307 to 3303. [2025-03-03 09:50:53,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3303 states, 3302 states have (on average 1.3058752271350698) internal successors, (4312), 3302 states have internal predecessors, (4312), 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-03-03 09:50:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 4312 transitions. [2025-03-03 09:50:53,161 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 4312 transitions. Word has length 219 [2025-03-03 09:50:53,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:53,161 INFO L471 AbstractCegarLoop]: Abstraction has 3303 states and 4312 transitions. [2025-03-03 09:50:53,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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-03-03 09:50:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 4312 transitions. [2025-03-03 09:50:53,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 09:50:53,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:53,166 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:50:53,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:50:53,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:50:53,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:53,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:53,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1189247500, now seen corresponding path program 1 times [2025-03-03 09:50:53,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:53,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183361619] [2025-03-03 09:50:53,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:53,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:53,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 09:50:53,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 09:50:53,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:53,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:53,490 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:50:53,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:53,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183361619] [2025-03-03 09:50:53,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183361619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:53,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:53,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:50:53,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639739336] [2025-03-03 09:50:53,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:53,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:53,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:53,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:53,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:53,492 INFO L87 Difference]: Start difference. First operand 3303 states and 4312 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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-03-03 09:50:54,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:54,155 INFO L93 Difference]: Finished difference Result 9864 states and 12874 transitions. [2025-03-03 09:50:54,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:54,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228 [2025-03-03 09:50:54,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:54,174 INFO L225 Difference]: With dead ends: 9864 [2025-03-03 09:50:54,174 INFO L226 Difference]: Without dead ends: 6563 [2025-03-03 09:50:54,179 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-03-03 09:50:54,180 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 243 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:54,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 330 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:50:54,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6563 states. [2025-03-03 09:50:54,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6563 to 6560. [2025-03-03 09:50:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6560 states, 6559 states have (on average 1.2305229455709712) internal successors, (8071), 6559 states have internal predecessors, (8071), 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-03-03 09:50:54,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6560 states to 6560 states and 8071 transitions. [2025-03-03 09:50:54,331 INFO L78 Accepts]: Start accepts. Automaton has 6560 states and 8071 transitions. Word has length 228 [2025-03-03 09:50:54,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:54,332 INFO L471 AbstractCegarLoop]: Abstraction has 6560 states and 8071 transitions. [2025-03-03 09:50:54,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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-03-03 09:50:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 6560 states and 8071 transitions. [2025-03-03 09:50:54,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-03 09:50:54,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:54,345 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:54,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:50:54,345 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:54,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:54,345 INFO L85 PathProgramCache]: Analyzing trace with hash 510626709, now seen corresponding path program 1 times [2025-03-03 09:50:54,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:54,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727793346] [2025-03-03 09:50:54,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:54,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:54,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-03 09:50:54,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-03 09:50:54,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:54,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:50:54,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:54,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727793346] [2025-03-03 09:50:54,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727793346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:54,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:54,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:50:54,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363946451] [2025-03-03 09:50:54,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:54,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:54,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:54,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:54,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:54,551 INFO L87 Difference]: Start difference. First operand 6560 states and 8071 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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-03-03 09:50:55,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:55,211 INFO L93 Difference]: Finished difference Result 16371 states and 20587 transitions. [2025-03-03 09:50:55,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:55,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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 240 [2025-03-03 09:50:55,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:55,239 INFO L225 Difference]: With dead ends: 16371 [2025-03-03 09:50:55,239 INFO L226 Difference]: Without dead ends: 9813 [2025-03-03 09:50:55,247 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-03-03 09:50:55,248 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 193 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:55,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 370 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:50:55,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9813 states. [2025-03-03 09:50:55,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9813 to 9808. [2025-03-03 09:50:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9808 states, 9807 states have (on average 1.1870092790863669) internal successors, (11641), 9807 states have internal predecessors, (11641), 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-03-03 09:50:55,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9808 states to 9808 states and 11641 transitions. [2025-03-03 09:50:55,418 INFO L78 Accepts]: Start accepts. Automaton has 9808 states and 11641 transitions. Word has length 240 [2025-03-03 09:50:55,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:55,418 INFO L471 AbstractCegarLoop]: Abstraction has 9808 states and 11641 transitions. [2025-03-03 09:50:55,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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-03-03 09:50:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 9808 states and 11641 transitions. [2025-03-03 09:50:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-03 09:50:55,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:55,431 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:55,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 09:50:55,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:55,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1541672456, now seen corresponding path program 1 times [2025-03-03 09:50:55,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:55,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518907777] [2025-03-03 09:50:55,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:55,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:55,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-03 09:50:55,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-03 09:50:55,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:55,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 73 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 09:50:56,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:56,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518907777] [2025-03-03 09:50:56,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518907777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:50:56,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516599449] [2025-03-03 09:50:56,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:56,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:50:56,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:50:56,219 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:50:56,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:50:56,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-03 09:50:56,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-03 09:50:56,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:56,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:56,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:50:56,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:50:56,414 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:50:56,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:50:56,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516599449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:56,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:50:56,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 09:50:56,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632264565] [2025-03-03 09:50:56,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:56,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:56,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:56,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:56,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:50:56,418 INFO L87 Difference]: Start difference. First operand 9808 states and 11641 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-03-03 09:50:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:57,125 INFO L93 Difference]: Finished difference Result 28551 states and 33825 transitions. [2025-03-03 09:50:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:57,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 267 [2025-03-03 09:50:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:57,164 INFO L225 Difference]: With dead ends: 28551 [2025-03-03 09:50:57,164 INFO L226 Difference]: Without dead ends: 18745 [2025-03-03 09:50:57,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:50:57,175 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 209 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:57,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 335 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:50:57,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18745 states. [2025-03-03 09:50:57,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18745 to 17522. [2025-03-03 09:50:57,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17522 states, 17521 states have (on average 1.1506763312596313) internal successors, (20161), 17521 states have internal predecessors, (20161), 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-03-03 09:50:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17522 states to 17522 states and 20161 transitions. [2025-03-03 09:50:57,531 INFO L78 Accepts]: Start accepts. Automaton has 17522 states and 20161 transitions. Word has length 267 [2025-03-03 09:50:57,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:57,531 INFO L471 AbstractCegarLoop]: Abstraction has 17522 states and 20161 transitions. [2025-03-03 09:50:57,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-03-03 09:50:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 17522 states and 20161 transitions. [2025-03-03 09:50:57,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-03 09:50:57,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:57,558 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:57,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:50:57,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 09:50:57,758 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:57,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:57,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1723957437, now seen corresponding path program 1 times [2025-03-03 09:50:57,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:57,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756427604] [2025-03-03 09:50:57,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:57,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:57,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-03 09:50:57,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-03 09:50:57,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:57,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:50:57,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:57,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756427604] [2025-03-03 09:50:57,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756427604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:57,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:57,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:50:57,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376839790] [2025-03-03 09:50:57,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:57,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:50:57,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:57,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:50:57,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:50:57,951 INFO L87 Difference]: Start difference. First operand 17522 states and 20161 transitions. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 2 states have internal predecessors, (277), 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-03-03 09:50:58,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:58,615 INFO L93 Difference]: Finished difference Result 35047 states and 40329 transitions. [2025-03-03 09:50:58,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:50:58,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 2 states have internal predecessors, (277), 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 277 [2025-03-03 09:50:58,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:58,641 INFO L225 Difference]: With dead ends: 35047 [2025-03-03 09:50:58,642 INFO L226 Difference]: Without dead ends: 17527 [2025-03-03 09:50:58,650 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-03-03 09:50:58,650 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 163 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:58,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 123 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:50:58,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17527 states. [2025-03-03 09:50:58,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17527 to 17522. [2025-03-03 09:50:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17522 states, 17521 states have (on average 1.128417327778095) internal successors, (19771), 17521 states have internal predecessors, (19771), 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-03-03 09:50:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17522 states to 17522 states and 19771 transitions. [2025-03-03 09:50:58,849 INFO L78 Accepts]: Start accepts. Automaton has 17522 states and 19771 transitions. Word has length 277 [2025-03-03 09:50:58,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:58,849 INFO L471 AbstractCegarLoop]: Abstraction has 17522 states and 19771 transitions. [2025-03-03 09:50:58,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 2 states have internal predecessors, (277), 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-03-03 09:50:58,849 INFO L276 IsEmpty]: Start isEmpty. Operand 17522 states and 19771 transitions. [2025-03-03 09:50:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-03 09:50:58,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:58,871 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:50:58,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:50:58,871 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:58,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:58,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1500549575, now seen corresponding path program 1 times [2025-03-03 09:50:58,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:58,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103177110] [2025-03-03 09:50:58,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:58,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:50:58,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-03 09:50:58,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-03 09:50:58,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:50:58,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:50:59,068 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-03 09:50:59,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:50:59,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103177110] [2025-03-03 09:50:59,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103177110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:50:59,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:50:59,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:50:59,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529236110] [2025-03-03 09:50:59,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:50:59,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:50:59,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:50:59,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:50:59,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:50:59,070 INFO L87 Difference]: Start difference. First operand 17522 states and 19771 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:59,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:50:59,721 INFO L93 Difference]: Finished difference Result 35041 states and 39539 transitions. [2025-03-03 09:50:59,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:50:59,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 298 [2025-03-03 09:50:59,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:50:59,743 INFO L225 Difference]: With dead ends: 35041 [2025-03-03 09:50:59,743 INFO L226 Difference]: Without dead ends: 17521 [2025-03-03 09:50:59,757 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-03-03 09:50:59,757 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 491 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:50:59,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 57 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:50:59,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17521 states. [2025-03-03 09:50:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17521 to 17521. [2025-03-03 09:50:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17521 states, 17520 states have (on average 1.1188356164383562) internal successors, (19602), 17520 states have internal predecessors, (19602), 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-03-03 09:50:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17521 states to 17521 states and 19602 transitions. [2025-03-03 09:50:59,951 INFO L78 Accepts]: Start accepts. Automaton has 17521 states and 19602 transitions. Word has length 298 [2025-03-03 09:50:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:50:59,951 INFO L471 AbstractCegarLoop]: Abstraction has 17521 states and 19602 transitions. [2025-03-03 09:50:59,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:50:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 17521 states and 19602 transitions. [2025-03-03 09:50:59,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-03 09:50:59,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:50:59,974 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:50:59,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 09:50:59,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:50:59,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:50:59,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1440177388, now seen corresponding path program 1 times [2025-03-03 09:50:59,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:50:59,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363754801] [2025-03-03 09:50:59,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:50:59,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:00,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-03 09:51:00,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-03 09:51:00,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:00,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:00,189 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-03 09:51:00,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:00,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363754801] [2025-03-03 09:51:00,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363754801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:00,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:00,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:51:00,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156691663] [2025-03-03 09:51:00,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:00,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:51:00,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:00,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:51:00,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:51:00,190 INFO L87 Difference]: Start difference. First operand 17521 states and 19602 transitions. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 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-03-03 09:51:01,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:01,286 INFO L93 Difference]: Finished difference Result 67618 states and 75764 transitions. [2025-03-03 09:51:01,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:51:01,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 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 300 [2025-03-03 09:51:01,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:01,354 INFO L225 Difference]: With dead ends: 67618 [2025-03-03 09:51:01,354 INFO L226 Difference]: Without dead ends: 50099 [2025-03-03 09:51:01,374 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-03-03 09:51:01,374 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 554 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:01,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 83 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 09:51:01,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50099 states. [2025-03-03 09:51:01,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50099 to 50089. [2025-03-03 09:51:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50089 states, 50088 states have (on average 1.1185114199009742) internal successors, (56024), 50088 states have internal predecessors, (56024), 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-03-03 09:51:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50089 states to 50089 states and 56024 transitions. [2025-03-03 09:51:02,050 INFO L78 Accepts]: Start accepts. Automaton has 50089 states and 56024 transitions. Word has length 300 [2025-03-03 09:51:02,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:02,050 INFO L471 AbstractCegarLoop]: Abstraction has 50089 states and 56024 transitions. [2025-03-03 09:51:02,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 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-03-03 09:51:02,050 INFO L276 IsEmpty]: Start isEmpty. Operand 50089 states and 56024 transitions. [2025-03-03 09:51:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-03 09:51:02,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:02,073 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:51:02,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 09:51:02,073 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:02,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:02,074 INFO L85 PathProgramCache]: Analyzing trace with hash 854698177, now seen corresponding path program 1 times [2025-03-03 09:51:02,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:02,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326525851] [2025-03-03 09:51:02,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:02,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:02,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-03 09:51:02,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-03 09:51:02,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:02,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:02,273 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-03 09:51:02,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:02,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326525851] [2025-03-03 09:51:02,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326525851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:02,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:02,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:51:02,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406976824] [2025-03-03 09:51:02,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:02,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:02,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:02,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:02,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:02,275 INFO L87 Difference]: Start difference. First operand 50089 states and 56024 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 2 states have internal predecessors, (229), 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-03-03 09:51:03,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:03,237 INFO L93 Difference]: Finished difference Result 127464 states and 142373 transitions. [2025-03-03 09:51:03,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:03,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 2 states have internal predecessors, (229), 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 311 [2025-03-03 09:51:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:03,349 INFO L225 Difference]: With dead ends: 127464 [2025-03-03 09:51:03,350 INFO L226 Difference]: Without dead ends: 77377 [2025-03-03 09:51:03,374 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-03-03 09:51:03,374 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 204 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:03,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 87 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:51:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77377 states. [2025-03-03 09:51:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77377 to 77371. [2025-03-03 09:51:04,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77371 states, 77370 states have (on average 1.1148507173322992) internal successors, (86256), 77370 states have internal predecessors, (86256), 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-03-03 09:51:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77371 states to 77371 states and 86256 transitions. [2025-03-03 09:51:04,227 INFO L78 Accepts]: Start accepts. Automaton has 77371 states and 86256 transitions. Word has length 311 [2025-03-03 09:51:04,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:04,227 INFO L471 AbstractCegarLoop]: Abstraction has 77371 states and 86256 transitions. [2025-03-03 09:51:04,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 2 states have internal predecessors, (229), 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-03-03 09:51:04,228 INFO L276 IsEmpty]: Start isEmpty. Operand 77371 states and 86256 transitions. [2025-03-03 09:51:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-03-03 09:51:04,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:04,249 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:51:04,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 09:51:04,249 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:04,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:04,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1980155556, now seen corresponding path program 1 times [2025-03-03 09:51:04,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:04,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055229970] [2025-03-03 09:51:04,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:04,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:04,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-03 09:51:04,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-03 09:51:04,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:04,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:04,625 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-03 09:51:04,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:04,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055229970] [2025-03-03 09:51:04,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055229970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:51:04,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413887019] [2025-03-03 09:51:04,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:04,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:04,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:51:04,628 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:51:04,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:51:04,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-03 09:51:04,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-03 09:51:04,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:04,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:04,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:51:04,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:51:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:51:04,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:51:04,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413887019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:04,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:51:04,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:51:04,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148979633] [2025-03-03 09:51:04,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:04,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:04,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:04,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:04,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:51:04,843 INFO L87 Difference]: Start difference. First operand 77371 states and 86256 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-03-03 09:51:05,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:05,592 INFO L93 Difference]: Finished difference Result 149057 states and 166293 transitions. [2025-03-03 09:51:05,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:05,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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 318 [2025-03-03 09:51:05,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:05,688 INFO L225 Difference]: With dead ends: 149057 [2025-03-03 09:51:05,688 INFO L226 Difference]: Without dead ends: 71688 [2025-03-03 09:51:05,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:51:05,744 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 178 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:05,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 346 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:51:05,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71688 states. [2025-03-03 09:51:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71688 to 71652. [2025-03-03 09:51:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71652 states, 71651 states have (on average 1.0987285592664442) internal successors, (78725), 71651 states have internal predecessors, (78725), 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-03-03 09:51:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71652 states to 71652 states and 78725 transitions. [2025-03-03 09:51:07,013 INFO L78 Accepts]: Start accepts. Automaton has 71652 states and 78725 transitions. Word has length 318 [2025-03-03 09:51:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:07,013 INFO L471 AbstractCegarLoop]: Abstraction has 71652 states and 78725 transitions. [2025-03-03 09:51:07,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-03-03 09:51:07,013 INFO L276 IsEmpty]: Start isEmpty. Operand 71652 states and 78725 transitions. [2025-03-03 09:51:07,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-03 09:51:07,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:07,033 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:51:07,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 09:51:07,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:07,234 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:07,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:07,235 INFO L85 PathProgramCache]: Analyzing trace with hash 614329478, now seen corresponding path program 1 times [2025-03-03 09:51:07,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:07,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717645102] [2025-03-03 09:51:07,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:07,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:07,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-03 09:51:07,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-03 09:51:07,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:07,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 09:51:07,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:07,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717645102] [2025-03-03 09:51:07,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717645102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:07,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:07,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:51:07,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975083188] [2025-03-03 09:51:07,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:07,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:07,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:07,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:07,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:07,441 INFO L87 Difference]: Start difference. First operand 71652 states and 78725 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-03-03 09:51:08,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:08,289 INFO L93 Difference]: Finished difference Result 149838 states and 164630 transitions. [2025-03-03 09:51:08,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:08,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-03-03 09:51:08,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:08,378 INFO L225 Difference]: With dead ends: 149838 [2025-03-03 09:51:08,378 INFO L226 Difference]: Without dead ends: 78188 [2025-03-03 09:51:08,421 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-03-03 09:51:08,421 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 141 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:08,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 351 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:51:08,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78188 states. [2025-03-03 09:51:09,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78188 to 78158. [2025-03-03 09:51:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78158 states, 78157 states have (on average 1.0935808692759446) internal successors, (85471), 78157 states have internal predecessors, (85471), 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-03-03 09:51:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78158 states to 78158 states and 85471 transitions. [2025-03-03 09:51:09,256 INFO L78 Accepts]: Start accepts. Automaton has 78158 states and 85471 transitions. Word has length 322 [2025-03-03 09:51:09,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:09,256 INFO L471 AbstractCegarLoop]: Abstraction has 78158 states and 85471 transitions. [2025-03-03 09:51:09,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-03-03 09:51:09,256 INFO L276 IsEmpty]: Start isEmpty. Operand 78158 states and 85471 transitions. [2025-03-03 09:51:09,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-03-03 09:51:09,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:09,277 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:51:09,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 09:51:09,277 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:09,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:09,278 INFO L85 PathProgramCache]: Analyzing trace with hash -671070075, now seen corresponding path program 1 times [2025-03-03 09:51:09,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:09,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359250243] [2025-03-03 09:51:09,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:09,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:09,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-03 09:51:09,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-03 09:51:09,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:09,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-03-03 09:51:09,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:09,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359250243] [2025-03-03 09:51:09,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359250243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:09,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:09,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:51:09,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417805675] [2025-03-03 09:51:09,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:09,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:09,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:09,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:09,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:09,579 INFO L87 Difference]: Start difference. First operand 78158 states and 85471 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:10,390 INFO L93 Difference]: Finished difference Result 156311 states and 170937 transitions. [2025-03-03 09:51:10,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:10,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2025-03-03 09:51:10,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:10,493 INFO L225 Difference]: With dead ends: 156311 [2025-03-03 09:51:10,493 INFO L226 Difference]: Without dead ends: 78155 [2025-03-03 09:51:10,545 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-03-03 09:51:10,546 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 222 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:10,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 96 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:51:10,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78155 states. [2025-03-03 09:51:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78155 to 78155. [2025-03-03 09:51:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78155 states, 78154 states have (on average 1.0827084986053177) internal successors, (84618), 78154 states have internal predecessors, (84618), 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-03-03 09:51:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78155 states to 78155 states and 84618 transitions. [2025-03-03 09:51:11,534 INFO L78 Accepts]: Start accepts. Automaton has 78155 states and 84618 transitions. Word has length 337 [2025-03-03 09:51:11,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:11,534 INFO L471 AbstractCegarLoop]: Abstraction has 78155 states and 84618 transitions. [2025-03-03 09:51:11,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 78155 states and 84618 transitions. [2025-03-03 09:51:11,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-03-03 09:51:11,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:11,563 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:51:11,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 09:51:11,564 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:11,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:11,564 INFO L85 PathProgramCache]: Analyzing trace with hash -438315738, now seen corresponding path program 1 times [2025-03-03 09:51:11,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:11,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233785855] [2025-03-03 09:51:11,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:11,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:11,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-03-03 09:51:11,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-03-03 09:51:11,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:11,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-03 09:51:11,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:11,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233785855] [2025-03-03 09:51:11,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233785855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:11,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:11,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:51:11,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290995123] [2025-03-03 09:51:11,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:11,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:11,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:11,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:11,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:11,798 INFO L87 Difference]: Start difference. First operand 78155 states and 84618 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 2 states have internal predecessors, (276), 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-03-03 09:51:13,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:13,024 INFO L93 Difference]: Finished difference Result 202328 states and 218874 transitions. [2025-03-03 09:51:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:13,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 2 states have internal predecessors, (276), 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 398 [2025-03-03 09:51:13,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:13,169 INFO L225 Difference]: With dead ends: 202328 [2025-03-03 09:51:13,169 INFO L226 Difference]: Without dead ends: 124175 [2025-03-03 09:51:13,220 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-03-03 09:51:13,221 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 157 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:13,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 142 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:51:13,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124175 states. [2025-03-03 09:51:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124175 to 122945. [2025-03-03 09:51:14,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122945 states, 122944 states have (on average 1.0814029151483602) internal successors, (132952), 122944 states have internal predecessors, (132952), 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-03-03 09:51:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122945 states to 122945 states and 132952 transitions. [2025-03-03 09:51:14,920 INFO L78 Accepts]: Start accepts. Automaton has 122945 states and 132952 transitions. Word has length 398 [2025-03-03 09:51:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:14,920 INFO L471 AbstractCegarLoop]: Abstraction has 122945 states and 132952 transitions. [2025-03-03 09:51:14,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 2 states have internal predecessors, (276), 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-03-03 09:51:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 122945 states and 132952 transitions. [2025-03-03 09:51:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2025-03-03 09:51:14,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:14,973 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:51:14,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 09:51:14,974 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:14,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:14,974 INFO L85 PathProgramCache]: Analyzing trace with hash 431912960, now seen corresponding path program 1 times [2025-03-03 09:51:14,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:14,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571609262] [2025-03-03 09:51:14,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:14,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:15,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-03-03 09:51:15,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-03-03 09:51:15,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:15,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-03 09:51:15,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:15,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571609262] [2025-03-03 09:51:15,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571609262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:15,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:15,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:51:15,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113577473] [2025-03-03 09:51:15,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:15,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:15,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:15,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:15,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:15,422 INFO L87 Difference]: Start difference. First operand 122945 states and 132952 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 2 states have internal predecessors, (327), 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-03-03 09:51:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:16,348 INFO L93 Difference]: Finished difference Result 316523 states and 341674 transitions. [2025-03-03 09:51:16,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:16,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 2 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 400 [2025-03-03 09:51:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:16,592 INFO L225 Difference]: With dead ends: 316523 [2025-03-03 09:51:16,592 INFO L226 Difference]: Without dead ends: 193580 [2025-03-03 09:51:16,669 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-03-03 09:51:16,669 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 203 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:16,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 437 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:51:16,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193580 states. [2025-03-03 09:51:18,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193580 to 122945. [2025-03-03 09:51:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122945 states, 122944 states have (on average 1.0807359448204061) internal successors, (132870), 122944 states have internal predecessors, (132870), 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-03-03 09:51:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122945 states to 122945 states and 132870 transitions. [2025-03-03 09:51:19,054 INFO L78 Accepts]: Start accepts. Automaton has 122945 states and 132870 transitions. Word has length 400 [2025-03-03 09:51:19,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:19,054 INFO L471 AbstractCegarLoop]: Abstraction has 122945 states and 132870 transitions. [2025-03-03 09:51:19,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 2 states have internal predecessors, (327), 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-03-03 09:51:19,054 INFO L276 IsEmpty]: Start isEmpty. Operand 122945 states and 132870 transitions. [2025-03-03 09:51:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-03 09:51:19,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:19,098 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:51:19,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 09:51:19,098 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:19,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:19,099 INFO L85 PathProgramCache]: Analyzing trace with hash 419241515, now seen corresponding path program 1 times [2025-03-03 09:51:19,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:19,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908960248] [2025-03-03 09:51:19,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:19,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:19,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-03 09:51:19,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-03 09:51:19,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:19,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 217 proven. 6 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-03 09:51:20,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:20,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908960248] [2025-03-03 09:51:20,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908960248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:51:20,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838300619] [2025-03-03 09:51:20,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:20,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:20,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:51:20,278 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:51:20,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:51:20,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-03 09:51:20,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-03 09:51:20,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:20,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:20,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:51:20,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:51:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2025-03-03 09:51:20,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:51:20,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838300619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:20,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:51:20,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-03 09:51:20,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277823305] [2025-03-03 09:51:20,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:20,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:20,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:20,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:20,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:51:20,574 INFO L87 Difference]: Start difference. First operand 122945 states and 132870 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 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-03-03 09:51:21,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:21,736 INFO L93 Difference]: Finished difference Result 290648 states and 314167 transitions. [2025-03-03 09:51:21,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:21,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 405 [2025-03-03 09:51:21,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:21,915 INFO L225 Difference]: With dead ends: 290648 [2025-03-03 09:51:21,915 INFO L226 Difference]: Without dead ends: 167705 [2025-03-03 09:51:21,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:51:21,976 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 151 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:21,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 160 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:51:22,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167705 states. [2025-03-03 09:51:23,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167705 to 136749. [2025-03-03 09:51:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136749 states, 136748 states have (on average 1.0817708485681692) internal successors, (147930), 136748 states have internal predecessors, (147930), 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-03-03 09:51:23,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136749 states to 136749 states and 147930 transitions. [2025-03-03 09:51:23,923 INFO L78 Accepts]: Start accepts. Automaton has 136749 states and 147930 transitions. Word has length 405 [2025-03-03 09:51:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:23,924 INFO L471 AbstractCegarLoop]: Abstraction has 136749 states and 147930 transitions. [2025-03-03 09:51:23,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 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-03-03 09:51:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 136749 states and 147930 transitions. [2025-03-03 09:51:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-03 09:51:24,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:24,003 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 09:51:24,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 09:51:24,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 09:51:24,204 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:24,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash 316863091, now seen corresponding path program 1 times [2025-03-03 09:51:24,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:24,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639472658] [2025-03-03 09:51:24,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:24,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:24,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-03 09:51:24,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-03 09:51:24,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:24,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 286 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:51:24,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:24,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639472658] [2025-03-03 09:51:24,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639472658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:51:24,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796479856] [2025-03-03 09:51:24,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:24,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:24,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:51:24,912 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:51:24,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:51:25,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-03 09:51:25,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-03 09:51:25,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:25,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:25,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:51:25,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:51:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2025-03-03 09:51:25,483 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:51:25,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796479856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:25,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:51:25,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 09:51:25,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41494914] [2025-03-03 09:51:25,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:25,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:25,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:25,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:25,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:51:25,485 INFO L87 Difference]: Start difference. First operand 136749 states and 147930 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-03-03 09:51:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:26,599 INFO L93 Difference]: Finished difference Result 270702 states and 292911 transitions. [2025-03-03 09:51:26,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:26,599 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 456 [2025-03-03 09:51:26,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:26,765 INFO L225 Difference]: With dead ends: 270702 [2025-03-03 09:51:26,765 INFO L226 Difference]: Without dead ends: 133955 [2025-03-03 09:51:26,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 455 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:51:26,857 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 61 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:26,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 287 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:51:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133955 states. [2025-03-03 09:51:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133955 to 129035. [2025-03-03 09:51:28,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129035 states, 129034 states have (on average 1.077870948742192) internal successors, (139082), 129034 states have internal predecessors, (139082), 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-03-03 09:51:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129035 states to 129035 states and 139082 transitions. [2025-03-03 09:51:29,090 INFO L78 Accepts]: Start accepts. Automaton has 129035 states and 139082 transitions. Word has length 456 [2025-03-03 09:51:29,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:29,090 INFO L471 AbstractCegarLoop]: Abstraction has 129035 states and 139082 transitions. [2025-03-03 09:51:29,090 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-03-03 09:51:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 129035 states and 139082 transitions. [2025-03-03 09:51:29,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-03 09:51:29,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:29,178 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:51:29,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 09:51:29,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:29,379 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:29,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:29,380 INFO L85 PathProgramCache]: Analyzing trace with hash -930344649, now seen corresponding path program 1 times [2025-03-03 09:51:29,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:29,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236866244] [2025-03-03 09:51:29,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:29,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:29,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-03 09:51:29,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-03 09:51:29,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:29,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 490 proven. 124 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-03 09:51:29,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:29,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236866244] [2025-03-03 09:51:29,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236866244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:51:29,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570907171] [2025-03-03 09:51:29,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:29,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:29,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:51:29,939 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:51:29,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:51:30,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-03 09:51:30,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-03 09:51:30,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:30,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:30,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 09:51:30,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:51:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 418 proven. 174 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-03-03 09:51:30,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:51:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 418 proven. 174 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-03-03 09:51:30,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570907171] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:51:30,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:51:30,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-03 09:51:30,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314132779] [2025-03-03 09:51:30,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:51:30,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:51:30,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:30,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:51:30,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:51:30,728 INFO L87 Difference]: Start difference. First operand 129035 states and 139082 transitions. Second operand has 9 states, 9 states have (on average 88.77777777777777) internal successors, (799), 8 states have internal predecessors, (799), 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-03-03 09:51:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:39,185 INFO L93 Difference]: Finished difference Result 1095536 states and 1185481 transitions. [2025-03-03 09:51:39,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 09:51:39,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 88.77777777777777) internal successors, (799), 8 states have internal predecessors, (799), 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 529 [2025-03-03 09:51:39,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted.