./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label12.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version c00e63dc
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label12.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 6527eed8ae625274c5a4f237cc1c724f312a2d824fa69cbfc4381a7c8bc46d7c
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 12:01:46,922 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 12:01:46,989 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 12:01:46,994 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 12:01:46,994 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 12:01:47,013 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 12:01:47,014 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 12:01:47,014 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 12:01:47,014 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 12:01:47,014 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 12:01:47,014 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 12:01:47,015 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 12:01:47,015 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 12:01:47,015 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 12:01:47,015 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 12:01:47,015 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 12:01:47,015 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 12:01:47,016 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 12:01:47,016 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 12:01:47,017 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 12:01:47,017 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 12:01:47,017 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 12:01:47,017 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 12:01:47,017 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 12:01:47,017 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 12:01:47,017 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 12:01:47,017 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 12:01:47,017 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 12:01:47,017 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 12:01:47,017 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 12:01:47,017 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 12:01:47,017 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 12:01:47,018 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 12:01:47,018 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 12:01:47,018 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 12:01:47,018 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 12:01:47,018 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 12:01:47,018 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 12:01:47,018 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 12:01:47,018 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 12:01:47,018 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 12:01:47,018 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 12:01:47,018 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 12:01:47,018 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 -> 6527eed8ae625274c5a4f237cc1c724f312a2d824fa69cbfc4381a7c8bc46d7c
[2025-02-05 12:01:47,324 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 12:01:47,335 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 12:01:47,337 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 12:01:47,339 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 12:01:47,340 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 12:01:47,341 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label12.c
[2025-02-05 12:01:48,628 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/773403dfe/9f1e730ff25e4ef1add59ec474cf0a2e/FLAGe30579573
[2025-02-05 12:01:49,078 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 12:01:49,079 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label12.c
[2025-02-05 12:01:49,106 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/773403dfe/9f1e730ff25e4ef1add59ec474cf0a2e/FLAGe30579573
[2025-02-05 12:01:49,121 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/773403dfe/9f1e730ff25e4ef1add59ec474cf0a2e
[2025-02-05 12:01:49,123 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 12:01:49,125 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 12:01:49,126 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 12:01:49,127 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 12:01:49,130 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 12:01:49,131 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:01:49" (1/1) ...
[2025-02-05 12:01:49,132 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c3395d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:49, skipping insertion in model container
[2025-02-05 12:01:49,132 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:01:49" (1/1) ...
[2025-02-05 12:01:49,205 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 12:01:49,406 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label12.c[5027,5040]
[2025-02-05 12:01:49,839 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 12:01:49,855 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 12:01:49,879 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label12.c[5027,5040]
[2025-02-05 12:01:50,125 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 12:01:50,144 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 12:01:50,145 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:50 WrapperNode
[2025-02-05 12:01:50,146 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 12:01:50,147 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 12:01:50,148 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 12:01:50,148 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 12:01:50,155 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:50" (1/1) ...
[2025-02-05 12:01:50,201 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:50" (1/1) ...
[2025-02-05 12:01:50,453 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610
[2025-02-05 12:01:50,453 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 12:01:50,455 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 12:01:50,455 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 12:01:50,455 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 12:01:50,463 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:50" (1/1) ...
[2025-02-05 12:01:50,464 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:50" (1/1) ...
[2025-02-05 12:01:50,564 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:50" (1/1) ...
[2025-02-05 12:01:50,735 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 12:01:50,735 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:50" (1/1) ...
[2025-02-05 12:01:50,736 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:50" (1/1) ...
[2025-02-05 12:01:50,907 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:50" (1/1) ...
[2025-02-05 12:01:50,932 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:50" (1/1) ...
[2025-02-05 12:01:50,955 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:50" (1/1) ...
[2025-02-05 12:01:50,973 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:50" (1/1) ...
[2025-02-05 12:01:51,030 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 12:01:51,032 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 12:01:51,032 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 12:01:51,033 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 12:01:51,034 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:50" (1/1) ...
[2025-02-05 12:01:51,039 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 12:01:51,053 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:01:51,069 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 12:01:51,074 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 12:01:51,100 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 12:01:51,100 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 12:01:51,100 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 12:01:51,100 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 12:01:51,172 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 12:01:51,174 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 12:01:54,865 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1;
[2025-02-05 12:01:54,991 INFO  L?                        ?]: Removed 372 outVars from TransFormulas that were not future-live.
[2025-02-05 12:01:54,992 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 12:01:55,029 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 12:01:55,029 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 12:01:55,030 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:01:55 BoogieIcfgContainer
[2025-02-05 12:01:55,030 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 12:01:55,034 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 12:01:55,034 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 12:01:55,038 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 12:01:55,039 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:01:49" (1/3) ...
[2025-02-05 12:01:55,039 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ba3df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:01:55, skipping insertion in model container
[2025-02-05 12:01:55,039 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:50" (2/3) ...
[2025-02-05 12:01:55,040 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ba3df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:01:55, skipping insertion in model container
[2025-02-05 12:01:55,040 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:01:55" (3/3) ...
[2025-02-05 12:01:55,041 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem17_label12.c
[2025-02-05 12:01:55,058 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 12:01:55,059 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label12.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 12:01:55,136 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 12:01:55,150 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;@7e1e7009, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 12:01:55,151 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 12:01:55,157 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:01:55,164 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-02-05 12:01:55,165 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:55,166 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]
[2025-02-05 12:01:55,166 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:55,171 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:55,172 INFO  L85        PathProgramCache]: Analyzing trace with hash -1745348923, now seen corresponding path program 1 times
[2025-02-05 12:01:55,179 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:55,179 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391274010]
[2025-02-05 12:01:55,180 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:55,180 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:55,252 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-02-05 12:01:55,289 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-02-05 12:01:55,292 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:55,292 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:55,509 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:01:55,511 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:55,512 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391274010]
[2025-02-05 12:01:55,512 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391274010] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:55,513 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:55,513 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:01:55,515 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507693173]
[2025-02-05 12:01:55,516 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:55,519 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:01:55,519 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:55,539 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:01:55,539 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:01:55,543 INFO  L87              Difference]: Start difference. First operand  has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:01:58,089 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:01:58,089 INFO  L93              Difference]: Finished difference Result 1642 states and 3021 transitions.
[2025-02-05 12:01:58,090 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:01:58,091 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33
[2025-02-05 12:01:58,092 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:01:58,106 INFO  L225             Difference]: With dead ends: 1642
[2025-02-05 12:01:58,106 INFO  L226             Difference]: Without dead ends: 975
[2025-02-05 12:01:58,111 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:01:58,113 INFO  L435           NwaCegarLoop]: 475 mSDtfsCounter, 457 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-02-05 12:01:58,114 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 551 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-02-05 12:01:58,130 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 975 states.
[2025-02-05 12:01:58,192 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972.
[2025-02-05 12:01:58,195 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:01:58,204 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions.
[2025-02-05 12:01:58,206 INFO  L78                 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 33
[2025-02-05 12:01:58,206 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:01:58,206 INFO  L471      AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions.
[2025-02-05 12:01:58,210 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:01:58,211 INFO  L276                IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions.
[2025-02-05 12:01:58,213 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2025-02-05 12:01:58,213 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:58,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:01:58,215 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 12:01:58,215 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:58,216 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:58,216 INFO  L85        PathProgramCache]: Analyzing trace with hash 1415051900, now seen corresponding path program 1 times
[2025-02-05 12:01:58,218 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:58,218 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190700959]
[2025-02-05 12:01:58,218 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:58,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:58,249 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes.
[2025-02-05 12:01:58,315 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements.
[2025-02-05 12:01:58,316 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:58,316 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:58,649 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:01:58,650 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:58,650 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190700959]
[2025-02-05 12:01:58,650 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190700959] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:58,650 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:58,651 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:01:58,651 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4918176]
[2025-02-05 12:01:58,651 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:58,653 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:01:58,653 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:58,654 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:01:58,654 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:01:58,654 INFO  L87              Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand  has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:00,921 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:00,922 INFO  L93              Difference]: Finished difference Result 2814 states and 4242 transitions.
[2025-02-05 12:02:00,922 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:00,923 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103
[2025-02-05 12:02:00,923 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:00,932 INFO  L225             Difference]: With dead ends: 2814
[2025-02-05 12:02:00,932 INFO  L226             Difference]: Without dead ends: 1844
[2025-02-05 12:02:00,934 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:00,935 INFO  L435           NwaCegarLoop]: 853 mSDtfsCounter, 458 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:00,936 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 921 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-02-05 12:02:00,938 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1844 states.
[2025-02-05 12:02:00,973 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842.
[2025-02-05 12:02:00,976 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1842 states, 1841 states have (on average 1.3601303639326452) internal successors, (2504), 1841 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:00,984 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions.
[2025-02-05 12:02:00,985 INFO  L78                 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 103
[2025-02-05 12:02:00,985 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:00,985 INFO  L471      AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions.
[2025-02-05 12:02:00,985 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:00,986 INFO  L276                IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions.
[2025-02-05 12:02:00,989 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2025-02-05 12:02:00,991 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:00,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:02:00,992 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 12:02:00,993 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:00,997 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:00,997 INFO  L85        PathProgramCache]: Analyzing trace with hash -1584575897, now seen corresponding path program 1 times
[2025-02-05 12:02:00,997 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:00,997 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163595729]
[2025-02-05 12:02:00,997 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:00,998 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:01,027 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes.
[2025-02-05 12:02:01,051 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements.
[2025-02-05 12:02:01,052 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:01,052 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:01,232 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:02:01,232 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:01,232 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163595729]
[2025-02-05 12:02:01,232 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163595729] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:01,232 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:01,232 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:02:01,232 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292905867]
[2025-02-05 12:02:01,232 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:01,233 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:02:01,233 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:01,233 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:02:01,233 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:01,234 INFO  L87              Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:03,361 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:03,362 INFO  L93              Difference]: Finished difference Result 5395 states and 7326 transitions.
[2025-02-05 12:02:03,362 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:03,363 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 125
[2025-02-05 12:02:03,363 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:03,374 INFO  L225             Difference]: With dead ends: 5395
[2025-02-05 12:02:03,375 INFO  L226             Difference]: Without dead ends: 2701
[2025-02-05 12:02:03,382 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:03,383 INFO  L435           NwaCegarLoop]: 515 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:03,384 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-02-05 12:02:03,389 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2701 states.
[2025-02-05 12:02:03,436 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2701.
[2025-02-05 12:02:03,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2701 states, 2700 states have (on average 1.191851851851852) internal successors, (3218), 2700 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:03,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3218 transitions.
[2025-02-05 12:02:03,446 INFO  L78                 Accepts]: Start accepts. Automaton has 2701 states and 3218 transitions. Word has length 125
[2025-02-05 12:02:03,446 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:03,446 INFO  L471      AbstractCegarLoop]: Abstraction has 2701 states and 3218 transitions.
[2025-02-05 12:02:03,446 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:03,447 INFO  L276                IsEmpty]: Start isEmpty. Operand 2701 states and 3218 transitions.
[2025-02-05 12:02:03,450 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 186
[2025-02-05 12:02:03,454 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:03,454 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:02:03,455 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 12:02:03,455 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:03,455 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:03,455 INFO  L85        PathProgramCache]: Analyzing trace with hash 1535458784, now seen corresponding path program 1 times
[2025-02-05 12:02:03,455 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:03,456 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207249710]
[2025-02-05 12:02:03,456 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:03,456 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:03,487 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes.
[2025-02-05 12:02:03,512 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements.
[2025-02-05 12:02:03,512 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:03,512 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:03,746 INFO  L134       CoverageAnalysis]: Checked inductivity of 129 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:02:03,750 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:03,750 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207249710]
[2025-02-05 12:02:03,750 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207249710] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:03,750 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:03,750 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:02:03,750 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263633932]
[2025-02-05 12:02:03,750 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:03,751 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:02:03,751 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:03,751 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:02:03,752 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:03,752 INFO  L87              Difference]: Start difference. First operand 2701 states and 3218 transitions. Second operand  has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:05,372 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:05,372 INFO  L93              Difference]: Finished difference Result 7108 states and 8598 transitions.
[2025-02-05 12:02:05,373 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:05,373 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 185
[2025-02-05 12:02:05,373 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:05,390 INFO  L225             Difference]: With dead ends: 7108
[2025-02-05 12:02:05,390 INFO  L226             Difference]: Without dead ends: 4409
[2025-02-05 12:02:05,395 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:05,396 INFO  L435           NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:05,396 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-02-05 12:02:05,400 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4409 states.
[2025-02-05 12:02:05,460 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4409.
[2025-02-05 12:02:05,466 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4409 states, 4408 states have (on average 1.1705989110707804) internal successors, (5160), 4408 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:05,474 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 5160 transitions.
[2025-02-05 12:02:05,475 INFO  L78                 Accepts]: Start accepts. Automaton has 4409 states and 5160 transitions. Word has length 185
[2025-02-05 12:02:05,475 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:05,475 INFO  L471      AbstractCegarLoop]: Abstraction has 4409 states and 5160 transitions.
[2025-02-05 12:02:05,475 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:05,476 INFO  L276                IsEmpty]: Start isEmpty. Operand 4409 states and 5160 transitions.
[2025-02-05 12:02:05,477 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 188
[2025-02-05 12:02:05,477 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:05,477 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:02:05,478 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 12:02:05,478 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:05,478 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:05,478 INFO  L85        PathProgramCache]: Analyzing trace with hash 1292135973, now seen corresponding path program 1 times
[2025-02-05 12:02:05,478 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:05,479 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736316519]
[2025-02-05 12:02:05,479 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:05,479 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:05,501 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes.
[2025-02-05 12:02:05,528 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements.
[2025-02-05 12:02:05,529 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:05,529 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:05,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 131 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked.
[2025-02-05 12:02:05,802 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:05,802 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736316519]
[2025-02-05 12:02:05,802 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736316519] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:05,802 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:05,802 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:02:05,802 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997977549]
[2025-02-05 12:02:05,802 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:05,803 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:02:05,803 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:05,803 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:02:05,803 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:05,804 INFO  L87              Difference]: Start difference. First operand 4409 states and 5160 transitions. Second operand  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:07,298 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:07,299 INFO  L93              Difference]: Finished difference Result 10936 states and 12970 transitions.
[2025-02-05 12:02:07,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:07,299 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 187
[2025-02-05 12:02:07,300 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:07,323 INFO  L225             Difference]: With dead ends: 10936
[2025-02-05 12:02:07,324 INFO  L226             Difference]: Without dead ends: 6528
[2025-02-05 12:02:07,330 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:07,331 INFO  L435           NwaCegarLoop]: 383 mSDtfsCounter, 418 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:07,332 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 445 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 12:02:07,339 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6528 states.
[2025-02-05 12:02:07,436 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6528 to 4382.
[2025-02-05 12:02:07,443 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4382 states, 4381 states have (on average 1.1684546907098836) internal successors, (5119), 4381 states have internal predecessors, (5119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:07,452 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 5119 transitions.
[2025-02-05 12:02:07,453 INFO  L78                 Accepts]: Start accepts. Automaton has 4382 states and 5119 transitions. Word has length 187
[2025-02-05 12:02:07,453 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:07,453 INFO  L471      AbstractCegarLoop]: Abstraction has 4382 states and 5119 transitions.
[2025-02-05 12:02:07,453 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:07,453 INFO  L276                IsEmpty]: Start isEmpty. Operand 4382 states and 5119 transitions.
[2025-02-05 12:02:07,456 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 254
[2025-02-05 12:02:07,456 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:07,457 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 12:02:07,457 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 12:02:07,457 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:07,457 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:07,458 INFO  L85        PathProgramCache]: Analyzing trace with hash 1084783901, now seen corresponding path program 1 times
[2025-02-05 12:02:07,458 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:07,458 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91520286]
[2025-02-05 12:02:07,458 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:07,458 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:07,488 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes.
[2025-02-05 12:02:07,516 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements.
[2025-02-05 12:02:07,516 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:07,516 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:07,738 INFO  L134       CoverageAnalysis]: Checked inductivity of 143 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked.
[2025-02-05 12:02:07,738 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:07,738 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91520286]
[2025-02-05 12:02:07,739 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91520286] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:07,739 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:07,739 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:02:07,739 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084540476]
[2025-02-05 12:02:07,740 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:07,740 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:02:07,740 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:07,741 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:02:07,741 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:07,741 INFO  L87              Difference]: Start difference. First operand 4382 states and 5119 transitions. Second operand  has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:09,348 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:09,348 INFO  L93              Difference]: Finished difference Result 10045 states and 11706 transitions.
[2025-02-05 12:02:09,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:09,349 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 253
[2025-02-05 12:02:09,349 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:09,364 INFO  L225             Difference]: With dead ends: 10045
[2025-02-05 12:02:09,364 INFO  L226             Difference]: Without dead ends: 5665
[2025-02-05 12:02:09,370 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:09,373 INFO  L435           NwaCegarLoop]: 833 mSDtfsCounter, 403 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:09,373 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 894 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 12:02:09,381 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5665 states.
[2025-02-05 12:02:09,450 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5665 to 5234.
[2025-02-05 12:02:09,458 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5234 states, 5233 states have (on average 1.1587999235620103) internal successors, (6064), 5233 states have internal predecessors, (6064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:09,469 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 6064 transitions.
[2025-02-05 12:02:09,470 INFO  L78                 Accepts]: Start accepts. Automaton has 5234 states and 6064 transitions. Word has length 253
[2025-02-05 12:02:09,470 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:09,470 INFO  L471      AbstractCegarLoop]: Abstraction has 5234 states and 6064 transitions.
[2025-02-05 12:02:09,471 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:09,472 INFO  L276                IsEmpty]: Start isEmpty. Operand 5234 states and 6064 transitions.
[2025-02-05 12:02:09,479 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 266
[2025-02-05 12:02:09,479 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:09,480 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:02:09,480 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 12:02:09,480 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:09,480 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:09,480 INFO  L85        PathProgramCache]: Analyzing trace with hash -1578635229, now seen corresponding path program 1 times
[2025-02-05 12:02:09,480 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:09,481 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004527170]
[2025-02-05 12:02:09,481 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:09,481 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:09,509 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes.
[2025-02-05 12:02:09,546 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements.
[2025-02-05 12:02:09,546 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:09,546 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:10,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 306 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked.
[2025-02-05 12:02:10,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:10,006 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004527170]
[2025-02-05 12:02:10,006 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004527170] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:10,006 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:10,006 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:02:10,006 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89724373]
[2025-02-05 12:02:10,007 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:10,007 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:02:10,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:10,008 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:02:10,008 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:10,008 INFO  L87              Difference]: Start difference. First operand 5234 states and 6064 transitions. Second operand  has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:12,120 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:12,121 INFO  L93              Difference]: Finished difference Result 13049 states and 15222 transitions.
[2025-02-05 12:02:12,122 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:12,122 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 265
[2025-02-05 12:02:12,122 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:12,152 INFO  L225             Difference]: With dead ends: 13049
[2025-02-05 12:02:12,152 INFO  L226             Difference]: Without dead ends: 6942
[2025-02-05 12:02:12,157 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:12,158 INFO  L435           NwaCegarLoop]: 586 mSDtfsCounter, 493 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:12,158 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 630 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 12:02:12,165 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6942 states.
[2025-02-05 12:02:12,244 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6942 to 6512.
[2025-02-05 12:02:12,257 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6512 states, 6511 states have (on average 1.1520503762862848) internal successors, (7501), 6511 states have internal predecessors, (7501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:12,270 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 7501 transitions.
[2025-02-05 12:02:12,270 INFO  L78                 Accepts]: Start accepts. Automaton has 6512 states and 7501 transitions. Word has length 265
[2025-02-05 12:02:12,273 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:12,273 INFO  L471      AbstractCegarLoop]: Abstraction has 6512 states and 7501 transitions.
[2025-02-05 12:02:12,273 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:12,273 INFO  L276                IsEmpty]: Start isEmpty. Operand 6512 states and 7501 transitions.
[2025-02-05 12:02:12,277 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 289
[2025-02-05 12:02:12,277 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:12,278 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:02:12,278 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 12:02:12,278 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:12,280 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:12,280 INFO  L85        PathProgramCache]: Analyzing trace with hash -887393016, now seen corresponding path program 1 times
[2025-02-05 12:02:12,280 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:12,280 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163828580]
[2025-02-05 12:02:12,280 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:12,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:12,309 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes.
[2025-02-05 12:02:12,341 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements.
[2025-02-05 12:02:12,342 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:12,342 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:12,626 INFO  L134       CoverageAnalysis]: Checked inductivity of 307 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked.
[2025-02-05 12:02:12,626 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:12,626 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163828580]
[2025-02-05 12:02:12,626 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163828580] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:12,627 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:12,627 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:02:12,627 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416011190]
[2025-02-05 12:02:12,627 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:12,627 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:02:12,627 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:12,628 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:02:12,628 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:12,628 INFO  L87              Difference]: Start difference. First operand 6512 states and 7501 transitions. Second operand  has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:14,194 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:14,194 INFO  L93              Difference]: Finished difference Result 16010 states and 18477 transitions.
[2025-02-05 12:02:14,194 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:14,195 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 288
[2025-02-05 12:02:14,195 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:14,214 INFO  L225             Difference]: With dead ends: 16010
[2025-02-05 12:02:14,215 INFO  L226             Difference]: Without dead ends: 9500
[2025-02-05 12:02:14,221 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:14,222 INFO  L435           NwaCegarLoop]: 293 mSDtfsCounter, 416 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:14,222 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 337 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 12:02:14,228 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9500 states.
[2025-02-05 12:02:14,312 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9500 to 8644.
[2025-02-05 12:02:14,323 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8644 states, 8643 states have (on average 1.1545759574221914) internal successors, (9979), 8643 states have internal predecessors, (9979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:14,392 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8644 states to 8644 states and 9979 transitions.
[2025-02-05 12:02:14,396 INFO  L78                 Accepts]: Start accepts. Automaton has 8644 states and 9979 transitions. Word has length 288
[2025-02-05 12:02:14,396 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:14,396 INFO  L471      AbstractCegarLoop]: Abstraction has 8644 states and 9979 transitions.
[2025-02-05 12:02:14,397 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:14,397 INFO  L276                IsEmpty]: Start isEmpty. Operand 8644 states and 9979 transitions.
[2025-02-05 12:02:14,406 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 294
[2025-02-05 12:02:14,409 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:14,410 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:02:14,410 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 12:02:14,410 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:14,411 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:14,412 INFO  L85        PathProgramCache]: Analyzing trace with hash -1287616931, now seen corresponding path program 1 times
[2025-02-05 12:02:14,412 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:14,412 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252233909]
[2025-02-05 12:02:14,412 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:14,412 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:14,491 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes.
[2025-02-05 12:02:14,576 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements.
[2025-02-05 12:02:14,583 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:14,583 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:15,069 INFO  L134       CoverageAnalysis]: Checked inductivity of 317 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked.
[2025-02-05 12:02:15,070 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:15,070 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252233909]
[2025-02-05 12:02:15,070 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252233909] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:15,070 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:15,070 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 12:02:15,070 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670909010]
[2025-02-05 12:02:15,071 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:15,071 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:02:15,071 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:15,072 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:02:15,072 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:02:15,073 INFO  L87              Difference]: Start difference. First operand 8644 states and 9979 transitions. Second operand  has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:17,921 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:17,921 INFO  L93              Difference]: Finished difference Result 30559 states and 35506 transitions.
[2025-02-05 12:02:17,921 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:02:17,922 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 293
[2025-02-05 12:02:17,922 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:17,968 INFO  L225             Difference]: With dead ends: 30559
[2025-02-05 12:02:17,968 INFO  L226             Difference]: Without dead ends: 21062
[2025-02-05 12:02:17,982 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:02:17,983 INFO  L435           NwaCegarLoop]: 158 mSDtfsCounter, 876 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2648 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 2648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:17,984 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 270 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 2648 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2025-02-05 12:02:18,008 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21062 states.
[2025-02-05 12:02:18,281 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21062 to 21022.
[2025-02-05 12:02:18,330 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21022 states, 21021 states have (on average 1.142286285143428) internal successors, (24012), 21021 states have internal predecessors, (24012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:18,378 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21022 states to 21022 states and 24012 transitions.
[2025-02-05 12:02:18,379 INFO  L78                 Accepts]: Start accepts. Automaton has 21022 states and 24012 transitions. Word has length 293
[2025-02-05 12:02:18,379 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:18,379 INFO  L471      AbstractCegarLoop]: Abstraction has 21022 states and 24012 transitions.
[2025-02-05 12:02:18,380 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:18,380 INFO  L276                IsEmpty]: Start isEmpty. Operand 21022 states and 24012 transitions.
[2025-02-05 12:02:18,394 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 329
[2025-02-05 12:02:18,394 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:18,394 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:02:18,395 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 12:02:18,395 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:18,400 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:18,400 INFO  L85        PathProgramCache]: Analyzing trace with hash -432874605, now seen corresponding path program 1 times
[2025-02-05 12:02:18,400 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:18,400 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914659418]
[2025-02-05 12:02:18,400 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:18,400 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:18,479 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes.
[2025-02-05 12:02:18,532 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements.
[2025-02-05 12:02:18,535 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:18,536 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:19,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:02:19,240 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:19,240 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914659418]
[2025-02-05 12:02:19,240 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914659418] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:02:19,240 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618385950]
[2025-02-05 12:02:19,241 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:19,241 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:02:19,241 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:02:19,243 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 12:02:19,246 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 12:02:19,331 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes.
[2025-02-05 12:02:19,417 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements.
[2025-02-05 12:02:19,418 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:19,418 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:19,421 INFO  L256         TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-05 12:02:19,436 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:02:20,008 INFO  L134       CoverageAnalysis]: Checked inductivity of 361 backedges. 248 proven. 82 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2025-02-05 12:02:20,008 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 12:02:21,216 INFO  L134       CoverageAnalysis]: Checked inductivity of 361 backedges. 248 proven. 82 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2025-02-05 12:02:21,217 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [618385950] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 12:02:21,217 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-05 12:02:21,217 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9
[2025-02-05 12:02:21,217 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325221313]
[2025-02-05 12:02:21,217 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-05 12:02:21,219 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-05 12:02:21,219 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:21,220 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-05 12:02:21,220 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-02-05 12:02:21,220 INFO  L87              Difference]: Start difference. First operand 21022 states and 24012 transitions. Second operand  has 9 states, 9 states have (on average 90.44444444444444) internal successors, (814), 9 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:32,622 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:32,622 INFO  L93              Difference]: Finished difference Result 92412 states and 105636 transitions.
[2025-02-05 12:02:32,622 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-02-05 12:02:32,623 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 90.44444444444444) internal successors, (814), 9 states have internal predecessors, (814), 0 states have call successors, (0), 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 328
[2025-02-05 12:02:32,623 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:32,727 INFO  L225             Difference]: With dead ends: 92412
[2025-02-05 12:02:32,727 INFO  L226             Difference]: Without dead ends: 67985
[2025-02-05 12:02:32,754 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 664 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420
[2025-02-05 12:02:32,755 INFO  L435           NwaCegarLoop]: 96 mSDtfsCounter, 8155 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 11974 mSolverCounterSat, 2622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8155 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 14596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2622 IncrementalHoareTripleChecker+Valid, 11974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:32,756 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [8155 Valid, 419 Invalid, 14596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2622 Valid, 11974 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time]
[2025-02-05 12:02:32,810 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 67985 states.
[2025-02-05 12:02:33,404 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 67985 to 53386.
[2025-02-05 12:02:33,451 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 53386 states, 53385 states have (on average 1.1439355624239018) internal successors, (61069), 53385 states have internal predecessors, (61069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:33,527 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53386 states to 53386 states and 61069 transitions.
[2025-02-05 12:02:33,528 INFO  L78                 Accepts]: Start accepts. Automaton has 53386 states and 61069 transitions. Word has length 328
[2025-02-05 12:02:33,528 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:33,528 INFO  L471      AbstractCegarLoop]: Abstraction has 53386 states and 61069 transitions.
[2025-02-05 12:02:33,528 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 90.44444444444444) internal successors, (814), 9 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:33,529 INFO  L276                IsEmpty]: Start isEmpty. Operand 53386 states and 61069 transitions.
[2025-02-05 12:02:33,539 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 397
[2025-02-05 12:02:33,540 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:33,540 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:02:33,550 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-02-05 12:02:33,741 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2025-02-05 12:02:33,741 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:33,742 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:33,742 INFO  L85        PathProgramCache]: Analyzing trace with hash 176433580, now seen corresponding path program 1 times
[2025-02-05 12:02:33,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:33,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860094442]
[2025-02-05 12:02:33,742 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:33,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:33,781 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes.
[2025-02-05 12:02:33,970 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements.
[2025-02-05 12:02:33,970 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:33,970 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:34,145 INFO  L134       CoverageAnalysis]: Checked inductivity of 568 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked.
[2025-02-05 12:02:34,146 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:34,147 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860094442]
[2025-02-05 12:02:34,147 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860094442] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:34,147 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:34,147 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:02:34,147 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688610971]
[2025-02-05 12:02:34,147 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:34,148 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:02:34,148 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:34,148 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:02:34,148 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:34,149 INFO  L87              Difference]: Start difference. First operand 53386 states and 61069 transitions. Second operand  has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:36,037 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:36,038 INFO  L93              Difference]: Finished difference Result 119091 states and 136469 transitions.
[2025-02-05 12:02:36,038 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:36,038 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 396
[2025-02-05 12:02:36,038 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:36,133 INFO  L225             Difference]: With dead ends: 119091
[2025-02-05 12:02:36,134 INFO  L226             Difference]: Without dead ends: 65707
[2025-02-05 12:02:36,174 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:36,175 INFO  L435           NwaCegarLoop]: 724 mSDtfsCounter, 319 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:36,175 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 787 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-02-05 12:02:36,234 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 65707 states.
[2025-02-05 12:02:37,060 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 65707 to 63582.
[2025-02-05 12:02:37,108 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 63582 states, 63581 states have (on average 1.114483886695711) internal successors, (70860), 63581 states have internal predecessors, (70860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:37,218 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63582 states to 63582 states and 70860 transitions.
[2025-02-05 12:02:37,219 INFO  L78                 Accepts]: Start accepts. Automaton has 63582 states and 70860 transitions. Word has length 396
[2025-02-05 12:02:37,220 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:37,220 INFO  L471      AbstractCegarLoop]: Abstraction has 63582 states and 70860 transitions.
[2025-02-05 12:02:37,220 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:37,220 INFO  L276                IsEmpty]: Start isEmpty. Operand 63582 states and 70860 transitions.
[2025-02-05 12:02:37,230 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 411
[2025-02-05 12:02:37,230 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:37,230 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:02:37,231 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 12:02:37,232 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:37,232 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:37,233 INFO  L85        PathProgramCache]: Analyzing trace with hash -758692341, now seen corresponding path program 1 times
[2025-02-05 12:02:37,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:37,233 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132487390]
[2025-02-05 12:02:37,233 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:37,233 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:37,284 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes.
[2025-02-05 12:02:37,318 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements.
[2025-02-05 12:02:37,318 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:37,318 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:38,184 INFO  L134       CoverageAnalysis]: Checked inductivity of 637 backedges. 526 proven. 80 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2025-02-05 12:02:38,185 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:38,185 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132487390]
[2025-02-05 12:02:38,185 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132487390] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:02:38,185 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713515787]
[2025-02-05 12:02:38,185 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:38,185 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:02:38,185 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:02:38,188 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 12:02:38,190 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-05 12:02:38,256 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes.
[2025-02-05 12:02:38,342 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements.
[2025-02-05 12:02:38,343 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:38,343 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:38,346 INFO  L256         TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 12:02:38,356 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:02:38,761 INFO  L134       CoverageAnalysis]: Checked inductivity of 637 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2025-02-05 12:02:38,761 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 12:02:38,761 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [713515787] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:38,762 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 12:02:38,762 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8
[2025-02-05 12:02:38,762 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906343819]
[2025-02-05 12:02:38,762 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:38,763 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:02:38,763 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:38,763 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:02:38,763 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-02-05 12:02:38,764 INFO  L87              Difference]: Start difference. First operand 63582 states and 70860 transitions. Second operand  has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:40,955 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:40,955 INFO  L93              Difference]: Finished difference Result 127162 states and 141718 transitions.
[2025-02-05 12:02:40,956 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:02:40,956 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 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 410
[2025-02-05 12:02:40,956 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:41,022 INFO  L225             Difference]: With dead ends: 127162
[2025-02-05 12:02:41,022 INFO  L226             Difference]: Without dead ends: 63582
[2025-02-05 12:02:41,050 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-02-05 12:02:41,051 INFO  L435           NwaCegarLoop]: 236 mSDtfsCounter, 812 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2136 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 2136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:41,051 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 334 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 2136 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-02-05 12:02:41,097 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 63582 states.
[2025-02-05 12:02:41,781 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 63582 to 63157.
[2025-02-05 12:02:41,839 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 63157 states, 63156 states have (on average 1.114161758186079) internal successors, (70366), 63156 states have internal predecessors, (70366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:41,946 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63157 states to 63157 states and 70366 transitions.
[2025-02-05 12:02:41,947 INFO  L78                 Accepts]: Start accepts. Automaton has 63157 states and 70366 transitions. Word has length 410
[2025-02-05 12:02:41,948 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:41,948 INFO  L471      AbstractCegarLoop]: Abstraction has 63157 states and 70366 transitions.
[2025-02-05 12:02:41,948 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:41,949 INFO  L276                IsEmpty]: Start isEmpty. Operand 63157 states and 70366 transitions.
[2025-02-05 12:02:41,961 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 459
[2025-02-05 12:02:41,962 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:41,962 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:02:41,970 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-02-05 12:02:42,162 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:02:42,163 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:42,163 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:42,164 INFO  L85        PathProgramCache]: Analyzing trace with hash 1643556306, now seen corresponding path program 1 times
[2025-02-05 12:02:42,164 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:42,164 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410676118]
[2025-02-05 12:02:42,164 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:42,164 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:42,224 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes.
[2025-02-05 12:02:42,271 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements.
[2025-02-05 12:02:42,271 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:42,271 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:43,147 INFO  L134       CoverageAnalysis]: Checked inductivity of 615 backedges. 360 proven. 181 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked.
[2025-02-05 12:02:43,148 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:43,148 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410676118]
[2025-02-05 12:02:43,148 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410676118] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:02:43,148 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938395949]
[2025-02-05 12:02:43,148 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:43,148 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:02:43,148 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:02:43,150 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 12:02:43,153 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-02-05 12:02:43,226 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes.
[2025-02-05 12:02:43,318 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements.
[2025-02-05 12:02:43,318 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:43,318 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:43,320 INFO  L256         TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-02-05 12:02:43,325 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:02:43,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 615 backedges. 542 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked.
[2025-02-05 12:02:43,622 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 12:02:43,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938395949] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:43,622 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 12:02:43,622 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7
[2025-02-05 12:02:43,622 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076677582]
[2025-02-05 12:02:43,622 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:43,623 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:02:43,623 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:43,623 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:02:43,624 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-05 12:02:43,624 INFO  L87              Difference]: Start difference. First operand 63157 states and 70366 transitions. Second operand  has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:46,176 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:46,176 INFO  L93              Difference]: Finished difference Result 163781 states and 182720 transitions.
[2025-02-05 12:02:46,177 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:02:46,177 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 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 458
[2025-02-05 12:02:46,177 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:46,430 INFO  L225             Difference]: With dead ends: 163781
[2025-02-05 12:02:46,431 INFO  L226             Difference]: Without dead ends: 100626
[2025-02-05 12:02:46,461 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-05 12:02:46,462 INFO  L435           NwaCegarLoop]: 86 mSDtfsCounter, 761 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 2345 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 2345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:46,462 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 179 Invalid, 2863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 2345 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-02-05 12:02:46,527 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 100626 states.
[2025-02-05 12:02:47,455 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 100626 to 98494.
[2025-02-05 12:02:47,528 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98494 states, 98493 states have (on average 1.1112058724985532) internal successors, (109446), 98493 states have internal predecessors, (109446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:47,660 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98494 states to 98494 states and 109446 transitions.
[2025-02-05 12:02:47,661 INFO  L78                 Accepts]: Start accepts. Automaton has 98494 states and 109446 transitions. Word has length 458
[2025-02-05 12:02:47,662 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:47,662 INFO  L471      AbstractCegarLoop]: Abstraction has 98494 states and 109446 transitions.
[2025-02-05 12:02:47,662 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:47,662 INFO  L276                IsEmpty]: Start isEmpty. Operand 98494 states and 109446 transitions.
[2025-02-05 12:02:47,675 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 490
[2025-02-05 12:02:47,675 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:47,675 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:02:47,681 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-02-05 12:02:47,875 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 12:02:47,876 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:47,876 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:47,876 INFO  L85        PathProgramCache]: Analyzing trace with hash 1549654394, now seen corresponding path program 1 times
[2025-02-05 12:02:47,876 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:47,876 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998378472]
[2025-02-05 12:02:47,877 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:47,877 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:48,127 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes.
[2025-02-05 12:02:48,156 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements.
[2025-02-05 12:02:48,157 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:48,157 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:48,289 INFO  L134       CoverageAnalysis]: Checked inductivity of 613 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked.
[2025-02-05 12:02:48,289 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:48,289 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998378472]
[2025-02-05 12:02:48,289 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998378472] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:48,289 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:48,289 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:02:48,289 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423374424]
[2025-02-05 12:02:48,289 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:48,290 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:02:48,290 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:48,290 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:02:48,290 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:48,290 INFO  L87              Difference]: Start difference. First operand 98494 states and 109446 transitions. Second operand  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:50,083 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:50,084 INFO  L93              Difference]: Finished difference Result 202509 states and 224564 transitions.
[2025-02-05 12:02:50,084 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:50,084 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 489
[2025-02-05 12:02:50,085 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:50,192 INFO  L225             Difference]: With dead ends: 202509
[2025-02-05 12:02:50,192 INFO  L226             Difference]: Without dead ends: 100174
[2025-02-05 12:02:50,247 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:50,248 INFO  L435           NwaCegarLoop]: 613 mSDtfsCounter, 487 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:50,248 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 642 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 12:02:50,315 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 100174 states.
[2025-02-05 12:02:51,217 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 100174 to 90362.
[2025-02-05 12:02:51,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 90362 states, 90361 states have (on average 1.102931574462434) internal successors, (99662), 90361 states have internal predecessors, (99662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:51,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 90362 states to 90362 states and 99662 transitions.
[2025-02-05 12:02:51,411 INFO  L78                 Accepts]: Start accepts. Automaton has 90362 states and 99662 transitions. Word has length 489
[2025-02-05 12:02:51,411 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:51,411 INFO  L471      AbstractCegarLoop]: Abstraction has 90362 states and 99662 transitions.
[2025-02-05 12:02:51,411 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:51,412 INFO  L276                IsEmpty]: Start isEmpty. Operand 90362 states and 99662 transitions.
[2025-02-05 12:02:51,428 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 492
[2025-02-05 12:02:51,429 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:51,429 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:02:51,429 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 12:02:51,429 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:51,430 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:51,430 INFO  L85        PathProgramCache]: Analyzing trace with hash -1825525601, now seen corresponding path program 1 times
[2025-02-05 12:02:51,430 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:51,430 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656389563]
[2025-02-05 12:02:51,431 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:51,431 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:51,494 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes.
[2025-02-05 12:02:51,531 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements.
[2025-02-05 12:02:51,532 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:51,532 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:51,722 INFO  L134       CoverageAnalysis]: Checked inductivity of 613 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked.
[2025-02-05 12:02:51,722 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:51,722 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656389563]
[2025-02-05 12:02:51,722 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656389563] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:51,722 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:51,722 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:02:51,722 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157289373]
[2025-02-05 12:02:51,722 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:51,723 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:02:51,723 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:51,723 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:02:51,723 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:51,723 INFO  L87              Difference]: Start difference. First operand 90362 states and 99662 transitions. Second operand  has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:53,600 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:53,600 INFO  L93              Difference]: Finished difference Result 199471 states and 220093 transitions.
[2025-02-05 12:02:53,601 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:53,601 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 491
[2025-02-05 12:02:53,602 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:53,755 INFO  L225             Difference]: With dead ends: 199471
[2025-02-05 12:02:53,755 INFO  L226             Difference]: Without dead ends: 108686
[2025-02-05 12:02:53,814 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:53,815 INFO  L435           NwaCegarLoop]: 600 mSDtfsCounter, 458 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:53,815 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 638 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 12:02:53,888 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 108686 states.
[2025-02-05 12:02:54,975 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 108686 to 103547.
[2025-02-05 12:02:55,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 103547 states, 103546 states have (on average 1.0940837888474688) internal successors, (113288), 103546 states have internal predecessors, (113288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:55,192 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 103547 states to 103547 states and 113288 transitions.
[2025-02-05 12:02:55,194 INFO  L78                 Accepts]: Start accepts. Automaton has 103547 states and 113288 transitions. Word has length 491
[2025-02-05 12:02:55,195 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:55,195 INFO  L471      AbstractCegarLoop]: Abstraction has 103547 states and 113288 transitions.
[2025-02-05 12:02:55,195 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:55,195 INFO  L276                IsEmpty]: Start isEmpty. Operand 103547 states and 113288 transitions.
[2025-02-05 12:02:55,206 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 494
[2025-02-05 12:02:55,206 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:55,207 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:02:55,207 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 12:02:55,207 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:55,207 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:55,207 INFO  L85        PathProgramCache]: Analyzing trace with hash -1507404730, now seen corresponding path program 1 times
[2025-02-05 12:02:55,208 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:55,208 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414586620]
[2025-02-05 12:02:55,208 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:55,208 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:55,252 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes.
[2025-02-05 12:02:55,282 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements.
[2025-02-05 12:02:55,282 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:55,282 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:55,538 INFO  L134       CoverageAnalysis]: Checked inductivity of 911 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 521 trivial. 0 not checked.
[2025-02-05 12:02:55,538 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:55,538 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414586620]
[2025-02-05 12:02:55,538 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414586620] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:55,538 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:55,539 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:02:55,539 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484110733]
[2025-02-05 12:02:55,539 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:55,540 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:02:55,540 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:55,541 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:02:55,541 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:55,541 INFO  L87              Difference]: Start difference. First operand 103547 states and 113288 transitions. Second operand  has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:56,763 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:56,763 INFO  L93              Difference]: Finished difference Result 200692 states and 219132 transitions.
[2025-02-05 12:02:56,763 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:56,763 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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 493
[2025-02-05 12:02:56,764 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:56,872 INFO  L225             Difference]: With dead ends: 200692
[2025-02-05 12:02:56,872 INFO  L226             Difference]: Without dead ends: 97143
[2025-02-05 12:02:56,934 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:56,935 INFO  L435           NwaCegarLoop]: 94 mSDtfsCounter, 604 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:56,935 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 94 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 12:02:57,009 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 97143 states.
[2025-02-05 12:02:57,785 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 97143 to 95850.
[2025-02-05 12:02:57,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 95850 states, 95849 states have (on average 1.088514225500527) internal successors, (104333), 95849 states have internal predecessors, (104333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:57,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 95850 states to 95850 states and 104333 transitions.
[2025-02-05 12:02:57,974 INFO  L78                 Accepts]: Start accepts. Automaton has 95850 states and 104333 transitions. Word has length 493
[2025-02-05 12:02:57,975 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:57,975 INFO  L471      AbstractCegarLoop]: Abstraction has 95850 states and 104333 transitions.
[2025-02-05 12:02:57,975 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:02:57,975 INFO  L276                IsEmpty]: Start isEmpty. Operand 95850 states and 104333 transitions.
[2025-02-05 12:02:57,993 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 565
[2025-02-05 12:02:57,993 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:57,993 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-02-05 12:02:57,993 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 12:02:57,993 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:57,994 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:57,994 INFO  L85        PathProgramCache]: Analyzing trace with hash -369045731, now seen corresponding path program 1 times
[2025-02-05 12:02:57,994 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:57,994 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719596491]
[2025-02-05 12:02:57,994 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:57,994 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:58,046 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 564 statements into 1 equivalence classes.
[2025-02-05 12:02:58,084 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 564 of 564 statements.
[2025-02-05 12:02:58,084 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:58,084 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:58,902 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 771 proven. 72 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked.
[2025-02-05 12:02:58,903 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:58,903 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719596491]
[2025-02-05 12:02:58,903 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719596491] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:02:58,903 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37180466]
[2025-02-05 12:02:58,903 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:58,903 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:02:58,903 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:02:58,909 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 12:02:58,910 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-02-05 12:02:58,972 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 564 statements into 1 equivalence classes.
[2025-02-05 12:02:59,058 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 564 of 564 statements.
[2025-02-05 12:02:59,058 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:59,058 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:59,061 INFO  L256         TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 12:02:59,066 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:02:59,425 INFO  L134       CoverageAnalysis]: Checked inductivity of 1012 backedges. 843 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked.
[2025-02-05 12:02:59,426 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 12:02:59,426 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [37180466] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:59,426 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 12:02:59,426 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8
[2025-02-05 12:02:59,426 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559670858]
[2025-02-05 12:02:59,426 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:59,426 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:02:59,427 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:59,427 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:02:59,427 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-02-05 12:02:59,427 INFO  L87              Difference]: Start difference. First operand 95850 states and 104333 transitions. Second operand  has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)