./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label29.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1d19cb304638f43d39081097001c07d13a3f7b236de84abf3505fba1ece23c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:04:01,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:04:01,149 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:04:01,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:04:01,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:04:01,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:04:01,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:04:01,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:04:01,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:04:01,179 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:04:01,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:04:01,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:04:01,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:04:01,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:04:01,180 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:04:01,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:04:01,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:04:01,180 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:04:01,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:04:01,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:04:01,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:04:01,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:04:01,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:04:01,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:04:01,180 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:04:01,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:04:01,180 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:04:01,180 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:04:01,180 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:04:01,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:04:01,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:04:01,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:04:01,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:04:01,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:04:01,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:04:01,181 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:04:01,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:04:01,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:04:01,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:04:01,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:04:01,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:04:01,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:04:01,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:04:01,181 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1d19cb304638f43d39081097001c07d13a3f7b236de84abf3505fba1ece23c0 [2025-02-05 12:04:01,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:04:01,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:04:01,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:04:01,424 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:04:01,424 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:04:01,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label29.c [2025-02-05 12:04:02,808 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd20712c1/7d1a66313f3b47bcb4ed919517d7df79/FLAGf9e862e35 [2025-02-05 12:04:03,312 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:04:03,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label29.c [2025-02-05 12:04:03,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd20712c1/7d1a66313f3b47bcb4ed919517d7df79/FLAGf9e862e35 [2025-02-05 12:04:03,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd20712c1/7d1a66313f3b47bcb4ed919517d7df79 [2025-02-05 12:04:03,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:04:03,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:04:03,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:04:03,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:04:03,369 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:04:03,370 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:04:03" (1/1) ... [2025-02-05 12:04:03,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba0f2fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:03, skipping insertion in model container [2025-02-05 12:04:03,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:04:03" (1/1) ... [2025-02-05 12:04:03,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:04:03,596 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label29.c[9671,9684] [2025-02-05 12:04:03,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:04:03,911 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:04:03,928 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label29.c[9671,9684] [2025-02-05 12:04:04,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:04:04,108 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:04:04,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:04 WrapperNode [2025-02-05 12:04:04,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:04:04,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:04:04,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:04:04,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:04:04,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:04" (1/1) ... [2025-02-05 12:04:04,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:04" (1/1) ... [2025-02-05 12:04:04,323 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-02-05 12:04:04,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:04:04,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:04:04,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:04:04,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:04:04,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:04" (1/1) ... [2025-02-05 12:04:04,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:04" (1/1) ... [2025-02-05 12:04:04,379 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:04" (1/1) ... [2025-02-05 12:04:04,545 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 12:04:04,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:04" (1/1) ... [2025-02-05 12:04:04,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:04" (1/1) ... [2025-02-05 12:04:04,614 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:04" (1/1) ... [2025-02-05 12:04:04,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:04" (1/1) ... [2025-02-05 12:04:04,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:04" (1/1) ... [2025-02-05 12:04:04,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:04" (1/1) ... [2025-02-05 12:04:04,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:04:04,688 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:04:04,688 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:04:04,688 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:04:04,688 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:04" (1/1) ... [2025-02-05 12:04:04,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:04:04,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:04:04,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 12:04:04,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 12:04:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:04:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:04:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:04:04,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:04:04,774 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:04:04,776 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:04:07,508 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-02-05 12:04:07,600 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-02-05 12:04:07,600 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:04:07,615 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:04:07,615 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:04:07,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:04:07 BoogieIcfgContainer [2025-02-05 12:04:07,616 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:04:07,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:04:07,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:04:07,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:04:07,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:04:03" (1/3) ... [2025-02-05 12:04:07,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16534f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:04:07, skipping insertion in model container [2025-02-05 12:04:07,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:04" (2/3) ... [2025-02-05 12:04:07,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16534f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:04:07, skipping insertion in model container [2025-02-05 12:04:07,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:04:07" (3/3) ... [2025-02-05 12:04:07,623 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label29.c [2025-02-05 12:04:07,635 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:04:07,636 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label29.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:04:07,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:04:07,704 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;@6a29728b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:04:07,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:04:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:04:07,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 12:04:07,714 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:07,714 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] [2025-02-05 12:04:07,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:07,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:07,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1271256213, now seen corresponding path program 1 times [2025-02-05 12:04:07,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:07,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928373285] [2025-02-05 12:04:07,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:07,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:07,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 12:04:07,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 12:04:07,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:07,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:04:08,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:08,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928373285] [2025-02-05 12:04:08,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928373285] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:08,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:08,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:04:08,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911609446] [2025-02-05 12:04:08,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:08,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:08,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:08,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:08,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:08,064 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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-02-05 12:04:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:10,326 INFO L93 Difference]: Finished difference Result 1667 states and 3058 transitions. [2025-02-05 12:04:10,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:10,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-02-05 12:04:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:10,340 INFO L225 Difference]: With dead ends: 1667 [2025-02-05 12:04:10,340 INFO L226 Difference]: Without dead ends: 998 [2025-02-05 12:04:10,344 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-02-05 12:04:10,346 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 480 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:10,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 276 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 12:04:10,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-02-05 12:04:10,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2025-02-05 12:04:10,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 0 states have call successors, (0), 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-02-05 12:04:10,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2025-02-05 12:04:10,406 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 65 [2025-02-05 12:04:10,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:10,406 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2025-02-05 12:04:10,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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-02-05 12:04:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2025-02-05 12:04:10,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 12:04:10,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:10,410 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:10,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:04:10,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:10,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:10,411 INFO L85 PathProgramCache]: Analyzing trace with hash 761284175, now seen corresponding path program 1 times [2025-02-05 12:04:10,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:10,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071461225] [2025-02-05 12:04:10,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:10,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:10,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 12:04:10,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 12:04:10,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:10,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:04:10,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:10,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071461225] [2025-02-05 12:04:10,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071461225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:10,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:10,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:04:10,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370008339] [2025-02-05 12:04:10,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:10,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:10,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:10,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:10,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:10,635 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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-02-05 12:04:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:12,770 INFO L93 Difference]: Finished difference Result 2824 states and 4847 transitions. [2025-02-05 12:04:12,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:12,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-02-05 12:04:12,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:12,777 INFO L225 Difference]: With dead ends: 2824 [2025-02-05 12:04:12,777 INFO L226 Difference]: Without dead ends: 1844 [2025-02-05 12:04:12,779 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-02-05 12:04:12,780 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 393 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:12,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:04:12,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-02-05 12:04:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1844. [2025-02-05 12:04:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1843 states have (on average 1.3836136733586544) internal successors, (2550), 1843 states have internal predecessors, (2550), 0 states have call successors, (0), 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-02-05 12:04:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2550 transitions. [2025-02-05 12:04:12,814 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2550 transitions. Word has length 130 [2025-02-05 12:04:12,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:12,815 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 2550 transitions. [2025-02-05 12:04:12,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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-02-05 12:04:12,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2550 transitions. [2025-02-05 12:04:12,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-02-05 12:04:12,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:12,827 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:12,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:04:12,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:12,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:12,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1544643802, now seen corresponding path program 1 times [2025-02-05 12:04:12,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:12,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034287365] [2025-02-05 12:04:12,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:12,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:12,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-05 12:04:12,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-05 12:04:12,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:12,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:04:13,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:13,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034287365] [2025-02-05 12:04:13,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034287365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:13,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:13,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:13,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314370801] [2025-02-05 12:04:13,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:13,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:13,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:13,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:13,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:13,203 INFO L87 Difference]: Start difference. First operand 1844 states and 2550 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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-02-05 12:04:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:15,511 INFO L93 Difference]: Finished difference Result 4546 states and 6595 transitions. [2025-02-05 12:04:15,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:15,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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-02-05 12:04:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:15,519 INFO L225 Difference]: With dead ends: 4546 [2025-02-05 12:04:15,519 INFO L226 Difference]: Without dead ends: 2704 [2025-02-05 12:04:15,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:15,522 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 500 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:15,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 817 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 12:04:15,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-02-05 12:04:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2025-02-05 12:04:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2703 states have (on average 1.38771735109138) internal successors, (3751), 2703 states have internal predecessors, (3751), 0 states have call successors, (0), 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-02-05 12:04:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3751 transitions. [2025-02-05 12:04:15,558 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3751 transitions. Word has length 213 [2025-02-05 12:04:15,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:15,559 INFO L471 AbstractCegarLoop]: Abstraction has 2704 states and 3751 transitions. [2025-02-05 12:04:15,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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-02-05 12:04:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3751 transitions. [2025-02-05 12:04:15,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 12:04:15,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:15,562 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:15,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:04:15,562 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:15,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:15,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1422824459, now seen corresponding path program 1 times [2025-02-05 12:04:15,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:15,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422413830] [2025-02-05 12:04:15,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:15,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:15,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 12:04:15,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 12:04:15,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:15,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 12:04:15,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:15,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422413830] [2025-02-05 12:04:15,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422413830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:15,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:15,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:15,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579712661] [2025-02-05 12:04:15,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:15,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:15,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:15,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:15,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:15,926 INFO L87 Difference]: Start difference. First operand 2704 states and 3751 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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-02-05 12:04:17,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:17,664 INFO L93 Difference]: Finished difference Result 7954 states and 11040 transitions. [2025-02-05 12:04:17,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:17,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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-02-05 12:04:17,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:17,679 INFO L225 Difference]: With dead ends: 7954 [2025-02-05 12:04:17,679 INFO L226 Difference]: Without dead ends: 5252 [2025-02-05 12:04:17,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:17,682 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 383 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:17,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 546 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:04:17,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5252 states. [2025-02-05 12:04:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5252 to 4826. [2025-02-05 12:04:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4826 states, 4825 states have (on average 1.2652849740932643) internal successors, (6105), 4825 states have internal predecessors, (6105), 0 states have call successors, (0), 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-02-05 12:04:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4826 states to 4826 states and 6105 transitions. [2025-02-05 12:04:17,745 INFO L78 Accepts]: Start accepts. Automaton has 4826 states and 6105 transitions. Word has length 219 [2025-02-05 12:04:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:17,746 INFO L471 AbstractCegarLoop]: Abstraction has 4826 states and 6105 transitions. [2025-02-05 12:04:17,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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-02-05 12:04:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 4826 states and 6105 transitions. [2025-02-05 12:04:17,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-05 12:04:17,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:17,748 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:17,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:04:17,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:17,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:17,749 INFO L85 PathProgramCache]: Analyzing trace with hash 843837659, now seen corresponding path program 1 times [2025-02-05 12:04:17,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:17,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140512429] [2025-02-05 12:04:17,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:17,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:17,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-05 12:04:17,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-05 12:04:17,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:17,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:17,924 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:04:17,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:17,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140512429] [2025-02-05 12:04:17,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140512429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:17,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:17,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:17,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697296530] [2025-02-05 12:04:17,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:17,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:17,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:17,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:17,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:17,925 INFO L87 Difference]: Start difference. First operand 4826 states and 6105 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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-02-05 12:04:19,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:19,805 INFO L93 Difference]: Finished difference Result 13486 states and 17137 transitions. [2025-02-05 12:04:19,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:19,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2025-02-05 12:04:19,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:19,834 INFO L225 Difference]: With dead ends: 13486 [2025-02-05 12:04:19,834 INFO L226 Difference]: Without dead ends: 7355 [2025-02-05 12:04:19,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:19,850 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 528 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:19,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 635 Invalid, 1821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:04:19,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7355 states. [2025-02-05 12:04:20,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7355 to 6499. [2025-02-05 12:04:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6499 states, 6498 states have (on average 1.1871345029239766) internal successors, (7714), 6498 states have internal predecessors, (7714), 0 states have call successors, (0), 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-02-05 12:04:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6499 states to 6499 states and 7714 transitions. [2025-02-05 12:04:20,095 INFO L78 Accepts]: Start accepts. Automaton has 6499 states and 7714 transitions. Word has length 232 [2025-02-05 12:04:20,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:20,096 INFO L471 AbstractCegarLoop]: Abstraction has 6499 states and 7714 transitions. [2025-02-05 12:04:20,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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-02-05 12:04:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 6499 states and 7714 transitions. [2025-02-05 12:04:20,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-02-05 12:04:20,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:20,100 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:04:20,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:04:20,100 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:20,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:20,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1810602733, now seen corresponding path program 1 times [2025-02-05 12:04:20,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:20,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313410568] [2025-02-05 12:04:20,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:20,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:20,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-02-05 12:04:20,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-02-05 12:04:20,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:20,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:04:20,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:20,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313410568] [2025-02-05 12:04:20,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313410568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:20,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:20,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:20,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048404812] [2025-02-05 12:04:20,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:20,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:20,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:20,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:20,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:20,310 INFO L87 Difference]: Start difference. First operand 6499 states and 7714 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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-02-05 12:04:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:22,100 INFO L93 Difference]: Finished difference Result 14278 states and 16920 transitions. [2025-02-05 12:04:22,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:22,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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 285 [2025-02-05 12:04:22,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:22,120 INFO L225 Difference]: With dead ends: 14278 [2025-02-05 12:04:22,120 INFO L226 Difference]: Without dead ends: 7781 [2025-02-05 12:04:22,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:22,133 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 371 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:22,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 812 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:04:22,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7781 states. [2025-02-05 12:04:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7781 to 7351. [2025-02-05 12:04:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7351 states, 7350 states have (on average 1.1794557823129252) internal successors, (8669), 7350 states have internal predecessors, (8669), 0 states have call successors, (0), 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-02-05 12:04:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7351 states to 7351 states and 8669 transitions. [2025-02-05 12:04:22,293 INFO L78 Accepts]: Start accepts. Automaton has 7351 states and 8669 transitions. Word has length 285 [2025-02-05 12:04:22,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:22,294 INFO L471 AbstractCegarLoop]: Abstraction has 7351 states and 8669 transitions. [2025-02-05 12:04:22,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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-02-05 12:04:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 7351 states and 8669 transitions. [2025-02-05 12:04:22,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-05 12:04:22,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:22,297 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:04:22,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:04:22,298 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:22,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:22,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2055558919, now seen corresponding path program 1 times [2025-02-05 12:04:22,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:22,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594587611] [2025-02-05 12:04:22,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:22,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:22,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-05 12:04:22,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-05 12:04:22,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:22,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:04:22,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:22,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594587611] [2025-02-05 12:04:22,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594587611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:22,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:22,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:22,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038004540] [2025-02-05 12:04:22,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:22,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:22,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:22,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:22,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:22,582 INFO L87 Difference]: Start difference. First operand 7351 states and 8669 transitions. Second operand has 3 states, 3 states have (on average 74.0) 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-02-05 12:04:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:23,993 INFO L93 Difference]: Finished difference Result 18527 states and 21831 transitions. [2025-02-05 12:04:23,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:23,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) 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 303 [2025-02-05 12:04:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:24,022 INFO L225 Difference]: With dead ends: 18527 [2025-02-05 12:04:24,023 INFO L226 Difference]: Without dead ends: 11178 [2025-02-05 12:04:24,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:24,032 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 401 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:24,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 336 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:04:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11178 states. [2025-02-05 12:04:24,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11178 to 9900. [2025-02-05 12:04:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9900 states, 9899 states have (on average 1.1641579957571473) internal successors, (11524), 9899 states have internal predecessors, (11524), 0 states have call successors, (0), 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-02-05 12:04:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9900 states to 9900 states and 11524 transitions. [2025-02-05 12:04:24,257 INFO L78 Accepts]: Start accepts. Automaton has 9900 states and 11524 transitions. Word has length 303 [2025-02-05 12:04:24,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:24,260 INFO L471 AbstractCegarLoop]: Abstraction has 9900 states and 11524 transitions. [2025-02-05 12:04:24,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) 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-02-05 12:04:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 9900 states and 11524 transitions. [2025-02-05 12:04:24,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-02-05 12:04:24,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:24,270 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:04:24,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:04:24,274 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:24,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:24,274 INFO L85 PathProgramCache]: Analyzing trace with hash -688872915, now seen corresponding path program 1 times [2025-02-05 12:04:24,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:24,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352415685] [2025-02-05 12:04:24,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:24,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:24,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-02-05 12:04:24,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-02-05 12:04:24,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:24,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:24,679 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-02-05 12:04:24,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:24,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352415685] [2025-02-05 12:04:24,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352415685] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:24,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:24,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:24,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784681611] [2025-02-05 12:04:24,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:24,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:24,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:24,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:24,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:24,682 INFO L87 Difference]: Start difference. First operand 9900 states and 11524 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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-02-05 12:04:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:26,089 INFO L93 Difference]: Finished difference Result 23635 states and 27855 transitions. [2025-02-05 12:04:26,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:26,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 325 [2025-02-05 12:04:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:26,111 INFO L225 Difference]: With dead ends: 23635 [2025-02-05 12:04:26,111 INFO L226 Difference]: Without dead ends: 12887 [2025-02-05 12:04:26,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:26,122 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 391 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:26,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 819 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:04:26,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12887 states. [2025-02-05 12:04:26,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12887 to 12035. [2025-02-05 12:04:26,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12035 states, 12034 states have (on average 1.1499916902110687) internal successors, (13839), 12034 states have internal predecessors, (13839), 0 states have call successors, (0), 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-02-05 12:04:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12035 states to 12035 states and 13839 transitions. [2025-02-05 12:04:26,348 INFO L78 Accepts]: Start accepts. Automaton has 12035 states and 13839 transitions. Word has length 325 [2025-02-05 12:04:26,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:26,350 INFO L471 AbstractCegarLoop]: Abstraction has 12035 states and 13839 transitions. [2025-02-05 12:04:26,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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-02-05 12:04:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 12035 states and 13839 transitions. [2025-02-05 12:04:26,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-02-05 12:04:26,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:26,359 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:26,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:04:26,360 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:26,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:26,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1954449216, now seen corresponding path program 1 times [2025-02-05 12:04:26,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:26,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886059712] [2025-02-05 12:04:26,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:26,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:26,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-02-05 12:04:26,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-02-05 12:04:26,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:26,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-02-05 12:04:26,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:26,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886059712] [2025-02-05 12:04:26,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886059712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:26,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:26,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:26,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227183107] [2025-02-05 12:04:26,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:26,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:26,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:26,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:26,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:26,519 INFO L87 Difference]: Start difference. First operand 12035 states and 13839 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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-02-05 12:04:28,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:28,141 INFO L93 Difference]: Finished difference Result 27466 states and 31865 transitions. [2025-02-05 12:04:28,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:28,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 358 [2025-02-05 12:04:28,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:28,201 INFO L225 Difference]: With dead ends: 27466 [2025-02-05 12:04:28,201 INFO L226 Difference]: Without dead ends: 14583 [2025-02-05 12:04:28,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:28,224 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 381 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:28,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 782 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:04:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14583 states. [2025-02-05 12:04:28,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14583 to 11598. [2025-02-05 12:04:28,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11598 states, 11597 states have (on average 1.1389152366991464) internal successors, (13208), 11597 states have internal predecessors, (13208), 0 states have call successors, (0), 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-02-05 12:04:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11598 states to 11598 states and 13208 transitions. [2025-02-05 12:04:28,404 INFO L78 Accepts]: Start accepts. Automaton has 11598 states and 13208 transitions. Word has length 358 [2025-02-05 12:04:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:28,405 INFO L471 AbstractCegarLoop]: Abstraction has 11598 states and 13208 transitions. [2025-02-05 12:04:28,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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-02-05 12:04:28,406 INFO L276 IsEmpty]: Start isEmpty. Operand 11598 states and 13208 transitions. [2025-02-05 12:04:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-02-05 12:04:28,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:28,417 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:28,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 12:04:28,417 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:28,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:28,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1757299093, now seen corresponding path program 1 times [2025-02-05 12:04:28,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:28,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132738123] [2025-02-05 12:04:28,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:28,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:28,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-02-05 12:04:28,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-02-05 12:04:28,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:28,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:04:29,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:29,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132738123] [2025-02-05 12:04:29,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132738123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:29,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:29,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:29,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675241757] [2025-02-05 12:04:29,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:29,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:29,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:29,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:29,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:29,031 INFO L87 Difference]: Start difference. First operand 11598 states and 13208 transitions. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 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-02-05 12:04:30,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:30,504 INFO L93 Difference]: Finished difference Result 28320 states and 32219 transitions. [2025-02-05 12:04:30,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:30,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 563 [2025-02-05 12:04:30,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:30,528 INFO L225 Difference]: With dead ends: 28320 [2025-02-05 12:04:30,528 INFO L226 Difference]: Without dead ends: 16724 [2025-02-05 12:04:30,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:30,542 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 56 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:30,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 745 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:04:30,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16724 states. [2025-02-05 12:04:30,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16724 to 16718. [2025-02-05 12:04:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16718 states, 16717 states have (on average 1.1158700723814081) internal successors, (18654), 16717 states have internal predecessors, (18654), 0 states have call successors, (0), 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-02-05 12:04:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16718 states to 16718 states and 18654 transitions. [2025-02-05 12:04:30,723 INFO L78 Accepts]: Start accepts. Automaton has 16718 states and 18654 transitions. Word has length 563 [2025-02-05 12:04:30,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:30,724 INFO L471 AbstractCegarLoop]: Abstraction has 16718 states and 18654 transitions. [2025-02-05 12:04:30,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 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-02-05 12:04:30,724 INFO L276 IsEmpty]: Start isEmpty. Operand 16718 states and 18654 transitions. [2025-02-05 12:04:30,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2025-02-05 12:04:30,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:30,737 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:30,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 12:04:30,737 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:30,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:30,738 INFO L85 PathProgramCache]: Analyzing trace with hash -858433383, now seen corresponding path program 1 times [2025-02-05 12:04:30,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:30,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990910688] [2025-02-05 12:04:30,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:30,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:30,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 624 statements into 1 equivalence classes. [2025-02-05 12:04:30,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 624 of 624 statements. [2025-02-05 12:04:30,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:30,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:31,346 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 344 proven. 82 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-02-05 12:04:31,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:31,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990910688] [2025-02-05 12:04:31,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990910688] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:04:31,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969441051] [2025-02-05 12:04:31,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:31,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:04:31,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:04:31,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:04:31,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 12:04:31,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 624 statements into 1 equivalence classes. [2025-02-05 12:04:31,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 624 of 624 statements. [2025-02-05 12:04:31,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:31,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:31,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:04:31,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:04:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 407 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:04:32,128 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:04:32,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969441051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:32,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 12:04:32,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2025-02-05 12:04:32,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122744480] [2025-02-05 12:04:32,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:32,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:04:32,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:32,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:04:32,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:04:32,130 INFO L87 Difference]: Start difference. First operand 16718 states and 18654 transitions. Second operand has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 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-02-05 12:04:34,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:34,388 INFO L93 Difference]: Finished difference Result 52197 states and 58474 transitions. [2025-02-05 12:04:34,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:04:34,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 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 624 [2025-02-05 12:04:34,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:34,456 INFO L225 Difference]: With dead ends: 52197 [2025-02-05 12:04:34,456 INFO L226 Difference]: Without dead ends: 34202 [2025-02-05 12:04:34,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:04:34,496 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 573 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2497 mSolverCounterSat, 488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 488 IncrementalHoareTripleChecker+Valid, 2497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:34,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 238 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [488 Valid, 2497 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:04:34,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34202 states. [2025-02-05 12:04:35,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34202 to 32467. [2025-02-05 12:04:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32467 states, 32466 states have (on average 1.1146738126039548) internal successors, (36189), 32466 states have internal predecessors, (36189), 0 states have call successors, (0), 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-02-05 12:04:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32467 states to 32467 states and 36189 transitions. [2025-02-05 12:04:35,232 INFO L78 Accepts]: Start accepts. Automaton has 32467 states and 36189 transitions. Word has length 624 [2025-02-05 12:04:35,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:35,233 INFO L471 AbstractCegarLoop]: Abstraction has 32467 states and 36189 transitions. [2025-02-05 12:04:35,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 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-02-05 12:04:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 32467 states and 36189 transitions. [2025-02-05 12:04:35,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2025-02-05 12:04:35,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:35,253 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:04:35,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 12:04:35,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 12:04:35,457 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:35,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:35,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1130591829, now seen corresponding path program 1 times [2025-02-05 12:04:35,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:35,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724072528] [2025-02-05 12:04:35,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:35,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:35,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 654 statements into 1 equivalence classes. [2025-02-05 12:04:35,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 654 of 654 statements. [2025-02-05 12:04:35,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:35,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 534 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-02-05 12:04:35,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:35,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724072528] [2025-02-05 12:04:35,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724072528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:35,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:35,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:35,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454836419] [2025-02-05 12:04:35,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:35,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:35,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:35,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:35,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:35,811 INFO L87 Difference]: Start difference. First operand 32467 states and 36189 transitions. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 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-02-05 12:04:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:37,497 INFO L93 Difference]: Finished difference Result 72604 states and 80980 transitions. [2025-02-05 12:04:37,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:37,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 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 654 [2025-02-05 12:04:37,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:37,550 INFO L225 Difference]: With dead ends: 72604 [2025-02-05 12:04:37,551 INFO L226 Difference]: Without dead ends: 40139 [2025-02-05 12:04:37,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:37,579 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 472 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:37,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 266 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:04:37,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40139 states. [2025-02-05 12:04:38,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40139 to 30751. [2025-02-05 12:04:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30751 states, 30750 states have (on average 1.1171707317073172) internal successors, (34353), 30750 states have internal predecessors, (34353), 0 states have call successors, (0), 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-02-05 12:04:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30751 states to 30751 states and 34353 transitions. [2025-02-05 12:04:38,193 INFO L78 Accepts]: Start accepts. Automaton has 30751 states and 34353 transitions. Word has length 654 [2025-02-05 12:04:38,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:38,194 INFO L471 AbstractCegarLoop]: Abstraction has 30751 states and 34353 transitions. [2025-02-05 12:04:38,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 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-02-05 12:04:38,194 INFO L276 IsEmpty]: Start isEmpty. Operand 30751 states and 34353 transitions. [2025-02-05 12:04:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2025-02-05 12:04:38,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:38,217 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:38,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 12:04:38,218 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:38,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:38,218 INFO L85 PathProgramCache]: Analyzing trace with hash -998225320, now seen corresponding path program 1 times [2025-02-05 12:04:38,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:38,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855821104] [2025-02-05 12:04:38,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:38,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:38,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 668 statements into 1 equivalence classes. [2025-02-05 12:04:38,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 668 of 668 statements. [2025-02-05 12:04:38,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:38,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:04:38,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:38,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855821104] [2025-02-05 12:04:38,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855821104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:38,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:38,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:38,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145329931] [2025-02-05 12:04:38,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:38,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:38,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:38,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:38,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:38,812 INFO L87 Difference]: Start difference. First operand 30751 states and 34353 transitions. Second operand has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 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-02-05 12:04:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:40,511 INFO L93 Difference]: Finished difference Result 74273 states and 83180 transitions. [2025-02-05 12:04:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:40,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 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 668 [2025-02-05 12:04:40,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:40,572 INFO L225 Difference]: With dead ends: 74273 [2025-02-05 12:04:40,573 INFO L226 Difference]: Without dead ends: 42667 [2025-02-05 12:04:40,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:40,603 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 101 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:40,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 635 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:04:40,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42667 states. [2025-02-05 12:04:41,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42667 to 42233. [2025-02-05 12:04:41,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42233 states, 42232 states have (on average 1.1064121992801668) internal successors, (46726), 42232 states have internal predecessors, (46726), 0 states have call successors, (0), 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-02-05 12:04:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42233 states to 42233 states and 46726 transitions. [2025-02-05 12:04:41,342 INFO L78 Accepts]: Start accepts. Automaton has 42233 states and 46726 transitions. Word has length 668 [2025-02-05 12:04:41,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:41,342 INFO L471 AbstractCegarLoop]: Abstraction has 42233 states and 46726 transitions. [2025-02-05 12:04:41,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 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-02-05 12:04:41,342 INFO L276 IsEmpty]: Start isEmpty. Operand 42233 states and 46726 transitions. [2025-02-05 12:04:41,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2025-02-05 12:04:41,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:41,367 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:41,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 12:04:41,368 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:41,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1493502471, now seen corresponding path program 1 times [2025-02-05 12:04:41,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:41,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525257401] [2025-02-05 12:04:41,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:41,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:41,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 749 statements into 1 equivalence classes. [2025-02-05 12:04:41,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 749 of 749 statements. [2025-02-05 12:04:41,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:41,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 393 proven. 82 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-02-05 12:04:41,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:41,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525257401] [2025-02-05 12:04:41,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525257401] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:04:41,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647469064] [2025-02-05 12:04:41,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:41,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:04:41,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:04:41,867 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:04:41,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 12:04:41,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 749 statements into 1 equivalence classes. [2025-02-05 12:04:42,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 749 of 749 statements. [2025-02-05 12:04:42,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:42,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:42,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 12:04:42,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:04:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 374 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:04:43,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:04:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:04:44,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647469064] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:04:44,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:04:44,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 7 [2025-02-05 12:04:44,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063643395] [2025-02-05 12:04:44,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:44,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 12:04:44,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:44,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 12:04:44,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:04:44,048 INFO L87 Difference]: Start difference. First operand 42233 states and 46726 transitions. Second operand has 5 states, 5 states have (on average 149.8) internal successors, (749), 4 states have internal predecessors, (749), 0 states have call successors, (0), 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-02-05 12:04:46,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:46,769 INFO L93 Difference]: Finished difference Result 96824 states and 107347 transitions. [2025-02-05 12:04:46,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:04:46,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 149.8) internal successors, (749), 4 states have internal predecessors, (749), 0 states have call successors, (0), 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 749 [2025-02-05 12:04:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:46,838 INFO L225 Difference]: With dead ends: 96824 [2025-02-05 12:04:46,839 INFO L226 Difference]: Without dead ends: 53743 [2025-02-05 12:04:46,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1499 GetRequests, 1493 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:04:46,873 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 859 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 945 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 945 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:46,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 116 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [945 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 12:04:46,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53743 states. [2025-02-05 12:04:47,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53743 to 43527. [2025-02-05 12:04:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43527 states, 43526 states have (on average 1.1055001608234158) internal successors, (48118), 43526 states have internal predecessors, (48118), 0 states have call successors, (0), 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-02-05 12:04:47,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43527 states to 43527 states and 48118 transitions. [2025-02-05 12:04:47,903 INFO L78 Accepts]: Start accepts. Automaton has 43527 states and 48118 transitions. Word has length 749 [2025-02-05 12:04:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:47,904 INFO L471 AbstractCegarLoop]: Abstraction has 43527 states and 48118 transitions. [2025-02-05 12:04:47,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.8) internal successors, (749), 4 states have internal predecessors, (749), 0 states have call successors, (0), 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-02-05 12:04:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 43527 states and 48118 transitions. [2025-02-05 12:04:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-02-05 12:04:47,925 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:47,925 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:47,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 12:04:48,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:04:48,126 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:48,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:48,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1379966971, now seen corresponding path program 1 times [2025-02-05 12:04:48,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:48,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896848791] [2025-02-05 12:04:48,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:48,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:48,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-02-05 12:04:48,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-02-05 12:04:48,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:48,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:48,643 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 626 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-02-05 12:04:48,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:48,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896848791] [2025-02-05 12:04:48,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896848791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:48,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:48,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:48,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693980539] [2025-02-05 12:04:48,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:48,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:48,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:48,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:48,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:48,646 INFO L87 Difference]: Start difference. First operand 43527 states and 48118 transitions. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 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-02-05 12:04:50,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:50,022 INFO L93 Difference]: Finished difference Result 99401 states and 110057 transitions. [2025-02-05 12:04:50,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:50,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 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 765 [2025-02-05 12:04:50,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:50,090 INFO L225 Difference]: With dead ends: 99401 [2025-02-05 12:04:50,090 INFO L226 Difference]: Without dead ends: 55451 [2025-02-05 12:04:50,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:50,125 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 322 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:50,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 764 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 12:04:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55451 states. [2025-02-05 12:04:50,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55451 to 53739. [2025-02-05 12:04:50,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53739 states, 53738 states have (on average 1.0983661468606944) internal successors, (59024), 53738 states have internal predecessors, (59024), 0 states have call successors, (0), 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-02-05 12:04:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53739 states to 53739 states and 59024 transitions. [2025-02-05 12:04:50,941 INFO L78 Accepts]: Start accepts. Automaton has 53739 states and 59024 transitions. Word has length 765 [2025-02-05 12:04:50,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:50,941 INFO L471 AbstractCegarLoop]: Abstraction has 53739 states and 59024 transitions. [2025-02-05 12:04:50,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 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-02-05 12:04:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 53739 states and 59024 transitions. [2025-02-05 12:04:50,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2025-02-05 12:04:50,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:50,969 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:04:50,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 12:04:50,970 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:50,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:50,970 INFO L85 PathProgramCache]: Analyzing trace with hash -116063910, now seen corresponding path program 1 times [2025-02-05 12:04:50,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:50,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870621121] [2025-02-05 12:04:50,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:50,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:51,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 820 statements into 1 equivalence classes. [2025-02-05 12:04:51,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 820 of 820 statements. [2025-02-05 12:04:51,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:51,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 615 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-02-05 12:04:51,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:51,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870621121] [2025-02-05 12:04:51,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870621121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:51,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:51,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:04:51,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438226553] [2025-02-05 12:04:51,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:51,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:51,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:51,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:51,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:51,365 INFO L87 Difference]: Start difference. First operand 53739 states and 59024 transitions. Second operand has 3 states, 3 states have (on average 191.0) internal successors, (573), 2 states have internal predecessors, (573), 0 states have call successors, (0), 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-02-05 12:04:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:52,181 INFO L93 Difference]: Finished difference Result 104913 states and 115127 transitions. [2025-02-05 12:04:52,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:52,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 2 states have internal predecessors, (573), 0 states have call successors, (0), 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 820 [2025-02-05 12:04:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:52,242 INFO L225 Difference]: With dead ends: 104913 [2025-02-05 12:04:52,242 INFO L226 Difference]: Without dead ends: 51174 [2025-02-05 12:04:52,265 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-02-05 12:04:52,266 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 389 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:52,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 89 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 12:04:52,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51174 states. [2025-02-05 12:04:52,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51174 to 51169. [2025-02-05 12:04:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51169 states, 51168 states have (on average 1.0960756722951845) internal successors, (56084), 51168 states have internal predecessors, (56084), 0 states have call successors, (0), 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-02-05 12:04:52,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51169 states to 51169 states and 56084 transitions. [2025-02-05 12:04:52,937 INFO L78 Accepts]: Start accepts. Automaton has 51169 states and 56084 transitions. Word has length 820 [2025-02-05 12:04:52,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:52,938 INFO L471 AbstractCegarLoop]: Abstraction has 51169 states and 56084 transitions. [2025-02-05 12:04:52,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 2 states have internal predecessors, (573), 0 states have call successors, (0), 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-02-05 12:04:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 51169 states and 56084 transitions. [2025-02-05 12:04:52,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2025-02-05 12:04:52,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:52,966 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:04:52,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 12:04:52,966 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:52,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:52,967 INFO L85 PathProgramCache]: Analyzing trace with hash 953464930, now seen corresponding path program 1 times [2025-02-05 12:04:52,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:52,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739692661] [2025-02-05 12:04:52,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:52,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:53,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 843 statements into 1 equivalence classes. [2025-02-05 12:04:53,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 843 of 843 statements. [2025-02-05 12:04:53,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:53,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-05 12:04:53,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:53,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739692661] [2025-02-05 12:04:53,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739692661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:53,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:53,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:53,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074916680] [2025-02-05 12:04:53,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:53,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:53,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:53,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:53,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:53,516 INFO L87 Difference]: Start difference. First operand 51169 states and 56084 transitions. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 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-02-05 12:04:54,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:54,902 INFO L93 Difference]: Finished difference Result 101904 states and 111688 transitions. [2025-02-05 12:04:54,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:54,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 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 843 [2025-02-05 12:04:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:54,957 INFO L225 Difference]: With dead ends: 101904 [2025-02-05 12:04:54,957 INFO L226 Difference]: Without dead ends: 50735 [2025-02-05 12:04:54,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:54,974 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 107 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:54,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 667 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 12:04:55,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50735 states. [2025-02-05 12:04:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50735 to 49457. [2025-02-05 12:04:55,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49457 states, 49456 states have (on average 1.0738231963765772) internal successors, (53107), 49456 states have internal predecessors, (53107), 0 states have call successors, (0), 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-02-05 12:04:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49457 states to 49457 states and 53107 transitions. [2025-02-05 12:04:55,599 INFO L78 Accepts]: Start accepts. Automaton has 49457 states and 53107 transitions. Word has length 843 [2025-02-05 12:04:55,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:55,599 INFO L471 AbstractCegarLoop]: Abstraction has 49457 states and 53107 transitions. [2025-02-05 12:04:55,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 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-02-05 12:04:55,600 INFO L276 IsEmpty]: Start isEmpty. Operand 49457 states and 53107 transitions. [2025-02-05 12:04:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 873 [2025-02-05 12:04:55,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:55,626 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:55,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 12:04:55,626 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:55,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:55,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1300179462, now seen corresponding path program 1 times [2025-02-05 12:04:55,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:55,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337896357] [2025-02-05 12:04:55,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:55,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:55,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 872 statements into 1 equivalence classes. [2025-02-05 12:04:55,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 872 of 872 statements. [2025-02-05 12:04:55,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:55,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 655 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-05 12:04:56,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:56,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337896357] [2025-02-05 12:04:56,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337896357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:56,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:56,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:04:56,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706541880] [2025-02-05 12:04:56,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:56,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:04:56,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:56,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:04:56,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:04:56,743 INFO L87 Difference]: Start difference. First operand 49457 states and 53107 transitions. Second operand has 4 states, 4 states have (on average 177.5) internal successors, (710), 4 states have internal predecessors, (710), 0 states have call successors, (0), 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-02-05 12:04:58,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:58,936 INFO L93 Difference]: Finished difference Result 116380 states and 124895 transitions. [2025-02-05 12:04:58,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:04:58,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 177.5) internal successors, (710), 4 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 872 [2025-02-05 12:04:58,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:59,018 INFO L225 Difference]: With dead ends: 116380 [2025-02-05 12:04:59,019 INFO L226 Difference]: Without dead ends: 66500 [2025-02-05 12:04:59,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:04:59,059 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 651 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 2360 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 2745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 2360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:59,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 155 Invalid, 2745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 2360 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:04:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66500 states. [2025-02-05 12:04:59,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66500 to 58386. [2025-02-05 12:04:59,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58386 states, 58385 states have (on average 1.075909908366875) internal successors, (62817), 58385 states have internal predecessors, (62817), 0 states have call successors, (0), 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-02-05 12:04:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58386 states to 58386 states and 62817 transitions. [2025-02-05 12:04:59,771 INFO L78 Accepts]: Start accepts. Automaton has 58386 states and 62817 transitions. Word has length 872 [2025-02-05 12:04:59,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:59,773 INFO L471 AbstractCegarLoop]: Abstraction has 58386 states and 62817 transitions. [2025-02-05 12:04:59,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 177.5) internal successors, (710), 4 states have internal predecessors, (710), 0 states have call successors, (0), 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-02-05 12:04:59,774 INFO L276 IsEmpty]: Start isEmpty. Operand 58386 states and 62817 transitions. [2025-02-05 12:04:59,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 942 [2025-02-05 12:04:59,809 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:59,809 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02-05 12:04:59,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 12:04:59,809 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:59,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:59,810 INFO L85 PathProgramCache]: Analyzing trace with hash 639346758, now seen corresponding path program 1 times [2025-02-05 12:04:59,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:59,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826533624] [2025-02-05 12:04:59,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:59,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:59,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 941 statements into 1 equivalence classes. [2025-02-05 12:05:00,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 941 of 941 statements. [2025-02-05 12:05:00,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:00,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:00,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 695 proven. 82 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2025-02-05 12:05:00,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:00,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826533624] [2025-02-05 12:05:00,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826533624] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:05:00,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191815949] [2025-02-05 12:05:00,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:00,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:05:00,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:05:00,950 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:05:00,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 12:05:01,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 941 statements into 1 equivalence classes. [2025-02-05 12:05:01,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 941 of 941 statements. [2025-02-05 12:05:01,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:01,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:01,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:05:01,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:05:01,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 695 proven. 82 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2025-02-05 12:05:01,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:05:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 777 proven. 0 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2025-02-05 12:05:02,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191815949] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:05:02,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:05:02,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-02-05 12:05:02,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799104782] [2025-02-05 12:05:02,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:02,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:05:02,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:02,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:05:02,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:05:02,045 INFO L87 Difference]: Start difference. First operand 58386 states and 62817 transitions. Second operand has 4 states, 4 states have (on average 128.5) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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-02-05 12:05:04,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:04,837 INFO L93 Difference]: Finished difference Result 128699 states and 138625 transitions. [2025-02-05 12:05:04,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:05:04,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 128.5) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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 941 [2025-02-05 12:05:04,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:04,950 INFO L225 Difference]: With dead ends: 128699 [2025-02-05 12:05:04,950 INFO L226 Difference]: Without dead ends: 70315 [2025-02-05 12:05:04,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1883 GetRequests, 1879 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:05:04,984 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 773 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:04,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 131 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 2121 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 12:05:05,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70315 states. [2025-02-05 12:05:05,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70315 to 67332. [2025-02-05 12:05:05,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67332 states, 67331 states have (on average 1.0722846831325838) internal successors, (72198), 67331 states have internal predecessors, (72198), 0 states have call successors, (0), 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-02-05 12:05:05,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67332 states to 67332 states and 72198 transitions. [2025-02-05 12:05:05,780 INFO L78 Accepts]: Start accepts. Automaton has 67332 states and 72198 transitions. Word has length 941 [2025-02-05 12:05:05,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:05,780 INFO L471 AbstractCegarLoop]: Abstraction has 67332 states and 72198 transitions. [2025-02-05 12:05:05,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.5) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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-02-05 12:05:05,781 INFO L276 IsEmpty]: Start isEmpty. Operand 67332 states and 72198 transitions. [2025-02-05 12:05:05,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 997 [2025-02-05 12:05:05,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:05,816 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02-05 12:05:05,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 12:05:06,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:05:06,017 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:06,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:06,018 INFO L85 PathProgramCache]: Analyzing trace with hash -831755841, now seen corresponding path program 1 times [2025-02-05 12:05:06,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:06,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204779336] [2025-02-05 12:05:06,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:06,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:06,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 996 statements into 1 equivalence classes. [2025-02-05 12:05:06,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 996 of 996 statements. [2025-02-05 12:05:06,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:06,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 1121 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2025-02-05 12:05:07,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:07,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204779336] [2025-02-05 12:05:07,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204779336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:07,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:07,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:05:07,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308474698] [2025-02-05 12:05:07,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:07,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:05:07,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:07,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:05:07,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:05:07,349 INFO L87 Difference]: Start difference. First operand 67332 states and 72198 transitions. Second operand has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 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-02-05 12:05:09,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:09,887 INFO L93 Difference]: Finished difference Result 154266 states and 166031 transitions. [2025-02-05 12:05:09,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:05:09,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 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 996 [2025-02-05 12:05:09,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:10,001 INFO L225 Difference]: With dead ends: 154266 [2025-02-05 12:05:10,001 INFO L226 Difference]: Without dead ends: 86936 [2025-02-05 12:05:10,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:05:10,057 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 726 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2202 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 2202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:10,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 131 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 2202 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:05:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86936 states. [2025-02-05 12:05:11,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86936 to 85650. [2025-02-05 12:05:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85650 states, 85649 states have (on average 1.0741047764714124) internal successors, (91996), 85649 states have internal predecessors, (91996), 0 states have call successors, (0), 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-02-05 12:05:11,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85650 states to 85650 states and 91996 transitions. [2025-02-05 12:05:11,302 INFO L78 Accepts]: Start accepts. Automaton has 85650 states and 91996 transitions. Word has length 996 [2025-02-05 12:05:11,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:11,303 INFO L471 AbstractCegarLoop]: Abstraction has 85650 states and 91996 transitions. [2025-02-05 12:05:11,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 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-02-05 12:05:11,303 INFO L276 IsEmpty]: Start isEmpty. Operand 85650 states and 91996 transitions. [2025-02-05 12:05:11,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1023 [2025-02-05 12:05:11,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:11,382 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:11,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 12:05:11,382 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:11,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:11,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1598984641, now seen corresponding path program 1 times [2025-02-05 12:05:11,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:11,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188017414] [2025-02-05 12:05:11,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:11,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:11,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1022 statements into 1 equivalence classes. [2025-02-05 12:05:11,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1022 of 1022 statements. [2025-02-05 12:05:11,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:11,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:12,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1913 backedges. 1350 proven. 0 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2025-02-05 12:05:12,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:12,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188017414] [2025-02-05 12:05:12,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188017414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:12,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:12,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:12,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347739515] [2025-02-05 12:05:12,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:12,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:12,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:12,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:12,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:12,152 INFO L87 Difference]: Start difference. First operand 85650 states and 91996 transitions. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 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-02-05 12:05:13,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:13,751 INFO L93 Difference]: Finished difference Result 170841 states and 183524 transitions. [2025-02-05 12:05:13,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:13,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 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 1022 [2025-02-05 12:05:13,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:13,862 INFO L225 Difference]: With dead ends: 170841 [2025-02-05 12:05:13,862 INFO L226 Difference]: Without dead ends: 85193 [2025-02-05 12:05:13,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:13,919 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 342 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:13,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 664 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 12:05:13,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85193 states. [2025-02-05 12:05:14,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85193 to 82619. [2025-02-05 12:05:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82619 states, 82618 states have (on average 1.069343242392699) internal successors, (88347), 82618 states have internal predecessors, (88347), 0 states have call successors, (0), 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-02-05 12:05:14,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82619 states to 82619 states and 88347 transitions. [2025-02-05 12:05:14,835 INFO L78 Accepts]: Start accepts. Automaton has 82619 states and 88347 transitions. Word has length 1022 [2025-02-05 12:05:14,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:14,837 INFO L471 AbstractCegarLoop]: Abstraction has 82619 states and 88347 transitions. [2025-02-05 12:05:14,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 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-02-05 12:05:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 82619 states and 88347 transitions. [2025-02-05 12:05:14,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2025-02-05 12:05:14,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:14,894 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:14,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 12:05:14,894 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:14,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:14,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1247296590, now seen corresponding path program 1 times [2025-02-05 12:05:14,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:14,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942100236] [2025-02-05 12:05:14,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:14,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:14,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1032 statements into 1 equivalence classes. [2025-02-05 12:05:15,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1032 of 1032 statements. [2025-02-05 12:05:15,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:15,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1535 backedges. 1088 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2025-02-05 12:05:15,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:15,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942100236] [2025-02-05 12:05:15,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942100236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:15,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:15,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:15,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674969633] [2025-02-05 12:05:15,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:15,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:15,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:15,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:15,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:15,758 INFO L87 Difference]: Start difference. First operand 82619 states and 88347 transitions. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 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-02-05 12:05:17,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:17,497 INFO L93 Difference]: Finished difference Result 181399 states and 193834 transitions. [2025-02-05 12:05:17,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:17,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 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 1032 [2025-02-05 12:05:17,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:17,639 INFO L225 Difference]: With dead ends: 181399 [2025-02-05 12:05:17,639 INFO L226 Difference]: Without dead ends: 98782 [2025-02-05 12:05:17,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:17,699 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 265 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:17,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 268 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:05:17,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98782 states. [2025-02-05 12:05:18,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98782 to 93672. [2025-02-05 12:05:18,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93672 states, 93671 states have (on average 1.0624739780721888) internal successors, (99523), 93671 states have internal predecessors, (99523), 0 states have call successors, (0), 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-02-05 12:05:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93672 states to 93672 states and 99523 transitions. [2025-02-05 12:05:18,912 INFO L78 Accepts]: Start accepts. Automaton has 93672 states and 99523 transitions. Word has length 1032 [2025-02-05 12:05:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:18,913 INFO L471 AbstractCegarLoop]: Abstraction has 93672 states and 99523 transitions. [2025-02-05 12:05:18,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 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-02-05 12:05:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 93672 states and 99523 transitions. [2025-02-05 12:05:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1119 [2025-02-05 12:05:19,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:19,001 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:05:19,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 12:05:19,002 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:19,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:19,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2028194920, now seen corresponding path program 1 times [2025-02-05 12:05:19,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:19,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152831466] [2025-02-05 12:05:19,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:19,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:19,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1118 statements into 1 equivalence classes. [2025-02-05 12:05:19,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1118 of 1118 statements. [2025-02-05 12:05:19,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:19,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:20,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 1697 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2025-02-05 12:05:20,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:20,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152831466] [2025-02-05 12:05:20,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152831466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:20,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:20,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:05:20,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449054637] [2025-02-05 12:05:20,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:20,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:05:20,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:20,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:05:20,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:05:20,329 INFO L87 Difference]: Start difference. First operand 93672 states and 99523 transitions. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-02-05 12:05:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:22,960 INFO L93 Difference]: Finished difference Result 183491 states and 194327 transitions. [2025-02-05 12:05:22,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:05:22,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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 1118 [2025-02-05 12:05:22,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:23,058 INFO L225 Difference]: With dead ends: 183491 [2025-02-05 12:05:23,058 INFO L226 Difference]: Without dead ends: 89821 [2025-02-05 12:05:23,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:05:23,118 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 595 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 2651 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 2651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:23,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 268 Invalid, 2882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 2651 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 12:05:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89821 states. [2025-02-05 12:05:24,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89821 to 87680. [2025-02-05 12:05:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87680 states, 87679 states have (on average 1.0520763238631827) internal successors, (92245), 87679 states have internal predecessors, (92245), 0 states have call successors, (0), 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-02-05 12:05:24,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87680 states to 87680 states and 92245 transitions. [2025-02-05 12:05:24,273 INFO L78 Accepts]: Start accepts. Automaton has 87680 states and 92245 transitions. Word has length 1118 [2025-02-05 12:05:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:24,274 INFO L471 AbstractCegarLoop]: Abstraction has 87680 states and 92245 transitions. [2025-02-05 12:05:24,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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-02-05 12:05:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 87680 states and 92245 transitions. [2025-02-05 12:05:24,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1134 [2025-02-05 12:05:24,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:24,355 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:24,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 12:05:24,355 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:24,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1075459144, now seen corresponding path program 1 times [2025-02-05 12:05:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:24,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758935640] [2025-02-05 12:05:24,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:24,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:24,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1133 statements into 1 equivalence classes. [2025-02-05 12:05:24,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1133 of 1133 statements. [2025-02-05 12:05:24,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:24,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 1122 proven. 0 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2025-02-05 12:05:24,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:24,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758935640] [2025-02-05 12:05:24,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758935640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:24,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:24,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:24,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656339564] [2025-02-05 12:05:24,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:24,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:24,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:24,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:24,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:24,816 INFO L87 Difference]: Start difference. First operand 87680 states and 92245 transitions. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 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-02-05 12:05:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:26,423 INFO L93 Difference]: Finished difference Result 174078 states and 183168 transitions. [2025-02-05 12:05:26,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:26,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 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 1133 [2025-02-05 12:05:26,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:26,523 INFO L225 Difference]: With dead ends: 174078 [2025-02-05 12:05:26,523 INFO L226 Difference]: Without dead ends: 86400 [2025-02-05 12:05:26,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:26,578 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 472 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:26,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 577 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 12:05:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86400 states.