./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label46.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/Problem12_label46.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 1c2312716e6fa6f39794093b35b73580b35ed138a1f875dde4c4286d98110cb3
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 11:39:24,893 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 11:39:24,941 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 11:39:24,945 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 11:39:24,948 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 11:39:24,961 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 11:39:24,962 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 11:39:24,963 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 11:39:24,963 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 11:39:24,963 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 11:39:24,963 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 11:39:24,963 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 11:39:24,964 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 11:39:24,964 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 11:39:24,964 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 11:39:24,964 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 11:39:24,965 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 11:39:24,965 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 11:39:24,965 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 11:39:24,965 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 11:39:24,966 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 11:39:24,966 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 11:39:24,966 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 11:39:24,966 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 11:39:24,966 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 11:39:24,966 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 11:39:24,966 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 11:39:24,966 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 11:39:24,966 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 11:39:24,966 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 11:39:24,966 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 11:39:24,966 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 11:39:24,966 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:39:24,966 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 11:39:24,967 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 11:39:24,967 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 11:39:24,967 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 11:39:24,967 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 11:39:24,967 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 11:39:24,967 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 11:39:24,967 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 11:39:24,967 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 11:39:24,967 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 11:39:24,967 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 -> 1c2312716e6fa6f39794093b35b73580b35ed138a1f875dde4c4286d98110cb3
[2025-02-05 11:39:25,219 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 11:39:25,226 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 11:39:25,228 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 11:39:25,229 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 11:39:25,229 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 11:39:25,230 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label46.c
[2025-02-05 11:39:26,328 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4160c923a/ad7c63cb448a46ed96614576ce7b4ada/FLAG3a352eb5d
[2025-02-05 11:39:26,831 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 11:39:26,832 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label46.c
[2025-02-05 11:39:26,860 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4160c923a/ad7c63cb448a46ed96614576ce7b4ada/FLAG3a352eb5d
[2025-02-05 11:39:26,919 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4160c923a/ad7c63cb448a46ed96614576ce7b4ada
[2025-02-05 11:39:26,922 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 11:39:26,924 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 11:39:26,925 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 11:39:26,925 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 11:39:26,928 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 11:39:26,928 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:39:26" (1/1) ...
[2025-02-05 11:39:26,929 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@480f5233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:26, skipping insertion in model container
[2025-02-05 11:39:26,929 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:39:26" (1/1) ...
[2025-02-05 11:39:27,011 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 11:39:27,200 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/Problem12_label46.c[7526,7539]
[2025-02-05 11:39:27,610 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:39:27,619 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 11:39:27,637 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/Problem12_label46.c[7526,7539]
[2025-02-05 11:39:27,872 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:39:27,889 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 11:39:27,890 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:27 WrapperNode
[2025-02-05 11:39:27,890 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 11:39:27,891 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 11:39:27,891 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 11:39:27,891 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 11:39:27,895 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:27" (1/1) ...
[2025-02-05 11:39:27,941 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:27" (1/1) ...
[2025-02-05 11:39:28,196 INFO  L138                Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758
[2025-02-05 11:39:28,197 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 11:39:28,197 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 11:39:28,198 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 11:39:28,198 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 11:39:28,204 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:27" (1/1) ...
[2025-02-05 11:39:28,204 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:27" (1/1) ...
[2025-02-05 11:39:28,238 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:27" (1/1) ...
[2025-02-05 11:39:28,346 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 11:39:28,346 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:27" (1/1) ...
[2025-02-05 11:39:28,346 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:27" (1/1) ...
[2025-02-05 11:39:28,459 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:27" (1/1) ...
[2025-02-05 11:39:28,479 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:27" (1/1) ...
[2025-02-05 11:39:28,500 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:27" (1/1) ...
[2025-02-05 11:39:28,517 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:27" (1/1) ...
[2025-02-05 11:39:28,573 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 11:39:28,574 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 11:39:28,574 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 11:39:28,575 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 11:39:28,575 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:27" (1/1) ...
[2025-02-05 11:39:28,579 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:39:28,588 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:39:28,600 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 11:39:28,605 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 11:39:28,621 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 11:39:28,621 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 11:39:28,621 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 11:39:28,622 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 11:39:28,675 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 11:39:28,676 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 11:39:31,938 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1;
[2025-02-05 11:39:31,939 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1;
[2025-02-05 11:39:31,939 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1;
[2025-02-05 11:39:32,046 INFO  L?                        ?]: Removed 702 outVars from TransFormulas that were not future-live.
[2025-02-05 11:39:32,046 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 11:39:32,071 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 11:39:32,071 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 11:39:32,071 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:39:32 BoogieIcfgContainer
[2025-02-05 11:39:32,071 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 11:39:32,080 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 11:39:32,080 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 11:39:32,083 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 11:39:32,088 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:39:26" (1/3) ...
[2025-02-05 11:39:32,088 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b464536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:39:32, skipping insertion in model container
[2025-02-05 11:39:32,088 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:39:27" (2/3) ...
[2025-02-05 11:39:32,088 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b464536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:39:32, skipping insertion in model container
[2025-02-05 11:39:32,089 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:39:32" (3/3) ...
[2025-02-05 11:39:32,089 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem12_label46.c
[2025-02-05 11:39:32,104 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 11:39:32,105 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label46.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 11:39:32,174 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 11:39:32,182 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;@456bcb72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 11:39:32,182 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 11:39:32,187 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 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 11:39:32,191 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2025-02-05 11:39:32,192 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:39:32,192 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]
[2025-02-05 11:39:32,192 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:39:32,196 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:39:32,196 INFO  L85        PathProgramCache]: Analyzing trace with hash 394579166, now seen corresponding path program 1 times
[2025-02-05 11:39:32,201 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:39:32,202 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683086627]
[2025-02-05 11:39:32,202 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:39:32,202 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:39:32,253 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes.
[2025-02-05 11:39:32,278 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements.
[2025-02-05 11:39:32,279 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:39:32,279 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:39:32,478 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 11:39:32,479 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:39:32,479 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683086627]
[2025-02-05 11:39:32,480 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683086627] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:39:32,480 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:39:32,480 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:39:32,481 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722617150]
[2025-02-05 11:39:32,482 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:39:32,485 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:39:32,485 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:39:32,499 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:39:32,499 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:39:32,503 INFO  L87              Difference]: Start difference. First operand  has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 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 11:39:35,300 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:39:35,301 INFO  L93              Difference]: Finished difference Result 2388 states and 4626 transitions.
[2025-02-05 11:39:35,302 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:39:35,303 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 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 61
[2025-02-05 11:39:35,303 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:39:35,319 INFO  L225             Difference]: With dead ends: 2388
[2025-02-05 11:39:35,319 INFO  L226             Difference]: Without dead ends: 1506
[2025-02-05 11:39:35,323 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 11:39:35,325 INFO  L435           NwaCegarLoop]: 92 mSDtfsCounter, 798 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:39:35,327 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 102 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2025-02-05 11:39:35,343 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1506 states.
[2025-02-05 11:39:35,413 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506.
[2025-02-05 11:39:35,416 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1506 states, 1505 states have (on average 1.869767441860465) internal successors, (2814), 1505 states have internal predecessors, (2814), 0 states have call successors, (0), 0 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 11:39:35,424 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2814 transitions.
[2025-02-05 11:39:35,426 INFO  L78                 Accepts]: Start accepts. Automaton has 1506 states and 2814 transitions. Word has length 61
[2025-02-05 11:39:35,427 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:39:35,427 INFO  L471      AbstractCegarLoop]: Abstraction has 1506 states and 2814 transitions.
[2025-02-05 11:39:35,427 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 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 11:39:35,427 INFO  L276                IsEmpty]: Start isEmpty. Operand 1506 states and 2814 transitions.
[2025-02-05 11:39:35,430 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-02-05 11:39:35,430 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:39:35,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:39:35,430 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 11:39:35,430 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:39:35,431 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:39:35,431 INFO  L85        PathProgramCache]: Analyzing trace with hash 424137216, now seen corresponding path program 1 times
[2025-02-05 11:39:35,431 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:39:35,431 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442763927]
[2025-02-05 11:39:35,431 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:39:35,431 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:39:35,448 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-02-05 11:39:35,470 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-02-05 11:39:35,472 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:39:35,472 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:39:35,746 INFO  L134       CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:39:35,746 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:39:35,746 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442763927]
[2025-02-05 11:39:35,746 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442763927] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:39:35,747 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:39:35,747 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:39:35,747 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74975840]
[2025-02-05 11:39:35,747 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:39:35,748 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:39:35,748 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:39:35,748 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:39:35,748 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:39:35,748 INFO  L87              Difference]: Start difference. First operand 1506 states and 2814 transitions. Second operand  has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 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 11:39:39,566 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:39:39,567 INFO  L93              Difference]: Finished difference Result 5271 states and 9820 transitions.
[2025-02-05 11:39:39,567 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 11:39:39,567 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 134
[2025-02-05 11:39:39,567 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:39:39,579 INFO  L225             Difference]: With dead ends: 5271
[2025-02-05 11:39:39,579 INFO  L226             Difference]: Without dead ends: 3767
[2025-02-05 11:39:39,582 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 11:39:39,584 INFO  L435           NwaCegarLoop]: 182 mSDtfsCounter, 2296 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3612 mSolverCounterSat, 1535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2296 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 5147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1535 IncrementalHoareTripleChecker+Valid, 3612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:39:39,584 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2296 Valid, 199 Invalid, 5147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1535 Valid, 3612 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time]
[2025-02-05 11:39:39,589 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3767 states.
[2025-02-05 11:39:39,640 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3767 to 3759.
[2025-02-05 11:39:39,645 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3759 states, 3758 states have (on average 1.6120276742948376) internal successors, (6058), 3758 states have internal predecessors, (6058), 0 states have call successors, (0), 0 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 11:39:39,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 6058 transitions.
[2025-02-05 11:39:39,650 INFO  L78                 Accepts]: Start accepts. Automaton has 3759 states and 6058 transitions. Word has length 134
[2025-02-05 11:39:39,651 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:39:39,652 INFO  L471      AbstractCegarLoop]: Abstraction has 3759 states and 6058 transitions.
[2025-02-05 11:39:39,652 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 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 11:39:39,652 INFO  L276                IsEmpty]: Start isEmpty. Operand 3759 states and 6058 transitions.
[2025-02-05 11:39:39,654 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 203
[2025-02-05 11:39:39,657 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:39:39,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:39:39,658 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 11:39:39,658 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:39:39,658 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:39:39,658 INFO  L85        PathProgramCache]: Analyzing trace with hash 826811498, now seen corresponding path program 1 times
[2025-02-05 11:39:39,658 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:39:39,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521340503]
[2025-02-05 11:39:39,659 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:39:39,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:39:39,685 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes.
[2025-02-05 11:39:39,706 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements.
[2025-02-05 11:39:39,706 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:39:39,707 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:39:40,104 INFO  L134       CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-02-05 11:39:40,106 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:39:40,106 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521340503]
[2025-02-05 11:39:40,106 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521340503] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:39:40,106 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505192702]
[2025-02-05 11:39:40,106 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:39:40,106 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:39:40,106 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:39:40,110 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 11:39:40,113 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 11:39:40,161 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes.
[2025-02-05 11:39:40,192 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements.
[2025-02-05 11:39:40,193 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:39:40,193 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:39:40,195 INFO  L256         TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:39:40,200 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:39:40,407 INFO  L134       CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked.
[2025-02-05 11:39:40,407 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:39:40,409 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505192702] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:39:40,409 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:39:40,409 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-02-05 11:39:40,409 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122059852]
[2025-02-05 11:39:40,409 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:39:40,410 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:39:40,411 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:39:40,411 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:39:40,411 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:39:40,411 INFO  L87              Difference]: Start difference. First operand 3759 states and 6058 transitions. Second operand  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 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 11:39:42,462 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:39:42,462 INFO  L93              Difference]: Finished difference Result 9769 states and 15358 transitions.
[2025-02-05 11:39:42,462 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:39:42,463 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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 202
[2025-02-05 11:39:42,463 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:39:42,484 INFO  L225             Difference]: With dead ends: 9769
[2025-02-05 11:39:42,484 INFO  L226             Difference]: Without dead ends: 6012
[2025-02-05 11:39:42,487 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 201 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 11:39:42,489 INFO  L435           NwaCegarLoop]: 666 mSDtfsCounter, 619 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2460 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 2877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 2460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:39:42,490 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 673 Invalid, 2877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 2460 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 11:39:42,496 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6012 states.
[2025-02-05 11:39:42,554 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 5261.
[2025-02-05 11:39:42,561 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5261 states, 5260 states have (on average 1.5376425855513307) internal successors, (8088), 5260 states have internal predecessors, (8088), 0 states have call successors, (0), 0 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 11:39:42,568 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 8088 transitions.
[2025-02-05 11:39:42,568 INFO  L78                 Accepts]: Start accepts. Automaton has 5261 states and 8088 transitions. Word has length 202
[2025-02-05 11:39:42,569 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:39:42,569 INFO  L471      AbstractCegarLoop]: Abstraction has 5261 states and 8088 transitions.
[2025-02-05 11:39:42,570 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 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 11:39:42,570 INFO  L276                IsEmpty]: Start isEmpty. Operand 5261 states and 8088 transitions.
[2025-02-05 11:39:42,572 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 208
[2025-02-05 11:39:42,575 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:39:42,575 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:39:42,585 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-05 11:39:42,776 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:39:42,776 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:39:42,777 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:39:42,777 INFO  L85        PathProgramCache]: Analyzing trace with hash 1819691656, now seen corresponding path program 1 times
[2025-02-05 11:39:42,777 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:39:42,778 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256770169]
[2025-02-05 11:39:42,778 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:39:42,778 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:39:42,791 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes.
[2025-02-05 11:39:42,801 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements.
[2025-02-05 11:39:42,801 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:39:42,801 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:39:43,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 187 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2025-02-05 11:39:43,020 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:39:43,020 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256770169]
[2025-02-05 11:39:43,020 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256770169] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:39:43,020 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:39:43,020 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:39:43,021 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845707645]
[2025-02-05 11:39:43,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:39:43,022 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:39:43,022 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:39:43,023 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:39:43,023 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:39:43,023 INFO  L87              Difference]: Start difference. First operand 5261 states and 8088 transitions. Second operand  has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 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 11:39:45,866 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:39:45,866 INFO  L93              Difference]: Finished difference Result 15063 states and 23539 transitions.
[2025-02-05 11:39:45,867 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:39:45,867 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207
[2025-02-05 11:39:45,867 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:39:45,890 INFO  L225             Difference]: With dead ends: 15063
[2025-02-05 11:39:45,891 INFO  L226             Difference]: Without dead ends: 9767
[2025-02-05 11:39:45,897 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 11:39:45,899 INFO  L435           NwaCegarLoop]: 694 mSDtfsCounter, 688 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 4468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:39:45,901 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 712 Invalid, 4468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2025-02-05 11:39:45,909 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9767 states.
[2025-02-05 11:39:46,008 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767.
[2025-02-05 11:39:46,020 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9767 states, 9766 states have (on average 1.3098505017407331) internal successors, (12792), 9766 states have internal predecessors, (12792), 0 states have call successors, (0), 0 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 11:39:46,032 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12792 transitions.
[2025-02-05 11:39:46,032 INFO  L78                 Accepts]: Start accepts. Automaton has 9767 states and 12792 transitions. Word has length 207
[2025-02-05 11:39:46,033 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:39:46,033 INFO  L471      AbstractCegarLoop]: Abstraction has 9767 states and 12792 transitions.
[2025-02-05 11:39:46,033 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 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 11:39:46,033 INFO  L276                IsEmpty]: Start isEmpty. Operand 9767 states and 12792 transitions.
[2025-02-05 11:39:46,036 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 278
[2025-02-05 11:39:46,036 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:39:46,036 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, 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]
[2025-02-05 11:39:46,036 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 11:39:46,037 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:39:46,037 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:39:46,037 INFO  L85        PathProgramCache]: Analyzing trace with hash -547343399, now seen corresponding path program 1 times
[2025-02-05 11:39:46,037 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:39:46,038 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647110858]
[2025-02-05 11:39:46,038 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:39:46,038 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:39:46,054 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes.
[2025-02-05 11:39:46,068 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements.
[2025-02-05 11:39:46,068 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:39:46,068 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:39:46,191 INFO  L134       CoverageAnalysis]: Checked inductivity of 191 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked.
[2025-02-05 11:39:46,192 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:39:46,192 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647110858]
[2025-02-05 11:39:46,192 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647110858] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:39:46,192 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:39:46,192 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:39:46,192 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111648632]
[2025-02-05 11:39:46,192 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:39:46,192 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:39:46,192 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:39:46,193 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:39:46,193 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:39:46,193 INFO  L87              Difference]: Start difference. First operand 9767 states and 12792 transitions. Second operand  has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:39:48,298 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:39:48,298 INFO  L93              Difference]: Finished difference Result 24040 states and 32728 transitions.
[2025-02-05 11:39:48,298 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:39:48,298 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 277
[2025-02-05 11:39:48,303 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:39:48,336 INFO  L225             Difference]: With dead ends: 24040
[2025-02-05 11:39:48,337 INFO  L226             Difference]: Without dead ends: 14275
[2025-02-05 11:39:48,346 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 11:39:48,347 INFO  L435           NwaCegarLoop]: 369 mSDtfsCounter, 848 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:39:48,347 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 376 Invalid, 2803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 11:39:48,359 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14275 states.
[2025-02-05 11:39:48,491 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14275 to 14273.
[2025-02-05 11:39:48,514 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14273 states, 14272 states have (on average 1.3160033632286996) internal successors, (18782), 14272 states have internal predecessors, (18782), 0 states have call successors, (0), 0 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 11:39:48,533 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14273 states to 14273 states and 18782 transitions.
[2025-02-05 11:39:48,535 INFO  L78                 Accepts]: Start accepts. Automaton has 14273 states and 18782 transitions. Word has length 277
[2025-02-05 11:39:48,536 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:39:48,536 INFO  L471      AbstractCegarLoop]: Abstraction has 14273 states and 18782 transitions.
[2025-02-05 11:39:48,536 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:39:48,536 INFO  L276                IsEmpty]: Start isEmpty. Operand 14273 states and 18782 transitions.
[2025-02-05 11:39:48,539 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 289
[2025-02-05 11:39:48,539 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:39:48,539 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, 2, 2, 2, 2, 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]
[2025-02-05 11:39:48,539 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 11:39:48,540 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:39:48,540 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:39:48,540 INFO  L85        PathProgramCache]: Analyzing trace with hash -1385535648, now seen corresponding path program 1 times
[2025-02-05 11:39:48,540 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:39:48,540 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449645751]
[2025-02-05 11:39:48,540 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:39:48,540 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:39:48,557 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes.
[2025-02-05 11:39:48,571 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements.
[2025-02-05 11:39:48,571 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:39:48,571 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:39:48,706 INFO  L134       CoverageAnalysis]: Checked inductivity of 202 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:39:48,708 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:39:48,708 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449645751]
[2025-02-05 11:39:48,708 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449645751] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:39:48,708 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:39:48,708 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:39:48,708 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337959481]
[2025-02-05 11:39:48,709 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:39:48,709 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:39:48,709 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:39:48,709 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:39:48,709 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:39:48,710 INFO  L87              Difference]: Start difference. First operand 14273 states and 18782 transitions. Second operand  has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:39:50,920 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:39:50,920 INFO  L93              Difference]: Finished difference Result 28544 states and 37562 transitions.
[2025-02-05 11:39:50,920 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:39:50,921 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 288
[2025-02-05 11:39:50,921 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:39:50,944 INFO  L225             Difference]: With dead ends: 28544
[2025-02-05 11:39:50,944 INFO  L226             Difference]: Without dead ends: 14273
[2025-02-05 11:39:50,956 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 11:39:50,957 INFO  L435           NwaCegarLoop]: 1266 mSDtfsCounter, 682 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2655 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 3023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 2655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:39:50,957 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1273 Invalid, 3023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 2655 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-02-05 11:39:50,966 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14273 states.
[2025-02-05 11:39:51,113 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14273 to 14273.
[2025-02-05 11:39:51,127 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14273 states, 14272 states have (on average 1.2623318385650224) internal successors, (18016), 14272 states have internal predecessors, (18016), 0 states have call successors, (0), 0 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 11:39:51,141 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14273 states to 14273 states and 18016 transitions.
[2025-02-05 11:39:51,141 INFO  L78                 Accepts]: Start accepts. Automaton has 14273 states and 18016 transitions. Word has length 288
[2025-02-05 11:39:51,142 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:39:51,142 INFO  L471      AbstractCegarLoop]: Abstraction has 14273 states and 18016 transitions.
[2025-02-05 11:39:51,142 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:39:51,142 INFO  L276                IsEmpty]: Start isEmpty. Operand 14273 states and 18016 transitions.
[2025-02-05 11:39:51,145 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 293
[2025-02-05 11:39:51,145 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:39:51,146 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, 2, 2, 2, 2, 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]
[2025-02-05 11:39:51,146 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 11:39:51,146 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:39:51,146 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:39:51,146 INFO  L85        PathProgramCache]: Analyzing trace with hash -722122326, now seen corresponding path program 1 times
[2025-02-05 11:39:51,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:39:51,146 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816265472]
[2025-02-05 11:39:51,147 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:39:51,147 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:39:51,166 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes.
[2025-02-05 11:39:51,182 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements.
[2025-02-05 11:39:51,183 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:39:51,183 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:39:51,284 INFO  L134       CoverageAnalysis]: Checked inductivity of 202 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked.
[2025-02-05 11:39:51,285 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:39:51,285 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816265472]
[2025-02-05 11:39:51,285 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816265472] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:39:51,285 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:39:51,285 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:39:51,285 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64051611]
[2025-02-05 11:39:51,285 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:39:51,285 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:39:51,286 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:39:51,286 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:39:51,286 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:39:51,286 INFO  L87              Difference]: Start difference. First operand 14273 states and 18016 transitions. Second operand  has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 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 11:39:53,624 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:39:53,624 INFO  L93              Difference]: Finished difference Result 37556 states and 48447 transitions.
[2025-02-05 11:39:53,625 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:39:53,625 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 292
[2025-02-05 11:39:53,626 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:39:53,663 INFO  L225             Difference]: With dead ends: 37556
[2025-02-05 11:39:53,663 INFO  L226             Difference]: Without dead ends: 23285
[2025-02-05 11:39:53,672 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:39:53,673 INFO  L435           NwaCegarLoop]: 369 mSDtfsCounter, 739 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2223 mSolverCounterSat, 718 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 718 IncrementalHoareTripleChecker+Valid, 2223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-02-05 11:39:53,674 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 376 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [718 Valid, 2223 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-02-05 11:39:53,690 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23285 states.
[2025-02-05 11:39:53,901 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23285 to 23285.
[2025-02-05 11:39:53,922 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23285 states, 23284 states have (on average 1.2509019068888507) internal successors, (29126), 23284 states have internal predecessors, (29126), 0 states have call successors, (0), 0 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 11:39:53,944 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23285 states to 23285 states and 29126 transitions.
[2025-02-05 11:39:53,944 INFO  L78                 Accepts]: Start accepts. Automaton has 23285 states and 29126 transitions. Word has length 292
[2025-02-05 11:39:53,945 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:39:53,945 INFO  L471      AbstractCegarLoop]: Abstraction has 23285 states and 29126 transitions.
[2025-02-05 11:39:53,945 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 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 11:39:53,946 INFO  L276                IsEmpty]: Start isEmpty. Operand 23285 states and 29126 transitions.
[2025-02-05 11:39:53,950 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 324
[2025-02-05 11:39:53,950 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:39:53,950 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:39:53,950 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 11:39:53,950 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:39:53,951 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:39:53,951 INFO  L85        PathProgramCache]: Analyzing trace with hash -1774924264, now seen corresponding path program 1 times
[2025-02-05 11:39:53,951 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:39:53,951 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695346741]
[2025-02-05 11:39:53,951 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:39:53,951 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:39:53,970 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes.
[2025-02-05 11:39:53,985 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements.
[2025-02-05 11:39:53,985 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:39:53,985 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:39:54,124 INFO  L134       CoverageAnalysis]: Checked inductivity of 233 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked.
[2025-02-05 11:39:54,125 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:39:54,125 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695346741]
[2025-02-05 11:39:54,125 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695346741] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:39:54,125 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:39:54,125 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:39:54,125 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167753895]
[2025-02-05 11:39:54,125 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:39:54,125 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:39:54,125 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:39:54,126 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:39:54,126 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:39:54,126 INFO  L87              Difference]: Start difference. First operand 23285 states and 29126 transitions. Second operand  has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 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 11:39:56,466 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:39:56,466 INFO  L93              Difference]: Finished difference Result 66094 states and 83272 transitions.
[2025-02-05 11:39:56,467 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:39:56,467 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 323
[2025-02-05 11:39:56,467 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:39:56,530 INFO  L225             Difference]: With dead ends: 66094
[2025-02-05 11:39:56,531 INFO  L226             Difference]: Without dead ends: 42811
[2025-02-05 11:39:56,548 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 11:39:56,549 INFO  L435           NwaCegarLoop]: 1403 mSDtfsCounter, 693 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 2893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:39:56,549 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 1411 Invalid, 2893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-02-05 11:39:56,579 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42811 states.
[2025-02-05 11:39:56,863 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42811 to 42811.
[2025-02-05 11:39:56,894 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42811 states, 42810 states have (on average 1.1685353889278205) internal successors, (50025), 42810 states have internal predecessors, (50025), 0 states have call successors, (0), 0 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 11:39:56,936 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42811 states to 42811 states and 50025 transitions.
[2025-02-05 11:39:56,937 INFO  L78                 Accepts]: Start accepts. Automaton has 42811 states and 50025 transitions. Word has length 323
[2025-02-05 11:39:56,937 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:39:56,937 INFO  L471      AbstractCegarLoop]: Abstraction has 42811 states and 50025 transitions.
[2025-02-05 11:39:56,937 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 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 11:39:56,937 INFO  L276                IsEmpty]: Start isEmpty. Operand 42811 states and 50025 transitions.
[2025-02-05 11:39:56,943 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 384
[2025-02-05 11:39:56,943 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:39:56,944 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:39:56,944 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 11:39:56,944 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:39:56,944 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:39:56,944 INFO  L85        PathProgramCache]: Analyzing trace with hash -261879314, now seen corresponding path program 1 times
[2025-02-05 11:39:56,944 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:39:56,945 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120571549]
[2025-02-05 11:39:56,945 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:39:56,945 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:39:56,977 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes.
[2025-02-05 11:39:56,992 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements.
[2025-02-05 11:39:56,992 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:39:56,992 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:39:57,218 INFO  L134       CoverageAnalysis]: Checked inductivity of 261 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked.
[2025-02-05 11:39:57,218 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:39:57,218 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120571549]
[2025-02-05 11:39:57,218 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120571549] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:39:57,219 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:39:57,220 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:39:57,220 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337384905]
[2025-02-05 11:39:57,220 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:39:57,220 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:39:57,220 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:39:57,221 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:39:57,221 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:39:57,221 INFO  L87              Difference]: Start difference. First operand 42811 states and 50025 transitions. Second operand  has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 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 11:39:59,331 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:39:59,332 INFO  L93              Difference]: Finished difference Result 105146 states and 125173 transitions.
[2025-02-05 11:39:59,332 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:39:59,332 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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 383
[2025-02-05 11:39:59,333 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:39:59,404 INFO  L225             Difference]: With dead ends: 105146
[2025-02-05 11:39:59,404 INFO  L226             Difference]: Without dead ends: 62337
[2025-02-05 11:39:59,439 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 11:39:59,439 INFO  L435           NwaCegarLoop]: 422 mSDtfsCounter, 660 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 860 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 860 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:39:59,440 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 428 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [860 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-02-05 11:39:59,483 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 62337 states.
[2025-02-05 11:39:59,924 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 62337 to 55578.
[2025-02-05 11:39:59,962 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 55578 states, 55577 states have (on average 1.1561077424114292) internal successors, (64253), 55577 states have internal predecessors, (64253), 0 states have call successors, (0), 0 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 11:40:00,016 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 55578 states to 55578 states and 64253 transitions.
[2025-02-05 11:40:00,017 INFO  L78                 Accepts]: Start accepts. Automaton has 55578 states and 64253 transitions. Word has length 383
[2025-02-05 11:40:00,017 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:40:00,017 INFO  L471      AbstractCegarLoop]: Abstraction has 55578 states and 64253 transitions.
[2025-02-05 11:40:00,017 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 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 11:40:00,017 INFO  L276                IsEmpty]: Start isEmpty. Operand 55578 states and 64253 transitions.
[2025-02-05 11:40:00,024 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 447
[2025-02-05 11:40:00,024 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:40:00,024 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:40:00,025 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 11:40:00,025 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:40:00,025 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:40:00,025 INFO  L85        PathProgramCache]: Analyzing trace with hash 1240909803, now seen corresponding path program 1 times
[2025-02-05 11:40:00,025 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:40:00,025 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242751747]
[2025-02-05 11:40:00,025 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:40:00,026 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:40:00,050 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes.
[2025-02-05 11:40:00,068 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements.
[2025-02-05 11:40:00,070 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:40:00,070 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:40:00,320 INFO  L134       CoverageAnalysis]: Checked inductivity of 257 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked.
[2025-02-05 11:40:00,321 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:40:00,321 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242751747]
[2025-02-05 11:40:00,321 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242751747] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:40:00,321 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:40:00,321 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:40:00,321 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407996035]
[2025-02-05 11:40:00,321 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:40:00,322 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:40:00,322 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:40:00,322 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:40:00,322 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:40:00,322 INFO  L87              Difference]: Start difference. First operand 55578 states and 64253 transitions. Second operand  has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 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 11:40:02,630 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:40:02,630 INFO  L93              Difference]: Finished difference Result 132182 states and 155239 transitions.
[2025-02-05 11:40:02,630 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:40:02,630 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 446
[2025-02-05 11:40:02,631 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:40:02,711 INFO  L225             Difference]: With dead ends: 132182
[2025-02-05 11:40:02,711 INFO  L226             Difference]: Without dead ends: 76606
[2025-02-05 11:40:02,747 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 11:40:02,748 INFO  L435           NwaCegarLoop]: 1220 mSDtfsCounter, 714 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 2793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:40:02,748 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 1228 Invalid, 2793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 11:40:02,803 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 76606 states.
[2025-02-05 11:40:03,327 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 76606 to 76606.
[2025-02-05 11:40:03,378 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 76606 states, 76605 states have (on average 1.1337902225703282) internal successors, (86854), 76605 states have internal predecessors, (86854), 0 states have call successors, (0), 0 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 11:40:03,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76606 states to 76606 states and 86854 transitions.
[2025-02-05 11:40:03,450 INFO  L78                 Accepts]: Start accepts. Automaton has 76606 states and 86854 transitions. Word has length 446
[2025-02-05 11:40:03,451 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:40:03,451 INFO  L471      AbstractCegarLoop]: Abstraction has 76606 states and 86854 transitions.
[2025-02-05 11:40:03,451 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 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 11:40:03,451 INFO  L276                IsEmpty]: Start isEmpty. Operand 76606 states and 86854 transitions.
[2025-02-05 11:40:03,460 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 500
[2025-02-05 11:40:03,460 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:40:03,460 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, 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, 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]
[2025-02-05 11:40:03,460 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 11:40:03,460 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:40:03,461 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:40:03,461 INFO  L85        PathProgramCache]: Analyzing trace with hash -154405042, now seen corresponding path program 1 times
[2025-02-05 11:40:03,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:40:03,461 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342206159]
[2025-02-05 11:40:03,461 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:40:03,461 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:40:03,487 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes.
[2025-02-05 11:40:03,503 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements.
[2025-02-05 11:40:03,503 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:40:03,503 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:40:03,784 INFO  L134       CoverageAnalysis]: Checked inductivity of 779 backedges. 276 proven. 333 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked.
[2025-02-05 11:40:03,784 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:40:03,784 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342206159]
[2025-02-05 11:40:03,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342206159] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:40:03,784 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644094583]
[2025-02-05 11:40:03,784 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:40:03,784 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:40:03,784 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:40:03,787 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 11:40:03,891 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 11:40:03,933 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes.
[2025-02-05 11:40:03,992 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements.
[2025-02-05 11:40:03,992 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:40:03,992 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:40:03,994 INFO  L256         TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:40:04,005 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:40:04,076 INFO  L134       CoverageAnalysis]: Checked inductivity of 779 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked.
[2025-02-05 11:40:04,076 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:40:04,076 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644094583] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:40:04,076 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:40:04,076 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-02-05 11:40:04,076 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741941050]
[2025-02-05 11:40:04,076 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:40:04,077 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:40:04,077 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:40:04,077 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:40:04,078 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:40:04,078 INFO  L87              Difference]: Start difference. First operand 76606 states and 86854 transitions. Second operand  has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:40:06,156 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:40:06,157 INFO  L93              Difference]: Finished difference Result 168230 states and 190565 transitions.
[2025-02-05 11:40:06,157 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:40:06,157 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 499
[2025-02-05 11:40:06,157 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:40:06,266 INFO  L225             Difference]: With dead ends: 168230
[2025-02-05 11:40:06,266 INFO  L226             Difference]: Without dead ends: 91626
[2025-02-05 11:40:06,470 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:40:06,470 INFO  L435           NwaCegarLoop]: 1109 mSDtfsCounter, 813 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2198 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 2198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:40:06,470 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1117 Invalid, 2661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 2198 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-02-05 11:40:06,514 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 91626 states.
[2025-02-05 11:40:07,142 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 91626 to 91626.
[2025-02-05 11:40:07,189 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 91626 states, 91625 states have (on average 1.1207094133697135) internal successors, (102685), 91625 states have internal predecessors, (102685), 0 states have call successors, (0), 0 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 11:40:07,312 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 91626 states to 91626 states and 102685 transitions.
[2025-02-05 11:40:07,312 INFO  L78                 Accepts]: Start accepts. Automaton has 91626 states and 102685 transitions. Word has length 499
[2025-02-05 11:40:07,313 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:40:07,313 INFO  L471      AbstractCegarLoop]: Abstraction has 91626 states and 102685 transitions.
[2025-02-05 11:40:07,313 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:40:07,313 INFO  L276                IsEmpty]: Start isEmpty. Operand 91626 states and 102685 transitions.
[2025-02-05 11:40:07,326 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 541
[2025-02-05 11:40:07,327 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:40:07,327 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:40:07,334 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 11:40:07,527 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:40:07,528 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:40:07,528 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:40:07,528 INFO  L85        PathProgramCache]: Analyzing trace with hash -415970863, now seen corresponding path program 1 times
[2025-02-05 11:40:07,528 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:40:07,528 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72253741]
[2025-02-05 11:40:07,529 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:40:07,529 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:40:07,583 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes.
[2025-02-05 11:40:07,608 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements.
[2025-02-05 11:40:07,608 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:40:07,608 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:40:07,863 INFO  L134       CoverageAnalysis]: Checked inductivity of 825 backedges. 566 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked.
[2025-02-05 11:40:07,863 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:40:07,863 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72253741]
[2025-02-05 11:40:07,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72253741] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:40:07,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:40:07,864 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:40:07,864 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436626692]
[2025-02-05 11:40:07,864 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:40:07,865 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:40:07,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:40:07,865 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:40:07,865 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:40:07,866 INFO  L87              Difference]: Start difference. First operand 91626 states and 102685 transitions. Second operand  has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 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 11:40:10,214 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:40:10,214 INFO  L93              Difference]: Finished difference Result 187756 states and 209996 transitions.
[2025-02-05 11:40:10,215 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:40:10,215 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 540
[2025-02-05 11:40:10,215 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:40:10,311 INFO  L225             Difference]: With dead ends: 187756
[2025-02-05 11:40:10,311 INFO  L226             Difference]: Without dead ends: 91626
[2025-02-05 11:40:10,357 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 11:40:10,357 INFO  L435           NwaCegarLoop]: 1223 mSDtfsCounter, 668 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2174 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 2174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:40:10,358 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1231 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 2174 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 11:40:10,420 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 91626 states.
[2025-02-05 11:40:11,080 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 91626 to 87871.
[2025-02-05 11:40:11,138 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 87871 states, 87870 states have (on average 1.0871059519745079) internal successors, (95524), 87870 states have internal predecessors, (95524), 0 states have call successors, (0), 0 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 11:40:11,395 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 87871 states to 87871 states and 95524 transitions.
[2025-02-05 11:40:11,396 INFO  L78                 Accepts]: Start accepts. Automaton has 87871 states and 95524 transitions. Word has length 540
[2025-02-05 11:40:11,396 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:40:11,396 INFO  L471      AbstractCegarLoop]: Abstraction has 87871 states and 95524 transitions.
[2025-02-05 11:40:11,396 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 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 11:40:11,396 INFO  L276                IsEmpty]: Start isEmpty. Operand 87871 states and 95524 transitions.
[2025-02-05 11:40:11,410 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 632
[2025-02-05 11:40:11,410 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:40:11,410 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, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:40:11,410 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 11:40:11,410 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:40:11,411 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:40:11,411 INFO  L85        PathProgramCache]: Analyzing trace with hash 1626876779, now seen corresponding path program 1 times
[2025-02-05 11:40:11,411 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:40:11,411 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291438768]
[2025-02-05 11:40:11,411 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:40:11,411 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:40:11,439 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes.
[2025-02-05 11:40:11,454 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements.
[2025-02-05 11:40:11,454 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:40:11,454 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:40:12,123 INFO  L134       CoverageAnalysis]: Checked inductivity of 940 backedges. 652 proven. 229 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked.
[2025-02-05 11:40:12,123 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:40:12,123 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291438768]
[2025-02-05 11:40:12,123 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291438768] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:40:12,123 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583560817]
[2025-02-05 11:40:12,123 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:40:12,124 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:40:12,124 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:40:12,126 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:40:12,127 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-02-05 11:40:12,207 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes.
[2025-02-05 11:40:12,294 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements.
[2025-02-05 11:40:12,294 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:40:12,294 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:40:12,297 INFO  L256         TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:40:12,303 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:40:12,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 940 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked.
[2025-02-05 11:40:12,381 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:40:12,381 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [583560817] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:40:12,381 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:40:12,381 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7
[2025-02-05 11:40:12,381 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023945078]
[2025-02-05 11:40:12,381 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:40:12,381 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:40:12,381 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:40:12,382 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:40:12,382 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-02-05 11:40:12,382 INFO  L87              Difference]: Start difference. First operand 87871 states and 95524 transitions. Second operand  has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 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 11:40:15,086 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:40:15,086 INFO  L93              Difference]: Finished difference Result 206531 states and 225833 transitions.
[2025-02-05 11:40:15,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:40:15,087 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 631
[2025-02-05 11:40:15,087 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:40:15,228 INFO  L225             Difference]: With dead ends: 206531
[2025-02-05 11:40:15,228 INFO  L226             Difference]: Without dead ends: 119413
[2025-02-05 11:40:15,273 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-02-05 11:40:15,273 INFO  L435           NwaCegarLoop]: 381 mSDtfsCounter, 761 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-02-05 11:40:15,273 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 388 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [747 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-02-05 11:40:15,354 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 119413 states.
[2025-02-05 11:40:16,148 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 119413 to 117160.
[2025-02-05 11:40:16,222 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 117160 states, 117159 states have (on average 1.0933005573622172) internal successors, (128090), 117159 states have internal predecessors, (128090), 0 states have call successors, (0), 0 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 11:40:16,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117160 states to 117160 states and 128090 transitions.
[2025-02-05 11:40:16,334 INFO  L78                 Accepts]: Start accepts. Automaton has 117160 states and 128090 transitions. Word has length 631
[2025-02-05 11:40:16,335 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:40:16,335 INFO  L471      AbstractCegarLoop]: Abstraction has 117160 states and 128090 transitions.
[2025-02-05 11:40:16,335 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 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 11:40:16,335 INFO  L276                IsEmpty]: Start isEmpty. Operand 117160 states and 128090 transitions.
[2025-02-05 11:40:16,355 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 686
[2025-02-05 11:40:16,355 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:40:16,356 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:40:16,362 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-02-05 11:40:16,556 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:40:16,556 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:40:16,557 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:40:16,557 INFO  L85        PathProgramCache]: Analyzing trace with hash 2050745631, now seen corresponding path program 1 times
[2025-02-05 11:40:16,557 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:40:16,557 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779498223]
[2025-02-05 11:40:16,557 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:40:16,557 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:40:16,590 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes.
[2025-02-05 11:40:16,853 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements.
[2025-02-05 11:40:16,853 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:40:16,853 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:40:16,974 INFO  L134       CoverageAnalysis]: Checked inductivity of 909 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked.
[2025-02-05 11:40:16,974 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:40:16,974 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779498223]
[2025-02-05 11:40:16,974 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779498223] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:40:16,974 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:40:16,974 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:40:16,974 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366942765]
[2025-02-05 11:40:16,974 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:40:16,974 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:40:16,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:40:16,975 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:40:16,975 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:40:16,975 INFO  L87              Difference]: Start difference. First operand 117160 states and 128090 transitions. Second operand  has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 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 11:40:19,405 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:40:19,405 INFO  L93              Difference]: Finished difference Result 247085 states and 270147 transitions.
[2025-02-05 11:40:19,405 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:40:19,406 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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 685
[2025-02-05 11:40:19,406 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:40:19,546 INFO  L225             Difference]: With dead ends: 247085
[2025-02-05 11:40:19,546 INFO  L226             Difference]: Without dead ends: 130678
[2025-02-05 11:40:19,608 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 11:40:19,609 INFO  L435           NwaCegarLoop]: 1236 mSDtfsCounter, 674 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2292 mSolverCounterSat, 521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 2813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 521 IncrementalHoareTripleChecker+Valid, 2292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:40:19,609 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1243 Invalid, 2813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [521 Valid, 2292 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 11:40:19,696 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 130678 states.
[2025-02-05 11:40:20,737 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 130678 to 127674.
[2025-02-05 11:40:20,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 127674 states, 127673 states have (on average 1.0755837177790135) internal successors, (137323), 127673 states have internal predecessors, (137323), 0 states have call successors, (0), 0 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 11:40:21,252 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 127674 states to 127674 states and 137323 transitions.
[2025-02-05 11:40:21,252 INFO  L78                 Accepts]: Start accepts. Automaton has 127674 states and 137323 transitions. Word has length 685
[2025-02-05 11:40:21,253 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:40:21,253 INFO  L471      AbstractCegarLoop]: Abstraction has 127674 states and 137323 transitions.
[2025-02-05 11:40:21,253 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 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 11:40:21,253 INFO  L276                IsEmpty]: Start isEmpty. Operand 127674 states and 137323 transitions.
[2025-02-05 11:40:21,270 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 715
[2025-02-05 11:40:21,270 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:40:21,270 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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]
[2025-02-05 11:40:21,270 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 11:40:21,271 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:40:21,271 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:40:21,271 INFO  L85        PathProgramCache]: Analyzing trace with hash -59435577, now seen corresponding path program 1 times
[2025-02-05 11:40:21,271 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:40:21,271 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226191685]
[2025-02-05 11:40:21,271 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:40:21,271 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:40:21,306 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 714 statements into 1 equivalence classes.
[2025-02-05 11:40:21,323 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 714 of 714 statements.
[2025-02-05 11:40:21,323 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:40:21,323 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:40:21,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 970 backedges. 771 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked.
[2025-02-05 11:40:21,688 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:40:21,688 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226191685]
[2025-02-05 11:40:21,688 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226191685] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:40:21,688 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:40:21,689 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:40:21,689 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111454048]
[2025-02-05 11:40:21,689 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:40:21,689 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:40:21,689 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:40:21,689 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:40:21,689 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:40:21,690 INFO  L87              Difference]: Start difference. First operand 127674 states and 137323 transitions. Second operand  has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 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 11:40:23,933 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:40:23,933 INFO  L93              Difference]: Finished difference Result 259101 states and 278516 transitions.
[2025-02-05 11:40:23,934 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:40:23,934 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 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 714
[2025-02-05 11:40:23,934 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:40:24,082 INFO  L225             Difference]: With dead ends: 259101
[2025-02-05 11:40:24,082 INFO  L226             Difference]: Without dead ends: 132180
[2025-02-05 11:40:24,130 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 11:40:24,130 INFO  L435           NwaCegarLoop]: 1184 mSDtfsCounter, 742 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2083 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 2524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 2083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:40:24,130 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 1191 Invalid, 2524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 2083 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-02-05 11:40:24,218 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 132180 states.
[2025-02-05 11:40:25,364 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 132180 to 126923.
[2025-02-05 11:40:25,437 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 126923 states, 126922 states have (on average 1.0592883818408156) internal successors, (134447), 126922 states have internal predecessors, (134447), 0 states have call successors, (0), 0 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 11:40:25,603 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 126923 states to 126923 states and 134447 transitions.
[2025-02-05 11:40:25,604 INFO  L78                 Accepts]: Start accepts. Automaton has 126923 states and 134447 transitions. Word has length 714
[2025-02-05 11:40:25,604 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:40:25,604 INFO  L471      AbstractCegarLoop]: Abstraction has 126923 states and 134447 transitions.
[2025-02-05 11:40:25,604 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 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 11:40:25,604 INFO  L276                IsEmpty]: Start isEmpty. Operand 126923 states and 134447 transitions.
[2025-02-05 11:40:25,626 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 721
[2025-02-05 11:40:25,626 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:40:25,626 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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]
[2025-02-05 11:40:25,626 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 11:40:25,627 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:40:25,627 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:40:25,627 INFO  L85        PathProgramCache]: Analyzing trace with hash 2000684182, now seen corresponding path program 1 times
[2025-02-05 11:40:25,627 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:40:25,627 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787951056]
[2025-02-05 11:40:25,627 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:40:25,627 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:40:25,685 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 720 statements into 1 equivalence classes.
[2025-02-05 11:40:25,714 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 720 of 720 statements.
[2025-02-05 11:40:25,714 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:40:25,714 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:40:26,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 988 backedges. 789 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked.
[2025-02-05 11:40:26,117 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:40:26,117 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787951056]
[2025-02-05 11:40:26,117 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787951056] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:40:26,117 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:40:26,117 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:40:26,117 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970937792]
[2025-02-05 11:40:26,117 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:40:26,117 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:40:26,118 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:40:26,118 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:40:26,118 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:40:26,118 INFO  L87              Difference]: Start difference. First operand 126923 states and 134447 transitions. Second operand  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 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 11:40:28,637 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:40:28,637 INFO  L93              Difference]: Finished difference Result 297402 states and 315429 transitions.
[2025-02-05 11:40:28,638 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:40:28,638 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 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 720
[2025-02-05 11:40:28,638 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:40:28,816 INFO  L225             Difference]: With dead ends: 297402
[2025-02-05 11:40:28,816 INFO  L226             Difference]: Without dead ends: 171232
[2025-02-05 11:40:28,868 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 11:40:28,869 INFO  L435           NwaCegarLoop]: 228 mSDtfsCounter, 678 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 562 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 562 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:40:28,869 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 234 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [562 Valid, 2409 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 11:40:28,989 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 171232 states.
[2025-02-05 11:40:30,132 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 171232 to 144947.
[2025-02-05 11:40:30,218 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 144947 states, 144946 states have (on average 1.061698839567839) internal successors, (153889), 144946 states have internal predecessors, (153889), 0 states have call successors, (0), 0 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 11:40:30,351 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 144947 states to 144947 states and 153889 transitions.
[2025-02-05 11:40:30,352 INFO  L78                 Accepts]: Start accepts. Automaton has 144947 states and 153889 transitions. Word has length 720
[2025-02-05 11:40:30,352 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:40:30,352 INFO  L471      AbstractCegarLoop]: Abstraction has 144947 states and 153889 transitions.
[2025-02-05 11:40:30,353 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 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 11:40:30,353 INFO  L276                IsEmpty]: Start isEmpty. Operand 144947 states and 153889 transitions.
[2025-02-05 11:40:30,366 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 730
[2025-02-05 11:40:30,366 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:40:30,366 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:40:30,366 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 11:40:30,366 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:40:30,367 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:40:30,367 INFO  L85        PathProgramCache]: Analyzing trace with hash 345619661, now seen corresponding path program 1 times
[2025-02-05 11:40:30,367 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:40:30,367 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704680444]
[2025-02-05 11:40:30,367 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:40:30,367 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:40:30,403 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes.
[2025-02-05 11:40:30,426 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements.
[2025-02-05 11:40:30,426 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:40:30,426 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:40:31,410 INFO  L134       CoverageAnalysis]: Checked inductivity of 1075 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked.
[2025-02-05 11:40:31,411 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:40:31,411 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704680444]
[2025-02-05 11:40:31,411 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704680444] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:40:31,411 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:40:31,411 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:40:31,411 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82980490]
[2025-02-05 11:40:31,412 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:40:31,412 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:40:31,412 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:40:31,413 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:40:31,413 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:40:31,413 INFO  L87              Difference]: Start difference. First operand 144947 states and 153889 transitions. Second operand  has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 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 11:40:33,739 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:40:33,739 INFO  L93              Difference]: Finished difference Result 306412 states and 325170 transitions.
[2025-02-05 11:40:33,739 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:40:33,740 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 729
[2025-02-05 11:40:33,740 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:40:33,741 INFO  L225             Difference]: With dead ends: 306412
[2025-02-05 11:40:33,741 INFO  L226             Difference]: Without dead ends: 0
[2025-02-05 11:40:33,837 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 11:40:33,837 INFO  L435           NwaCegarLoop]: 920 mSDtfsCounter, 795 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2130 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 2712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 2130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:40:33,838 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 927 Invalid, 2712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 2130 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-02-05 11:40:33,838 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-02-05 11:40:33,838 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-02-05 11:40:33,838 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 11:40:33,838 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-02-05 11:40:33,839 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 729
[2025-02-05 11:40:33,839 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:40:33,839 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-05 11:40:33,839 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 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 11:40:33,839 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-02-05 11:40:33,839 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-02-05 11:40:33,841 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-02-05 11:40:33,841 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 11:40:33,843 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:40:33,844 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-02-05 11:40:38,851 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-05 11:40:38,862 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:40:38 BoogieIcfgContainer
[2025-02-05 11:40:38,862 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-05 11:40:38,862 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-05 11:40:38,862 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-05 11:40:38,863 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-05 11:40:38,863 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:39:32" (3/4) ...
[2025-02-05 11:40:38,865 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-02-05 11:40:38,904 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges
[2025-02-05 11:40:38,909 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-02-05 11:40:38,912 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-02-05 11:40:38,916 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-02-05 11:40:39,096 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-05 11:40:39,097 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-05 11:40:39,097 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-05 11:40:39,098 INFO  L158              Benchmark]: Toolchain (without parser) took 72173.67ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 91.7MB in the beginning and 1.0GB in the end (delta: -943.4MB). Peak memory consumption was 873.1MB. Max. memory is 16.1GB.
[2025-02-05 11:40:39,098 INFO  L158              Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-05 11:40:39,098 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 965.88ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 91.7MB in the beginning and 64.7MB in the end (delta: 27.0MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB.
[2025-02-05 11:40:39,098 INFO  L158              Benchmark]: Boogie Procedure Inliner took 305.81ms. Allocated memory was 151.0MB in the beginning and 310.4MB in the end (delta: 159.4MB). Free memory was 64.7MB in the beginning and 204.4MB in the end (delta: -139.6MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB.
[2025-02-05 11:40:39,098 INFO  L158              Benchmark]: Boogie Preprocessor took 376.23ms. Allocated memory is still 310.4MB. Free memory was 204.4MB in the beginning and 175.3MB in the end (delta: 29.0MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB.
[2025-02-05 11:40:39,099 INFO  L158              Benchmark]: IcfgBuilder took 3497.23ms. Allocated memory was 310.4MB in the beginning and 620.8MB in the end (delta: 310.4MB). Free memory was 175.3MB in the beginning and 403.2MB in the end (delta: -227.9MB). Peak memory consumption was 369.1MB. Max. memory is 16.1GB.
[2025-02-05 11:40:39,099 INFO  L158              Benchmark]: TraceAbstraction took 66781.75ms. Allocated memory was 620.8MB in the beginning and 2.0GB in the end (delta: 1.3GB). Free memory was 403.2MB in the beginning and 1.1GB in the end (delta: -690.3MB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB.
[2025-02-05 11:40:39,099 INFO  L158              Benchmark]: Witness Printer took 234.32ms. Allocated memory is still 2.0GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 58.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB.
[2025-02-05 11:40:39,101 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.24ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 965.88ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 91.7MB in the beginning and 64.7MB in the end (delta: 27.0MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 305.81ms. Allocated memory was 151.0MB in the beginning and 310.4MB in the end (delta: 159.4MB). Free memory was 64.7MB in the beginning and 204.4MB in the end (delta: -139.6MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 376.23ms. Allocated memory is still 310.4MB. Free memory was 204.4MB in the beginning and 175.3MB in the end (delta: 29.0MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 3497.23ms. Allocated memory was 310.4MB in the beginning and 620.8MB in the end (delta: 310.4MB). Free memory was 175.3MB in the beginning and 403.2MB in the end (delta: -227.9MB). Peak memory consumption was 369.1MB. Max. memory is 16.1GB.
 * TraceAbstraction took 66781.75ms. Allocated memory was 620.8MB in the beginning and 2.0GB in the end (delta: 1.3GB). Free memory was 403.2MB in the beginning and 1.1GB in the end (delta: -690.3MB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB.
 * Witness Printer took 234.32ms. Allocated memory is still 2.0GB. Free memory was 1.1GB in the beginning and 1.0GB in the end (delta: 58.4MB). Peak memory consumption was 58.7MB. 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: 205]: 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, 818 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.7s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 43.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13868 SdHoareTripleChecker+Valid, 36.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13868 mSDsluCounter, 13109 SdHoareTripleChecker+Invalid, 30.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 145 mSDsCounter, 11025 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41538 IncrementalHoareTripleChecker+Invalid, 52563 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11025 mSolverCounterUnsat, 12964 mSDtfsCounter, 41538 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1383 GetRequests, 1354 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144947occurred in iteration=16, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 48074 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 8463 NumberOfCodeBlocks, 8463 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 8443 ConstructedInterpolants, 0 QuantifiedInterpolants, 20658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1707 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 9296/9912 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: 4828]: Location Invariant
    Derived location invariant: (((((((((((((((a2 <= 170) && (a24 == 14)) || ((15 <= a24) && (a17 <= 111))) || ((a2 <= 170) && (a7 <= 13))) || ((a2 <= 170) && (a17 <= 255))) || ((a5 != 4) && (a17 <= 255))) || (((14 <= a7) && (a17 <= 111)) && (a24 <= 13))) || (((a24 == 14) && (a7 <= 13)) && (a17 <= 111))) || (((256 <= a17) && (15 <= a24)) && (a5 <= 4))) || ((a7 <= 13) && (15 <= a24))) || ((a5 != 4) && (a24 == 14))) || (5 == a5)) || ((a5 <= 4) && (190 <= a2))) || ((a2 <= 170) && (15 <= a24))) || ((a5 != 4) && (a24 <= 13)))
RESULT: Ultimate proved your program to be correct!
[2025-02-05 11:40:39,117 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE