./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label28.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/Problem18_label28.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 693604fe74726cb26a5402144f519fff0691b306c00b0b2405a8cfbcd5ac5921 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:10:13,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:10:13,086 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:10:13,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:10:13,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:10:13,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:10:13,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:10:13,103 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:10:13,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:10:13,103 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:10:13,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:10:13,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:10:13,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:10:13,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:10:13,103 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:10:13,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:10:13,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:10:13,103 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:10:13,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:10:13,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:10:13,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:10:13,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:10:13,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:10:13,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:10:13,104 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:10:13,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:10:13,104 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:10:13,104 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:10:13,104 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:10:13,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:10:13,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:10:13,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:10:13,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:10:13,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:10:13,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:10:13,104 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:10:13,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:10:13,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:10:13,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:10:13,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:10:13,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:10:13,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:10:13,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:10:13,105 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 -> 693604fe74726cb26a5402144f519fff0691b306c00b0b2405a8cfbcd5ac5921 [2025-02-05 12:10:13,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:10:13,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:10:13,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:10:13,316 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:10:13,317 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:10:13,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label28.c [2025-02-05 12:10:14,354 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/06ae9c996/9e9569d5ca394f379f2d63c29aa5cd35/FLAG9a94317f4 [2025-02-05 12:10:14,703 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:10:14,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label28.c [2025-02-05 12:10:14,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/06ae9c996/9e9569d5ca394f379f2d63c29aa5cd35/FLAG9a94317f4 [2025-02-05 12:10:14,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/06ae9c996/9e9569d5ca394f379f2d63c29aa5cd35 [2025-02-05 12:10:14,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:10:14,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:10:14,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:10:14,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:10:14,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:10:14,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:10:14" (1/1) ... [2025-02-05 12:10:14,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d1a6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:10:14, skipping insertion in model container [2025-02-05 12:10:14,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:10:14" (1/1) ... [2025-02-05 12:10:15,071 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:10:15,219 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/Problem18_label28.c[6667,6680] [2025-02-05 12:10:15,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:10:15,574 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:10:15,589 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/Problem18_label28.c[6667,6680] [2025-02-05 12:10:15,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:10:15,796 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:10:15,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:10:15 WrapperNode [2025-02-05 12:10:15,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:10:15,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:10:15,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:10:15,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:10:15,802 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:10:15" (1/1) ... [2025-02-05 12:10:15,828 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:10:15" (1/1) ... [2025-02-05 12:10:15,980 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-02-05 12:10:15,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:10:15,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:10:15,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:10:15,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:10:15,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:10:15" (1/1) ... [2025-02-05 12:10:15,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:10:15" (1/1) ... [2025-02-05 12:10:16,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:10:15" (1/1) ... [2025-02-05 12:10:16,063 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:10:16,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:10:15" (1/1) ... [2025-02-05 12:10:16,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:10:15" (1/1) ... [2025-02-05 12:10:16,127 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:10:15" (1/1) ... [2025-02-05 12:10:16,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:10:15" (1/1) ... [2025-02-05 12:10:16,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:10:15" (1/1) ... [2025-02-05 12:10:16,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:10:15" (1/1) ... [2025-02-05 12:10:16,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:10:16,215 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:10:16,216 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:10:16,216 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:10:16,216 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:10:15" (1/1) ... [2025-02-05 12:10:16,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:10:16,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:10:16,241 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:10:16,244 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:10:16,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:10:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:10:16,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:10:16,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:10:16,312 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:10:16,314 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:10:19,068 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1; [2025-02-05 12:10:19,073 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1; [2025-02-05 12:10:19,251 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-02-05 12:10:19,251 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:10:19,278 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:10:19,281 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:10:19,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:10:19 BoogieIcfgContainer [2025-02-05 12:10:19,282 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:10:19,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:10:19,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:10:19,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:10:19,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:10:14" (1/3) ... [2025-02-05 12:10:19,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7046b49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:10:19, skipping insertion in model container [2025-02-05 12:10:19,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:10:15" (2/3) ... [2025-02-05 12:10:19,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7046b49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:10:19, skipping insertion in model container [2025-02-05 12:10:19,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:10:19" (3/3) ... [2025-02-05 12:10:19,288 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label28.c [2025-02-05 12:10:19,299 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:10:19,300 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label28.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:10:19,359 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:10:19,369 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;@1b86b52c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:10:19,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:10:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 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:10:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 12:10:19,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:19,382 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] [2025-02-05 12:10:19,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:19,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:19,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1300074329, now seen corresponding path program 1 times [2025-02-05 12:10:19,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:19,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437540077] [2025-02-05 12:10:19,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:19,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:19,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 12:10:19,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 12:10:19,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:19,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:19,659 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:10:19,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:19,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437540077] [2025-02-05 12:10:19,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437540077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:19,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:19,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:10:19,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119075776] [2025-02-05 12:10:19,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:19,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:19,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:19,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:19,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:19,678 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 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.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:10:22,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:22,123 INFO L93 Difference]: Finished difference Result 2205 states and 4263 transitions. [2025-02-05 12:10:22,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:22,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 12:10:22,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:22,156 INFO L225 Difference]: With dead ends: 2205 [2025-02-05 12:10:22,156 INFO L226 Difference]: Without dead ends: 1384 [2025-02-05 12:10:22,164 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:10:22,172 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 684 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 967 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 967 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:22,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 291 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [967 Valid, 2018 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 12:10:22,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-02-05 12:10:22,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2025-02-05 12:10:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.7339117859725235) internal successors, (2398), 1383 states have internal predecessors, (2398), 0 states have call successors, (0), 0 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:10:22,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2398 transitions. [2025-02-05 12:10:22,255 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2398 transitions. Word has length 64 [2025-02-05 12:10:22,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:22,255 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2398 transitions. [2025-02-05 12:10:22,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:10:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2398 transitions. [2025-02-05 12:10:22,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 12:10:22,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:22,261 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:10:22,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:10:22,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:22,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:22,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1612979696, now seen corresponding path program 1 times [2025-02-05 12:10:22,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:22,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515329433] [2025-02-05 12:10:22,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:22,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:22,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 12:10:22,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 12:10:22,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:22,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:10:22,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:22,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515329433] [2025-02-05 12:10:22,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515329433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:22,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:22,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:10:22,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554040249] [2025-02-05 12:10:22,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:22,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:22,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:22,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:22,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:22,475 INFO L87 Difference]: Start difference. First operand 1384 states and 2398 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:10:24,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:24,790 INFO L93 Difference]: Finished difference Result 4146 states and 7189 transitions. [2025-02-05 12:10:24,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:24,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-02-05 12:10:24,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:24,799 INFO L225 Difference]: With dead ends: 4146 [2025-02-05 12:10:24,800 INFO L226 Difference]: Without dead ends: 2764 [2025-02-05 12:10:24,803 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:10:24,804 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 676 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 2628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:24,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 573 Invalid, 2628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 12:10:24,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2025-02-05 12:10:24,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2025-02-05 12:10:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2763 states have (on average 1.430691277596815) internal successors, (3953), 2763 states have internal predecessors, (3953), 0 states have call successors, (0), 0 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:10:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3953 transitions. [2025-02-05 12:10:24,857 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3953 transitions. Word has length 133 [2025-02-05 12:10:24,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:24,857 INFO L471 AbstractCegarLoop]: Abstraction has 2764 states and 3953 transitions. [2025-02-05 12:10:24,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:10:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3953 transitions. [2025-02-05 12:10:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 12:10:24,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:24,862 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, 1, 1, 1, 1, 1, 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:10:24,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:10:24,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:24,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:24,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1053111096, now seen corresponding path program 1 times [2025-02-05 12:10:24,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:24,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161821428] [2025-02-05 12:10:24,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:24,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:24,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 12:10:24,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 12:10:24,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:24,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:10:25,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:25,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161821428] [2025-02-05 12:10:25,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161821428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:25,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:25,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:10:25,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940466830] [2025-02-05 12:10:25,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:25,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:25,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:25,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:25,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:25,040 INFO L87 Difference]: Start difference. First operand 2764 states and 3953 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:10:27,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:27,248 INFO L93 Difference]: Finished difference Result 8286 states and 11854 transitions. [2025-02-05 12:10:27,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:27,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-02-05 12:10:27,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:27,265 INFO L225 Difference]: With dead ends: 8286 [2025-02-05 12:10:27,267 INFO L226 Difference]: Without dead ends: 5524 [2025-02-05 12:10:27,272 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:10:27,275 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 689 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:27,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 435 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:10:27,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5524 states. [2025-02-05 12:10:27,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5524 to 5524. [2025-02-05 12:10:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5523 states have (on average 1.2817309433279016) internal successors, (7079), 5523 states have internal predecessors, (7079), 0 states have call successors, (0), 0 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:10:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 7079 transitions. [2025-02-05 12:10:27,401 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 7079 transitions. Word has length 149 [2025-02-05 12:10:27,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:27,401 INFO L471 AbstractCegarLoop]: Abstraction has 5524 states and 7079 transitions. [2025-02-05 12:10:27,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:10:27,401 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 7079 transitions. [2025-02-05 12:10:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-05 12:10:27,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:27,403 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, 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] [2025-02-05 12:10:27,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:10:27,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:27,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:27,404 INFO L85 PathProgramCache]: Analyzing trace with hash -761919074, now seen corresponding path program 1 times [2025-02-05 12:10:27,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:27,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685913086] [2025-02-05 12:10:27,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:27,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:27,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-05 12:10:27,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-05 12:10:27,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:27,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:27,865 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-05 12:10:27,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:27,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685913086] [2025-02-05 12:10:27,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685913086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:27,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:27,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:27,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20245499] [2025-02-05 12:10:27,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:27,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:10:27,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:27,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:10:27,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:10:27,870 INFO L87 Difference]: Start difference. First operand 5524 states and 7079 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 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:10:30,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:30,882 INFO L93 Difference]: Finished difference Result 15186 states and 18704 transitions. [2025-02-05 12:10:30,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:10:30,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 251 [2025-02-05 12:10:30,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:30,904 INFO L225 Difference]: With dead ends: 15186 [2025-02-05 12:10:30,904 INFO L226 Difference]: Without dead ends: 9664 [2025-02-05 12:10:30,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:10:30,911 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 1873 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4378 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 4483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 4378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:30,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 647 Invalid, 4483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 4378 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 12:10:30,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9664 states. [2025-02-05 12:10:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9664 to 8284. [2025-02-05 12:10:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8284 states, 8283 states have (on average 1.2153809006398648) internal successors, (10067), 8283 states have internal predecessors, (10067), 0 states have call successors, (0), 0 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:10:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 10067 transitions. [2025-02-05 12:10:31,012 INFO L78 Accepts]: Start accepts. Automaton has 8284 states and 10067 transitions. Word has length 251 [2025-02-05 12:10:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:31,012 INFO L471 AbstractCegarLoop]: Abstraction has 8284 states and 10067 transitions. [2025-02-05 12:10:31,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 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:10:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 8284 states and 10067 transitions. [2025-02-05 12:10:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-02-05 12:10:31,016 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:31,016 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:31,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:10:31,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:31,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:31,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1040939884, now seen corresponding path program 1 times [2025-02-05 12:10:31,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:31,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624607085] [2025-02-05 12:10:31,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:31,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:31,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-02-05 12:10:31,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-02-05 12:10:31,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:31,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-05 12:10:31,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:31,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624607085] [2025-02-05 12:10:31,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624607085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:31,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:31,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:31,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728107927] [2025-02-05 12:10:31,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:31,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:10:31,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:31,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:10:31,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:10:31,454 INFO L87 Difference]: Start difference. First operand 8284 states and 10067 transitions. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 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:10:33,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:33,545 INFO L93 Difference]: Finished difference Result 18689 states and 22309 transitions. [2025-02-05 12:10:33,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:10:33,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 433 [2025-02-05 12:10:33,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:33,568 INFO L225 Difference]: With dead ends: 18689 [2025-02-05 12:10:33,569 INFO L226 Difference]: Without dead ends: 10354 [2025-02-05 12:10:33,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:10:33,574 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 529 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:33,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 636 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:10:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10354 states. [2025-02-05 12:10:33,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10354 to 10354. [2025-02-05 12:10:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10354 states, 10353 states have (on average 1.1352265043948615) internal successors, (11753), 10353 states have internal predecessors, (11753), 0 states have call successors, (0), 0 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:10:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10354 states to 10354 states and 11753 transitions. [2025-02-05 12:10:33,727 INFO L78 Accepts]: Start accepts. Automaton has 10354 states and 11753 transitions. Word has length 433 [2025-02-05 12:10:33,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:33,727 INFO L471 AbstractCegarLoop]: Abstraction has 10354 states and 11753 transitions. [2025-02-05 12:10:33,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 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:10:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 10354 states and 11753 transitions. [2025-02-05 12:10:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 879 [2025-02-05 12:10:33,744 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:33,745 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:10:33,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:10:33,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:33,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:33,747 INFO L85 PathProgramCache]: Analyzing trace with hash -837504353, now seen corresponding path program 1 times [2025-02-05 12:10:33,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:33,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54563103] [2025-02-05 12:10:33,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:33,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:33,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 878 statements into 1 equivalence classes. [2025-02-05 12:10:33,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 878 of 878 statements. [2025-02-05 12:10:33,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:33,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-02-05 12:10:34,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:34,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54563103] [2025-02-05 12:10:34,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54563103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:34,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:34,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:34,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727826635] [2025-02-05 12:10:34,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:34,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:34,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:34,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:34,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:34,291 INFO L87 Difference]: Start difference. First operand 10354 states and 11753 transitions. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 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:10:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:36,085 INFO L93 Difference]: Finished difference Result 24846 states and 28499 transitions. [2025-02-05 12:10:36,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:36,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 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 878 [2025-02-05 12:10:36,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:36,114 INFO L225 Difference]: With dead ends: 24846 [2025-02-05 12:10:36,114 INFO L226 Difference]: Without dead ends: 14494 [2025-02-05 12:10:36,123 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:10:36,124 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 638 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 2440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:36,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 319 Invalid, 2440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 1928 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:10:36,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14494 states. [2025-02-05 12:10:36,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14494 to 13804. [2025-02-05 12:10:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13804 states, 13803 states have (on average 1.1514163587625879) internal successors, (15893), 13803 states have internal predecessors, (15893), 0 states have call successors, (0), 0 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:10:36,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13804 states to 13804 states and 15893 transitions. [2025-02-05 12:10:36,231 INFO L78 Accepts]: Start accepts. Automaton has 13804 states and 15893 transitions. Word has length 878 [2025-02-05 12:10:36,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:36,232 INFO L471 AbstractCegarLoop]: Abstraction has 13804 states and 15893 transitions. [2025-02-05 12:10:36,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 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:10:36,233 INFO L276 IsEmpty]: Start isEmpty. Operand 13804 states and 15893 transitions. [2025-02-05 12:10:36,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2025-02-05 12:10:36,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:36,248 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:10:36,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:10:36,248 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:36,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:36,249 INFO L85 PathProgramCache]: Analyzing trace with hash -351554096, now seen corresponding path program 1 times [2025-02-05 12:10:36,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:36,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665067645] [2025-02-05 12:10:36,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:36,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:36,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 963 statements into 1 equivalence classes. [2025-02-05 12:10:36,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 963 of 963 statements. [2025-02-05 12:10:36,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:36,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2025-02-05 12:10:36,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:36,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665067645] [2025-02-05 12:10:36,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665067645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:36,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:36,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:10:36,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129869820] [2025-02-05 12:10:36,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:36,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:36,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:36,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:36,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:36,903 INFO L87 Difference]: Start difference. First operand 13804 states and 15893 transitions. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 2 states have internal predecessors, (582), 0 states have call successors, (0), 0 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:10:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:38,860 INFO L93 Difference]: Finished difference Result 34506 states and 40337 transitions. [2025-02-05 12:10:38,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:38,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 2 states have internal predecessors, (582), 0 states have call successors, (0), 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 963 [2025-02-05 12:10:38,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:38,889 INFO L225 Difference]: With dead ends: 34506 [2025-02-05 12:10:38,890 INFO L226 Difference]: Without dead ends: 20704 [2025-02-05 12:10:38,897 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:10:38,898 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 247 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:38,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 82 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:10:38,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20704 states. [2025-02-05 12:10:39,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20704 to 20704. [2025-02-05 12:10:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20704 states, 20703 states have (on average 1.1677534656813022) internal successors, (24176), 20703 states have internal predecessors, (24176), 0 states have call successors, (0), 0 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:10:39,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20704 states to 20704 states and 24176 transitions. [2025-02-05 12:10:39,066 INFO L78 Accepts]: Start accepts. Automaton has 20704 states and 24176 transitions. Word has length 963 [2025-02-05 12:10:39,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:39,068 INFO L471 AbstractCegarLoop]: Abstraction has 20704 states and 24176 transitions. [2025-02-05 12:10:39,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 2 states have internal predecessors, (582), 0 states have call successors, (0), 0 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:10:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 20704 states and 24176 transitions. [2025-02-05 12:10:39,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 965 [2025-02-05 12:10:39,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:39,073 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, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:10:39,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:10:39,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:39,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:39,075 INFO L85 PathProgramCache]: Analyzing trace with hash 293988481, now seen corresponding path program 1 times [2025-02-05 12:10:39,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:39,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964282962] [2025-02-05 12:10:39,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:39,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:39,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 964 statements into 1 equivalence classes. [2025-02-05 12:10:39,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 964 of 964 statements. [2025-02-05 12:10:39,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:39,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-02-05 12:10:39,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:39,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964282962] [2025-02-05 12:10:39,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964282962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:39,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:39,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:39,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264677767] [2025-02-05 12:10:39,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:39,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:39,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:39,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:39,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:39,708 INFO L87 Difference]: Start difference. First operand 20704 states and 24176 transitions. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 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:10:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:41,662 INFO L93 Difference]: Finished difference Result 40716 states and 47656 transitions. [2025-02-05 12:10:41,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:41,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 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 964 [2025-02-05 12:10:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:41,691 INFO L225 Difference]: With dead ends: 40716 [2025-02-05 12:10:41,692 INFO L226 Difference]: Without dead ends: 20014 [2025-02-05 12:10:41,709 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:10:41,710 INFO L435 NwaCegarLoop]: 1084 mSDtfsCounter, 632 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:41,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1091 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 1882 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:10:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20014 states. [2025-02-05 12:10:41,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20014 to 20014. [2025-02-05 12:10:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20014 states, 20013 states have (on average 1.1089291960225853) internal successors, (22193), 20013 states have internal predecessors, (22193), 0 states have call successors, (0), 0 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:10:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20014 states to 20014 states and 22193 transitions. [2025-02-05 12:10:41,941 INFO L78 Accepts]: Start accepts. Automaton has 20014 states and 22193 transitions. Word has length 964 [2025-02-05 12:10:41,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:41,941 INFO L471 AbstractCegarLoop]: Abstraction has 20014 states and 22193 transitions. [2025-02-05 12:10:41,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 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:10:41,942 INFO L276 IsEmpty]: Start isEmpty. Operand 20014 states and 22193 transitions. [2025-02-05 12:10:41,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1018 [2025-02-05 12:10:41,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:41,951 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:10:41,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:10:41,951 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:41,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:41,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2080686103, now seen corresponding path program 1 times [2025-02-05 12:10:41,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:41,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608014412] [2025-02-05 12:10:41,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:41,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:42,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1017 statements into 1 equivalence classes. [2025-02-05 12:10:42,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1017 of 1017 statements. [2025-02-05 12:10:42,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:42,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2025-02-05 12:10:42,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:42,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608014412] [2025-02-05 12:10:42,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608014412] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:10:42,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265242006] [2025-02-05 12:10:42,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:42,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:10:42,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:10:42,686 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:10:42,686 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:10:42,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1017 statements into 1 equivalence classes. [2025-02-05 12:10:42,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1017 of 1017 statements. [2025-02-05 12:10:42,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:42,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:42,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 12:10:42,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:10:43,821 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-05 12:10:43,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:10:43,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265242006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:43,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 12:10:43,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-02-05 12:10:43,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210638883] [2025-02-05 12:10:43,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:43,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:43,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:43,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:43,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:10:43,823 INFO L87 Difference]: Start difference. First operand 20014 states and 22193 transitions. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 2 states have internal predecessors, (521), 0 states have call successors, (0), 0 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:10:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:45,620 INFO L93 Difference]: Finished difference Result 50376 states and 56468 transitions. [2025-02-05 12:10:45,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:45,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 2 states have internal predecessors, (521), 0 states have call successors, (0), 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 1017 [2025-02-05 12:10:45,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:45,660 INFO L225 Difference]: With dead ends: 50376 [2025-02-05 12:10:45,660 INFO L226 Difference]: Without dead ends: 30364 [2025-02-05 12:10:45,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1019 GetRequests, 1016 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:10:45,676 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 183 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1979 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 1979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:45,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 362 Invalid, 2345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 1979 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:10:45,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30364 states. [2025-02-05 12:10:45,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30364 to 26224. [2025-02-05 12:10:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26224 states, 26223 states have (on average 1.1044121572665218) internal successors, (28961), 26223 states have internal predecessors, (28961), 0 states have call successors, (0), 0 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:10:45,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26224 states to 26224 states and 28961 transitions. [2025-02-05 12:10:45,958 INFO L78 Accepts]: Start accepts. Automaton has 26224 states and 28961 transitions. Word has length 1017 [2025-02-05 12:10:45,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:45,959 INFO L471 AbstractCegarLoop]: Abstraction has 26224 states and 28961 transitions. [2025-02-05 12:10:45,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 2 states have internal predecessors, (521), 0 states have call successors, (0), 0 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:10:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 26224 states and 28961 transitions. [2025-02-05 12:10:45,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1050 [2025-02-05 12:10:45,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:45,966 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:10:45,977 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:10:46,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:10:46,167 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:46,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:46,168 INFO L85 PathProgramCache]: Analyzing trace with hash -882740946, now seen corresponding path program 1 times [2025-02-05 12:10:46,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:46,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337608269] [2025-02-05 12:10:46,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:46,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:46,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1049 statements into 1 equivalence classes. [2025-02-05 12:10:46,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1049 of 1049 statements. [2025-02-05 12:10:46,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:46,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:47,217 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-02-05 12:10:47,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:47,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337608269] [2025-02-05 12:10:47,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337608269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:47,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:47,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:47,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416714805] [2025-02-05 12:10:47,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:47,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:47,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:47,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:47,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:47,220 INFO L87 Difference]: Start difference. First operand 26224 states and 28961 transitions. Second operand has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 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:10:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:48,900 INFO L93 Difference]: Finished difference Result 52446 states and 57920 transitions. [2025-02-05 12:10:48,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:48,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 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 1049 [2025-02-05 12:10:48,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:48,939 INFO L225 Difference]: With dead ends: 52446 [2025-02-05 12:10:48,939 INFO L226 Difference]: Without dead ends: 26224 [2025-02-05 12:10:48,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:10:48,957 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 733 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:48,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 780 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:10:48,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26224 states. [2025-02-05 12:10:49,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26224 to 25534. [2025-02-05 12:10:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25534 states, 25533 states have (on average 1.0884345748639017) internal successors, (27791), 25533 states have internal predecessors, (27791), 0 states have call successors, (0), 0 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:10:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25534 states to 25534 states and 27791 transitions. [2025-02-05 12:10:49,252 INFO L78 Accepts]: Start accepts. Automaton has 25534 states and 27791 transitions. Word has length 1049 [2025-02-05 12:10:49,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:49,253 INFO L471 AbstractCegarLoop]: Abstraction has 25534 states and 27791 transitions. [2025-02-05 12:10:49,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 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:10:49,253 INFO L276 IsEmpty]: Start isEmpty. Operand 25534 states and 27791 transitions. [2025-02-05 12:10:49,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1081 [2025-02-05 12:10:49,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:49,268 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:10:49,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 12:10:49,269 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:49,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:49,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1673533464, now seen corresponding path program 1 times [2025-02-05 12:10:49,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:49,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915294508] [2025-02-05 12:10:49,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:49,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:49,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1080 statements into 1 equivalence classes. [2025-02-05 12:10:49,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1080 of 1080 statements. [2025-02-05 12:10:49,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:49,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:50,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 672 proven. 0 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2025-02-05 12:10:50,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:50,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915294508] [2025-02-05 12:10:50,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915294508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:50,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:50,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:50,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103099102] [2025-02-05 12:10:50,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:50,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:50,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:50,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:50,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:50,047 INFO L87 Difference]: Start difference. First operand 25534 states and 27791 transitions. Second operand has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 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:10:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:51,723 INFO L93 Difference]: Finished difference Result 52446 states and 56983 transitions. [2025-02-05 12:10:51,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:51,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 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 1080 [2025-02-05 12:10:51,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:51,757 INFO L225 Difference]: With dead ends: 52446 [2025-02-05 12:10:51,757 INFO L226 Difference]: Without dead ends: 26914 [2025-02-05 12:10:51,774 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:10:51,776 INFO L435 NwaCegarLoop]: 974 mSDtfsCounter, 575 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:51,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 981 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:10:51,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26914 states. [2025-02-05 12:10:51,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26914 to 26914. [2025-02-05 12:10:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26914 states, 26913 states have (on average 1.0698918738156282) internal successors, (28794), 26913 states have internal predecessors, (28794), 0 states have call successors, (0), 0 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:10:51,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26914 states to 26914 states and 28794 transitions. [2025-02-05 12:10:51,978 INFO L78 Accepts]: Start accepts. Automaton has 26914 states and 28794 transitions. Word has length 1080 [2025-02-05 12:10:51,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:51,978 INFO L471 AbstractCegarLoop]: Abstraction has 26914 states and 28794 transitions. [2025-02-05 12:10:51,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 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:10:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 26914 states and 28794 transitions. [2025-02-05 12:10:51,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1134 [2025-02-05 12:10:51,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:51,988 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:10:51,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 12:10:51,989 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:51,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:51,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1088460651, now seen corresponding path program 1 times [2025-02-05 12:10:51,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:51,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305689957] [2025-02-05 12:10:51,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:51,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:52,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1133 statements into 1 equivalence classes. [2025-02-05 12:10:52,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1133 of 1133 statements. [2025-02-05 12:10:52,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:52,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1367 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-02-05 12:10:52,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:52,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305689957] [2025-02-05 12:10:52,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305689957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:52,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:52,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:52,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865565746] [2025-02-05 12:10:52,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:52,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:52,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:52,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:52,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:52,500 INFO L87 Difference]: Start difference. First operand 26914 states and 28794 transitions. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 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:10:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:54,284 INFO L93 Difference]: Finished difference Result 60726 states and 65777 transitions. [2025-02-05 12:10:54,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:54,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 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:10:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:54,319 INFO L225 Difference]: With dead ends: 60726 [2025-02-05 12:10:54,319 INFO L226 Difference]: Without dead ends: 33814 [2025-02-05 12:10:54,347 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:10:54,348 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 645 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 2190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:54,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 932 Invalid, 2190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:10:54,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33814 states. [2025-02-05 12:10:54,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33814 to 33814. [2025-02-05 12:10:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33814 states, 33813 states have (on average 1.0760949930500103) internal successors, (36386), 33813 states have internal predecessors, (36386), 0 states have call successors, (0), 0 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:10:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33814 states to 33814 states and 36386 transitions. [2025-02-05 12:10:54,641 INFO L78 Accepts]: Start accepts. Automaton has 33814 states and 36386 transitions. Word has length 1133 [2025-02-05 12:10:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:54,642 INFO L471 AbstractCegarLoop]: Abstraction has 33814 states and 36386 transitions. [2025-02-05 12:10:54,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 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:10:54,642 INFO L276 IsEmpty]: Start isEmpty. Operand 33814 states and 36386 transitions. [2025-02-05 12:10:54,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1140 [2025-02-05 12:10:54,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:54,658 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:54,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 12:10:54,658 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:54,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:54,659 INFO L85 PathProgramCache]: Analyzing trace with hash -523816890, now seen corresponding path program 1 times [2025-02-05 12:10:54,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:54,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706006750] [2025-02-05 12:10:54,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:54,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:54,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1139 statements into 1 equivalence classes. [2025-02-05 12:10:54,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1139 of 1139 statements. [2025-02-05 12:10:54,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:54,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 570 proven. 555 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2025-02-05 12:10:55,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:55,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706006750] [2025-02-05 12:10:55,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706006750] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:10:55,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905897224] [2025-02-05 12:10:55,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:55,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:10:55,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:10:55,710 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:10:55,711 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:10:55,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1139 statements into 1 equivalence classes. [2025-02-05 12:10:55,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1139 of 1139 statements. [2025-02-05 12:10:55,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:55,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:55,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 12:10:55,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:10:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 659 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-02-05 12:10:56,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:10:56,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905897224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:56,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 12:10:56,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 12:10:56,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619053721] [2025-02-05 12:10:56,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:56,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:56,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:56,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:56,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 12:10:56,050 INFO L87 Difference]: Start difference. First operand 33814 states and 36386 transitions. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 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:10:57,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:10:57,978 INFO L93 Difference]: Finished difference Result 80046 states and 86798 transitions. [2025-02-05 12:10:57,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:10:57,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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 1139 [2025-02-05 12:10:57,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:10:58,019 INFO L225 Difference]: With dead ends: 80046 [2025-02-05 12:10:58,019 INFO L226 Difference]: Without dead ends: 41404 [2025-02-05 12:10:58,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1144 GetRequests, 1139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 12:10:58,045 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 649 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:10:58,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 973 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 1703 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:10:58,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41404 states. [2025-02-05 12:10:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41404 to 40024. [2025-02-05 12:10:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40024 states, 40023 states have (on average 1.0490467980910976) internal successors, (41986), 40023 states have internal predecessors, (41986), 0 states have call successors, (0), 0 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:10:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40024 states to 40024 states and 41986 transitions. [2025-02-05 12:10:58,545 INFO L78 Accepts]: Start accepts. Automaton has 40024 states and 41986 transitions. Word has length 1139 [2025-02-05 12:10:58,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:10:58,546 INFO L471 AbstractCegarLoop]: Abstraction has 40024 states and 41986 transitions. [2025-02-05 12:10:58,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 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:10:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 40024 states and 41986 transitions. [2025-02-05 12:10:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1230 [2025-02-05 12:10:58,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:10:58,569 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:10:58,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 12:10:58,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:10:58,770 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:10:58,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:10:58,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1166537036, now seen corresponding path program 1 times [2025-02-05 12:10:58,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:10:58,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181183879] [2025-02-05 12:10:58,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:10:58,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:10:58,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1229 statements into 1 equivalence classes. [2025-02-05 12:10:58,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1229 of 1229 statements. [2025-02-05 12:10:58,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:10:58,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:10:59,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1555 backedges. 953 proven. 0 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2025-02-05 12:10:59,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:10:59,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181183879] [2025-02-05 12:10:59,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181183879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:10:59,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:10:59,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:10:59,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070198769] [2025-02-05 12:10:59,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:10:59,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:10:59,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:10:59,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:10:59,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:10:59,510 INFO L87 Difference]: Start difference. First operand 40024 states and 41986 transitions. Second operand has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 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:11:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:11:01,106 INFO L93 Difference]: Finished difference Result 86256 states and 90692 transitions. [2025-02-05 12:11:01,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:11:01,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 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 1229 [2025-02-05 12:11:01,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:11:01,152 INFO L225 Difference]: With dead ends: 86256 [2025-02-05 12:11:01,152 INFO L226 Difference]: Without dead ends: 46234 [2025-02-05 12:11:01,178 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:11:01,178 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 626 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:11:01,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 967 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:11:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46234 states. [2025-02-05 12:11:01,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46234 to 46234. [2025-02-05 12:11:01,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46234 states, 46233 states have (on average 1.0477364652953518) internal successors, (48440), 46233 states have internal predecessors, (48440), 0 states have call successors, (0), 0 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:11:01,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46234 states to 46234 states and 48440 transitions. [2025-02-05 12:11:01,681 INFO L78 Accepts]: Start accepts. Automaton has 46234 states and 48440 transitions. Word has length 1229 [2025-02-05 12:11:01,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:11:01,682 INFO L471 AbstractCegarLoop]: Abstraction has 46234 states and 48440 transitions. [2025-02-05 12:11:01,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 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:11:01,682 INFO L276 IsEmpty]: Start isEmpty. Operand 46234 states and 48440 transitions. [2025-02-05 12:11:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1329 [2025-02-05 12:11:01,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:11:01,697 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, 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, 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:01,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 12:11:01,697 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:11:01,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:11:01,698 INFO L85 PathProgramCache]: Analyzing trace with hash -881789794, now seen corresponding path program 1 times [2025-02-05 12:11:01,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:11:01,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974556963] [2025-02-05 12:11:01,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:11:01,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:11:01,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1328 statements into 1 equivalence classes. [2025-02-05 12:11:01,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1328 of 1328 statements. [2025-02-05 12:11:01,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:11:01,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:11:02,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2031 backedges. 1297 proven. 0 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2025-02-05 12:11:02,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:11:02,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974556963] [2025-02-05 12:11:02,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974556963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:11:02,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:11:02,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:11:02,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888261826] [2025-02-05 12:11:02,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:11:02,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:11:02,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:11:02,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:11:02,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:11:02,438 INFO L87 Difference]: Start difference. First operand 46234 states and 48440 transitions. Second operand has 3 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 0 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:11:04,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:11:04,159 INFO L93 Difference]: Finished difference Result 91776 states and 96187 transitions. [2025-02-05 12:11:04,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:11:04,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 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 1328 [2025-02-05 12:11:04,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:11:04,208 INFO L225 Difference]: With dead ends: 91776 [2025-02-05 12:11:04,209 INFO L226 Difference]: Without dead ends: 46234 [2025-02-05 12:11:04,237 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:11:04,238 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 503 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:11:04,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 928 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:11:04,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46234 states. [2025-02-05 12:11:04,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46234 to 46234. [2025-02-05 12:11:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46234 states, 46233 states have (on average 1.041766703436939) internal successors, (48164), 46233 states have internal predecessors, (48164), 0 states have call successors, (0), 0 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:11:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46234 states to 46234 states and 48164 transitions. [2025-02-05 12:11:04,970 INFO L78 Accepts]: Start accepts. Automaton has 46234 states and 48164 transitions. Word has length 1328 [2025-02-05 12:11:04,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:11:04,970 INFO L471 AbstractCegarLoop]: Abstraction has 46234 states and 48164 transitions. [2025-02-05 12:11:04,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 0 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:11:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 46234 states and 48164 transitions. [2025-02-05 12:11:04,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1373 [2025-02-05 12:11:04,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:11:04,989 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:04,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 12:11:04,989 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:11:04,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:11:04,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1577017177, now seen corresponding path program 1 times [2025-02-05 12:11:04,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:11:04,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760334187] [2025-02-05 12:11:04,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:11:04,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:11:05,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1372 statements into 1 equivalence classes. [2025-02-05 12:11:05,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1372 of 1372 statements. [2025-02-05 12:11:05,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:11:05,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:11:05,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2161 backedges. 1376 proven. 0 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2025-02-05 12:11:05,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:11:05,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760334187] [2025-02-05 12:11:05,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760334187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:11:05,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:11:05,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:11:05,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720854640] [2025-02-05 12:11:05,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:11:05,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:11:05,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:11:05,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:11:05,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:11:05,595 INFO L87 Difference]: Start difference. First operand 46234 states and 48164 transitions. Second operand has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 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:11:07,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:11:07,341 INFO L93 Difference]: Finished difference Result 102126 states and 106723 transitions. [2025-02-05 12:11:07,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:11:07,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 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 1372 [2025-02-05 12:11:07,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:11:07,429 INFO L225 Difference]: With dead ends: 102126 [2025-02-05 12:11:07,429 INFO L226 Difference]: Without dead ends: 56584 [2025-02-05 12:11:07,448 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:11:07,450 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 456 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:11:07,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 966 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:11:07,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56584 states. [2025-02-05 12:11:07,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56584 to 55894. [2025-02-05 12:11:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55894 states, 55893 states have (on average 1.03896731254361) internal successors, (58071), 55893 states have internal predecessors, (58071), 0 states have call successors, (0), 0 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:11:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55894 states to 55894 states and 58071 transitions. [2025-02-05 12:11:08,057 INFO L78 Accepts]: Start accepts. Automaton has 55894 states and 58071 transitions. Word has length 1372 [2025-02-05 12:11:08,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:11:08,058 INFO L471 AbstractCegarLoop]: Abstraction has 55894 states and 58071 transitions. [2025-02-05 12:11:08,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 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:11:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 55894 states and 58071 transitions. [2025-02-05 12:11:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1402 [2025-02-05 12:11:08,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:11:08,091 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:11:08,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 12:11:08,091 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:11:08,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:11:08,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1603335697, now seen corresponding path program 1 times [2025-02-05 12:11:08,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:11:08,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014109406] [2025-02-05 12:11:08,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:11:08,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:11:08,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1401 statements into 1 equivalence classes. [2025-02-05 12:11:08,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1401 of 1401 statements. [2025-02-05 12:11:08,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:11:08,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:11:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2325 backedges. 1534 proven. 0 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2025-02-05 12:11:09,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:11:09,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014109406] [2025-02-05 12:11:09,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014109406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:11:09,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:11:09,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:11:09,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269705697] [2025-02-05 12:11:09,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:11:09,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:11:09,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:11:09,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:11:09,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:11:09,171 INFO L87 Difference]: Start difference. First operand 55894 states and 58071 transitions. Second operand has 4 states, 4 states have (on average 205.5) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 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:11:11,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:11:11,251 INFO L93 Difference]: Finished difference Result 117306 states and 122096 transitions. [2025-02-05 12:11:11,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:11:11,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 205.5) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 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 1401 [2025-02-05 12:11:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:11:11,318 INFO L225 Difference]: With dead ends: 117306 [2025-02-05 12:11:11,319 INFO L226 Difference]: Without dead ends: 62104 [2025-02-05 12:11:11,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:11:11,362 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 986 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2681 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 2681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:11:11,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 69 Invalid, 2997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 2681 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:11:11,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62104 states. [2025-02-05 12:11:11,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62104 to 61414. [2025-02-05 12:11:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61414 states, 61413 states have (on average 1.039193656066305) internal successors, (63820), 61413 states have internal predecessors, (63820), 0 states have call successors, (0), 0 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:11:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61414 states to 61414 states and 63820 transitions. [2025-02-05 12:11:12,066 INFO L78 Accepts]: Start accepts. Automaton has 61414 states and 63820 transitions. Word has length 1401 [2025-02-05 12:11:12,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:11:12,067 INFO L471 AbstractCegarLoop]: Abstraction has 61414 states and 63820 transitions. [2025-02-05 12:11:12,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 205.5) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 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:11:12,067 INFO L276 IsEmpty]: Start isEmpty. Operand 61414 states and 63820 transitions. [2025-02-05 12:11:12,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1481 [2025-02-05 12:11:12,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:11:12,101 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2025-02-05 12:11:12,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 12:11:12,101 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:11:12,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:11:12,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1739295378, now seen corresponding path program 1 times [2025-02-05 12:11:12,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:11:12,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514603824] [2025-02-05 12:11:12,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:11:12,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:11:12,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1480 statements into 1 equivalence classes. [2025-02-05 12:11:12,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1480 of 1480 statements. [2025-02-05 12:11:12,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:11:12,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:11:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2893 backedges. 936 proven. 0 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2025-02-05 12:11:14,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:11:14,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514603824] [2025-02-05 12:11:14,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514603824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:11:14,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:11:14,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:11:14,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838309643] [2025-02-05 12:11:14,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:11:14,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:11:14,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:11:14,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:11:14,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:11:14,786 INFO L87 Difference]: Start difference. First operand 61414 states and 63820 transitions. Second operand has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 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:11:16,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:11:16,429 INFO L93 Difference]: Finished difference Result 123516 states and 128348 transitions. [2025-02-05 12:11:16,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:11:16,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 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 1480 [2025-02-05 12:11:16,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:11:16,487 INFO L225 Difference]: With dead ends: 123516 [2025-02-05 12:11:16,488 INFO L226 Difference]: Without dead ends: 62104 [2025-02-05 12:11:16,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:11:16,522 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 645 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:11:16,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 762 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:11:16,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62104 states. [2025-02-05 12:11:16,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62104 to 61414. [2025-02-05 12:11:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61414 states, 61413 states have (on average 1.0356927686320485) internal successors, (63605), 61413 states have internal predecessors, (63605), 0 states have call successors, (0), 0 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:11:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61414 states to 61414 states and 63605 transitions. [2025-02-05 12:11:16,980 INFO L78 Accepts]: Start accepts. Automaton has 61414 states and 63605 transitions. Word has length 1480 [2025-02-05 12:11:16,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:11:16,981 INFO L471 AbstractCegarLoop]: Abstraction has 61414 states and 63605 transitions. [2025-02-05 12:11:16,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 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:11:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand 61414 states and 63605 transitions. [2025-02-05 12:11:17,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1522 [2025-02-05 12:11:17,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:11:17,001 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:17,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 12:11:17,001 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:11:17,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:11:17,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1137099088, now seen corresponding path program 1 times [2025-02-05 12:11:17,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:11:17,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939757560] [2025-02-05 12:11:17,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:11:17,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:11:17,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1521 statements into 1 equivalence classes. [2025-02-05 12:11:17,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1521 of 1521 statements. [2025-02-05 12:11:17,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:11:17,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:11:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2717 backedges. 1685 proven. 0 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2025-02-05 12:11:18,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:11:18,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939757560] [2025-02-05 12:11:18,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939757560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:11:18,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:11:18,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:11:18,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695510878] [2025-02-05 12:11:18,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:11:18,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:11:18,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:11:18,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:11:18,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:11:18,688 INFO L87 Difference]: Start difference. First operand 61414 states and 63605 transitions. Second operand has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 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:11:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:11:20,274 INFO L93 Difference]: Finished difference Result 120066 states and 124403 transitions. [2025-02-05 12:11:20,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:11:20,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 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 1521 [2025-02-05 12:11:20,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:11:20,346 INFO L225 Difference]: With dead ends: 120066 [2025-02-05 12:11:20,346 INFO L226 Difference]: Without dead ends: 59344 [2025-02-05 12:11:20,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:11:20,386 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 445 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:11:20,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 155 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:11:20,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59344 states. [2025-02-05 12:11:20,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59344 to 57274. [2025-02-05 12:11:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57274 states, 57273 states have (on average 1.0255617830391284) internal successors, (58737), 57273 states have internal predecessors, (58737), 0 states have call successors, (0), 0 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:11:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57274 states to 57274 states and 58737 transitions. [2025-02-05 12:11:21,060 INFO L78 Accepts]: Start accepts. Automaton has 57274 states and 58737 transitions. Word has length 1521 [2025-02-05 12:11:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:11:21,061 INFO L471 AbstractCegarLoop]: Abstraction has 57274 states and 58737 transitions. [2025-02-05 12:11:21,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 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:11:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 57274 states and 58737 transitions. [2025-02-05 12:11:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1535 [2025-02-05 12:11:21,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:11:21,137 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:11:21,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 12:11:21,138 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:11:21,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:11:21,139 INFO L85 PathProgramCache]: Analyzing trace with hash 33187469, now seen corresponding path program 1 times [2025-02-05 12:11:21,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:11:21,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059620083] [2025-02-05 12:11:21,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:11:21,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:11:21,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1534 statements into 1 equivalence classes. [2025-02-05 12:11:21,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1534 of 1534 statements. [2025-02-05 12:11:21,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:11:21,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:11:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 1804 proven. 0 refuted. 0 times theorem prover too weak. 1577 trivial. 0 not checked. [2025-02-05 12:11:21,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:11:21,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059620083] [2025-02-05 12:11:21,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059620083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:11:21,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:11:21,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:11:21,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120433920] [2025-02-05 12:11:21,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:11:21,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:11:21,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:11:21,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:11:21,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:11:21,989 INFO L87 Difference]: Start difference. First operand 57274 states and 58737 transitions. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 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:11:23,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:11:23,460 INFO L93 Difference]: Finished difference Result 115926 states and 118871 transitions. [2025-02-05 12:11:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:11:23,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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 1534 [2025-02-05 12:11:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:11:23,516 INFO L225 Difference]: With dead ends: 115926 [2025-02-05 12:11:23,517 INFO L226 Difference]: Without dead ends: 57964 [2025-02-05 12:11:23,552 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:11:23,553 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 625 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:11:23,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 945 Invalid, 2004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 12:11:23,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57964 states. [2025-02-05 12:11:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57964 to 56584. [2025-02-05 12:11:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56584 states, 56583 states have (on average 1.020712934980471) internal successors, (57755), 56583 states have internal predecessors, (57755), 0 states have call successors, (0), 0 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:11:24,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56584 states to 56584 states and 57755 transitions. [2025-02-05 12:11:24,200 INFO L78 Accepts]: Start accepts. Automaton has 56584 states and 57755 transitions. Word has length 1534 [2025-02-05 12:11:24,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:11:24,201 INFO L471 AbstractCegarLoop]: Abstraction has 56584 states and 57755 transitions. [2025-02-05 12:11:24,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 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:11:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 56584 states and 57755 transitions. [2025-02-05 12:11:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1605 [2025-02-05 12:11:24,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:11:24,258 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:11:24,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 12:11:24,258 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:11:24,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:11:24,263 INFO L85 PathProgramCache]: Analyzing trace with hash 493469790, now seen corresponding path program 1 times [2025-02-05 12:11:24,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:11:24,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468461465] [2025-02-05 12:11:24,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:11:24,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:11:24,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1604 statements into 1 equivalence classes. [2025-02-05 12:11:24,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1604 of 1604 statements. [2025-02-05 12:11:24,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:11:24,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:11:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3769 backedges. 2372 proven. 0 refuted. 0 times theorem prover too weak. 1397 trivial. 0 not checked. [2025-02-05 12:11:25,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:11:25,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468461465] [2025-02-05 12:11:25,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468461465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:11:25,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:11:25,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:11:25,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014928750] [2025-02-05 12:11:25,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:11:25,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:11:25,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:11:25,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:11:25,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:11:25,048 INFO L87 Difference]: Start difference. First operand 56584 states and 57755 transitions. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 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:11:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:11:26,811 INFO L93 Difference]: Finished difference Result 138004 states and 141005 transitions. [2025-02-05 12:11:26,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:11:26,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 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 1604 [2025-02-05 12:11:26,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:11:26,813 INFO L225 Difference]: With dead ends: 138004 [2025-02-05 12:11:26,813 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 12:11:26,867 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:11:26,868 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 541 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:11:26,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 900 Invalid, 1979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:11:26,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 12:11:26,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 12:11:26,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 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:11:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 12:11:26,870 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1604 [2025-02-05 12:11:26,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:11:26,870 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 12:11:26,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 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:11:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 12:11:26,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 12:11:26,873 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 12:11:26,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 12:11:26,879 INFO L422 BasicCegarLoop]: Path program histogram: [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:11:26,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 12:11:28,687 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 12:11:28,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 12:11:28 BoogieIcfgContainer [2025-02-05 12:11:28,701 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 12:11:28,702 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 12:11:28,702 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 12:11:28,702 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 12:11:28,702 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:10:19" (3/4) ... [2025-02-05 12:11:28,704 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 12:11:28,743 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-05 12:11:28,755 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 12:11:28,762 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 12:11:28,770 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 12:11:28,994 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 12:11:28,995 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 12:11:28,995 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 12:11:28,996 INFO L158 Benchmark]: Toolchain (without parser) took 74068.59ms. Allocated memory was 167.8MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 112.9MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-02-05 12:11:28,996 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 12:11:28,997 INFO L158 Benchmark]: CACSL2BoogieTranslator took 864.62ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 82.5MB in the end (delta: 30.5MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. [2025-02-05 12:11:28,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 182.34ms. Allocated memory is still 167.8MB. Free memory was 82.5MB in the beginning and 98.0MB in the end (delta: -15.5MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2025-02-05 12:11:28,997 INFO L158 Benchmark]: Boogie Preprocessor took 233.32ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 88.4MB in the end (delta: 9.5MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. [2025-02-05 12:11:28,998 INFO L158 Benchmark]: IcfgBuilder took 3066.51ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 88.4MB in the beginning and 339.4MB in the end (delta: -251.0MB). Peak memory consumption was 263.7MB. Max. memory is 16.1GB. [2025-02-05 12:11:28,999 INFO L158 Benchmark]: TraceAbstraction took 69417.52ms. Allocated memory was 436.2MB in the beginning and 3.7GB in the end (delta: 3.3GB). Free memory was 339.4MB in the beginning and 2.5GB in the end (delta: -2.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-02-05 12:11:28,999 INFO L158 Benchmark]: Witness Printer took 293.98ms. Allocated memory is still 3.7GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 47.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 12:11:28,999 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 864.62ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 82.5MB in the end (delta: 30.5MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 182.34ms. Allocated memory is still 167.8MB. Free memory was 82.5MB in the beginning and 98.0MB in the end (delta: -15.5MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 233.32ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 88.4MB in the end (delta: 9.5MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. * IcfgBuilder took 3066.51ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 88.4MB in the beginning and 339.4MB in the end (delta: -251.0MB). Peak memory consumption was 263.7MB. Max. memory is 16.1GB. * TraceAbstraction took 69417.52ms. Allocated memory was 436.2MB in the beginning and 3.7GB in the end (delta: 3.3GB). Free memory was 339.4MB in the beginning and 2.5GB in the end (delta: -2.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 293.98ms. Allocated memory is still 3.7GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 47.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 211]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 757 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.5s, OverallIterations: 21, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 41.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13580 SdHoareTripleChecker+Valid, 36.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13580 mSDsluCounter, 13794 SdHoareTripleChecker+Invalid, 30.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 8122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42397 IncrementalHoareTripleChecker+Invalid, 50519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8122 mSolverCounterUnsat, 13640 mSDtfsCounter, 42397 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2230 GetRequests, 2199 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61414occurred in iteration=17, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 13800 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 22878 NumberOfCodeBlocks, 22878 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 22855 ConstructedInterpolants, 0 QuantifiedInterpolants, 45074 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2485 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 23 InterpolantComputations, 21 PerfectInterpolantSequences, 30399/30963 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4269]: Location Invariant Derived location invariant: ((((((((((((((((((((((((a24 <= 3) && (a18 <= 9)) || (((a24 == 3) && (307 <= a3)) && (a18 == 11))) || ((a24 == 0) && (a15 <= 4))) || (((5 == a15) && (a18 == 10)) && (a24 == 4))) || (((5 == a15) && (a18 == 11)) && (a24 == 4))) || (((a15 <= 4) && (a24 <= 1)) && (a3 <= 99))) || ((a24 == 3) && (a18 == 12))) || ((((5 == a15) && (a18 == 12)) && (a24 == 4)) && (a3 <= 99))) || (((a24 == 3) && (5 == a15)) && (a18 == 11))) || (((a24 == 3) && (307 <= a3)) && (a18 == 10))) || (((a18 == 10) && (a24 <= 3)) && (a24 != 3))) || (((a15 != 4) && (a24 <= 3)) && (a18 == 12))) || (((a15 <= 4) && (a18 == 10)) && (a24 == 4))) || (((a24 == 1) && (307 <= a3)) && (a15 <= 4))) || (((a18 == 11) && (a24 <= 3)) && (a24 != 3))) || (((a24 == 1) && (a3 <= 99)) && (5 != a15))) || (((a15 <= 4) && (a18 == 12)) && (a24 == 4))) || (((a15 <= 4) && (a18 == 11)) && (a24 == 4))) || ((((5 == a15) && (307 <= a3)) && (a24 == 4)) && (a18 <= 9))) || (((a15 <= 4) && (a24 == 4)) && (a18 <= 9))) || (((a24 == 3) && (a18 == 10)) && (5 != a15))) || (((a24 == 3) && (a15 <= 4)) && (a18 == 11))) || (((a24 == 0) && (a3 <= 99)) && (5 != a15))) RESULT: Ultimate proved your program to be correct! [2025-02-05 12:11:29,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE