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


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label31.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f24c408f41095e30eafeb1a084d204fc8ef13a530aced92918a05abf66b230d
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 01:01:10,482 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 01:01:10,538 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 01:01:10,543 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 01:01:10,544 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 01:01:10,568 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 01:01:10,569 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 01:01:10,569 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 01:01:10,570 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 01:01:10,570 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 01:01:10,571 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 01:01:10,571 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 01:01:10,571 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 01:01:10,571 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 01:01:10,571 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 01:01:10,571 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 01:01:10,571 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 01:01:10,571 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 01:01:10,571 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 01:01:10,572 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 01:01:10,572 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 01:01:10,572 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 01:01:10,573 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 01:01:10,573 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f24c408f41095e30eafeb1a084d204fc8ef13a530aced92918a05abf66b230d
[2025-03-08 01:01:10,809 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 01:01:10,816 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 01:01:10,818 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 01:01:10,819 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 01:01:10,820 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 01:01:10,821 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label31.c
[2025-03-08 01:01:11,989 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54e5ede57/d90da05beeae477d8dcfbc0273b16b4f/FLAG203ab2970
[2025-03-08 01:01:12,351 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 01:01:12,351 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label31.c
[2025-03-08 01:01:12,367 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54e5ede57/d90da05beeae477d8dcfbc0273b16b4f/FLAG203ab2970
[2025-03-08 01:01:12,380 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54e5ede57/d90da05beeae477d8dcfbc0273b16b4f
[2025-03-08 01:01:12,383 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 01:01:12,384 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 01:01:12,386 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 01:01:12,386 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 01:01:12,391 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 01:01:12,392 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:01:12" (1/1) ...
[2025-03-08 01:01:12,393 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcac6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:12, skipping insertion in model container
[2025-03-08 01:01:12,393 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:01:12" (1/1) ...
[2025-03-08 01:01:12,444 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 01:01:12,762 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label31.c[54594,54607]
[2025-03-08 01:01:12,798 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 01:01:12,807 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 01:01:12,913 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label31.c[54594,54607]
[2025-03-08 01:01:12,929 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 01:01:12,947 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 01:01:12,948 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:12 WrapperNode
[2025-03-08 01:01:12,948 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 01:01:12,949 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 01:01:12,949 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 01:01:12,949 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 01:01:12,954 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:12" (1/1) ...
[2025-03-08 01:01:12,976 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:12" (1/1) ...
[2025-03-08 01:01:13,054 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769
[2025-03-08 01:01:13,055 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 01:01:13,056 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 01:01:13,056 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 01:01:13,056 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 01:01:13,062 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:12" (1/1) ...
[2025-03-08 01:01:13,063 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:12" (1/1) ...
[2025-03-08 01:01:13,079 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:12" (1/1) ...
[2025-03-08 01:01:13,112 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 01:01:13,113 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:12" (1/1) ...
[2025-03-08 01:01:13,113 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:12" (1/1) ...
[2025-03-08 01:01:13,156 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:12" (1/1) ...
[2025-03-08 01:01:13,161 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:12" (1/1) ...
[2025-03-08 01:01:13,165 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:12" (1/1) ...
[2025-03-08 01:01:13,173 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:12" (1/1) ...
[2025-03-08 01:01:13,185 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 01:01:13,187 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 01:01:13,187 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 01:01:13,187 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 01:01:13,187 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:12" (1/1) ...
[2025-03-08 01:01:13,223 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 01:01:13,232 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:01:13,244 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 01:01:13,250 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 01:01:13,264 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 01:01:13,265 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 01:01:13,265 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 01:01:13,265 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 01:01:13,332 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 01:01:13,333 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 01:01:14,711 INFO  L?                        ?]: Removed 147 outVars from TransFormulas that were not future-live.
[2025-03-08 01:01:14,712 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 01:01:14,730 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 01:01:14,733 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 01:01:14,733 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:01:14 BoogieIcfgContainer
[2025-03-08 01:01:14,733 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 01:01:14,735 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 01:01:14,735 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 01:01:14,739 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 01:01:14,739 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:01:12" (1/3) ...
[2025-03-08 01:01:14,739 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2175d3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:01:14, skipping insertion in model container
[2025-03-08 01:01:14,739 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:01:12" (2/3) ...
[2025-03-08 01:01:14,740 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2175d3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:01:14, skipping insertion in model container
[2025-03-08 01:01:14,740 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:01:14" (3/3) ...
[2025-03-08 01:01:14,741 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem03_label31.c
[2025-03-08 01:01:14,753 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 01:01:14,756 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label31.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 01:01:14,814 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 01:01:14,822 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;@7f65cd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 01:01:14,822 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 01:01:14,830 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:14,841 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2025-03-08 01:01:14,841 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:14,842 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:01:14,842 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:14,845 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:14,846 INFO  L85        PathProgramCache]: Analyzing trace with hash -1694512226, now seen corresponding path program 1 times
[2025-03-08 01:01:14,850 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:14,851 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994124526]
[2025-03-08 01:01:14,851 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:14,851 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:14,933 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-03-08 01:01:15,048 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-03-08 01:01:15,053 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:15,053 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:15,558 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:01:15,558 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:01:15,558 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994124526]
[2025-03-08 01:01:15,559 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994124526] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:01:15,559 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:01:15,560 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:01:15,561 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814672024]
[2025-03-08 01:01:15,562 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:01:15,564 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:01:15,566 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:01:15,581 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:01:15,582 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:15,584 INFO  L87              Difference]: Start difference. First operand  has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:16,444 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:01:16,445 INFO  L93              Difference]: Finished difference Result 855 states and 1493 transitions.
[2025-03-08 01:01:16,446 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:01:16,447 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151
[2025-03-08 01:01:16,448 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:01:16,455 INFO  L225             Difference]: With dead ends: 855
[2025-03-08 01:01:16,455 INFO  L226             Difference]: Without dead ends: 460
[2025-03-08 01:01:16,458 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:16,460 INFO  L435           NwaCegarLoop]: 139 mSDtfsCounter, 145 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 01:01:16,460 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 175 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 01:01:16,471 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 460 states.
[2025-03-08 01:01:16,504 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 459.
[2025-03-08 01:01:16,505 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 459 states, 458 states have (on average 1.5502183406113537) internal successors, (710), 458 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:16,513 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 710 transitions.
[2025-03-08 01:01:16,514 INFO  L78                 Accepts]: Start accepts. Automaton has 459 states and 710 transitions. Word has length 151
[2025-03-08 01:01:16,514 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:01:16,514 INFO  L471      AbstractCegarLoop]: Abstraction has 459 states and 710 transitions.
[2025-03-08 01:01:16,515 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:16,515 INFO  L276                IsEmpty]: Start isEmpty. Operand 459 states and 710 transitions.
[2025-03-08 01:01:16,517 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2025-03-08 01:01:16,517 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:16,517 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:01:16,517 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 01:01:16,518 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:16,518 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:16,518 INFO  L85        PathProgramCache]: Analyzing trace with hash -212224908, now seen corresponding path program 1 times
[2025-03-08 01:01:16,518 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:16,518 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202188692]
[2025-03-08 01:01:16,519 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:16,519 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:16,561 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes.
[2025-03-08 01:01:16,570 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements.
[2025-03-08 01:01:16,570 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:16,570 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:16,843 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:01:16,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:01:16,845 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202188692]
[2025-03-08 01:01:16,845 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202188692] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:01:16,845 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:01:16,845 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:01:16,845 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247028082]
[2025-03-08 01:01:16,845 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:01:16,846 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:01:16,847 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:01:16,847 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:01:16,848 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:16,848 INFO  L87              Difference]: Start difference. First operand 459 states and 710 transitions. Second operand  has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:17,068 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:01:17,072 INFO  L93              Difference]: Finished difference Result 1372 states and 2125 transitions.
[2025-03-08 01:01:17,073 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:01:17,073 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 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 156
[2025-03-08 01:01:17,073 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:01:17,077 INFO  L225             Difference]: With dead ends: 1372
[2025-03-08 01:01:17,077 INFO  L226             Difference]: Without dead ends: 915
[2025-03-08 01:01:17,078 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:17,079 INFO  L435           NwaCegarLoop]: 308 mSDtfsCounter, 366 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 01:01:17,079 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 596 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 01:01:17,082 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 915 states.
[2025-03-08 01:01:17,110 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 913.
[2025-03-08 01:01:17,111 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 913 states, 912 states have (on average 1.5460526315789473) internal successors, (1410), 912 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:17,114 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1410 transitions.
[2025-03-08 01:01:17,114 INFO  L78                 Accepts]: Start accepts. Automaton has 913 states and 1410 transitions. Word has length 156
[2025-03-08 01:01:17,114 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:01:17,114 INFO  L471      AbstractCegarLoop]: Abstraction has 913 states and 1410 transitions.
[2025-03-08 01:01:17,114 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:17,115 INFO  L276                IsEmpty]: Start isEmpty. Operand 913 states and 1410 transitions.
[2025-03-08 01:01:17,119 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2025-03-08 01:01:17,119 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:17,119 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:01:17,119 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 01:01:17,119 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:17,120 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:17,120 INFO  L85        PathProgramCache]: Analyzing trace with hash 132077448, now seen corresponding path program 1 times
[2025-03-08 01:01:17,120 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:17,120 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95582044]
[2025-03-08 01:01:17,120 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:17,120 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:17,152 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-03-08 01:01:17,158 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-03-08 01:01:17,162 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:17,163 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:17,264 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:01:17,265 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:01:17,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95582044]
[2025-03-08 01:01:17,265 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95582044] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:01:17,265 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:01:17,265 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:01:17,265 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322688722]
[2025-03-08 01:01:17,265 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:01:17,265 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:01:17,267 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:01:17,268 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:01:17,268 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:17,268 INFO  L87              Difference]: Start difference. First operand 913 states and 1410 transitions. Second operand  has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:17,953 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:01:17,954 INFO  L93              Difference]: Finished difference Result 2685 states and 4171 transitions.
[2025-03-08 01:01:17,954 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:01:17,954 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 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 159
[2025-03-08 01:01:17,955 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:01:17,960 INFO  L225             Difference]: With dead ends: 2685
[2025-03-08 01:01:17,961 INFO  L226             Difference]: Without dead ends: 1774
[2025-03-08 01:01:17,962 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:17,963 INFO  L435           NwaCegarLoop]: 139 mSDtfsCounter, 237 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:01:17,963 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 153 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:01:17,965 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1774 states.
[2025-03-08 01:01:17,996 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1738.
[2025-03-08 01:01:17,998 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1738 states, 1737 states have (on average 1.5146804835924006) internal successors, (2631), 1737 states have internal predecessors, (2631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:18,003 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2631 transitions.
[2025-03-08 01:01:18,003 INFO  L78                 Accepts]: Start accepts. Automaton has 1738 states and 2631 transitions. Word has length 159
[2025-03-08 01:01:18,003 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:01:18,003 INFO  L471      AbstractCegarLoop]: Abstraction has 1738 states and 2631 transitions.
[2025-03-08 01:01:18,004 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:18,004 INFO  L276                IsEmpty]: Start isEmpty. Operand 1738 states and 2631 transitions.
[2025-03-08 01:01:18,006 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2025-03-08 01:01:18,006 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:18,006 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:01:18,006 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 01:01:18,007 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:18,007 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:18,007 INFO  L85        PathProgramCache]: Analyzing trace with hash -1135292041, now seen corresponding path program 1 times
[2025-03-08 01:01:18,007 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:18,007 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669598679]
[2025-03-08 01:01:18,007 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:18,007 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:18,048 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes.
[2025-03-08 01:01:18,053 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements.
[2025-03-08 01:01:18,054 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:18,054 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:18,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:01:18,146 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:01:18,147 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669598679]
[2025-03-08 01:01:18,147 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669598679] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:01:18,147 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:01:18,147 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:01:18,147 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747652836]
[2025-03-08 01:01:18,147 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:01:18,147 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:01:18,147 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:01:18,148 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:01:18,148 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:18,148 INFO  L87              Difference]: Start difference. First operand 1738 states and 2631 transitions. Second operand  has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:18,447 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:01:18,448 INFO  L93              Difference]: Finished difference Result 5178 states and 7849 transitions.
[2025-03-08 01:01:18,448 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:01:18,448 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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 165
[2025-03-08 01:01:18,449 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:01:18,459 INFO  L225             Difference]: With dead ends: 5178
[2025-03-08 01:01:18,459 INFO  L226             Difference]: Without dead ends: 3442
[2025-03-08 01:01:18,464 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:18,466 INFO  L435           NwaCegarLoop]: 272 mSDtfsCounter, 349 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 01:01:18,467 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 513 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 01:01:18,472 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3442 states.
[2025-03-08 01:01:18,525 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3438.
[2025-03-08 01:01:18,530 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3438 states, 3437 states have (on average 1.5085830666278732) internal successors, (5185), 3437 states have internal predecessors, (5185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:18,542 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 5185 transitions.
[2025-03-08 01:01:18,542 INFO  L78                 Accepts]: Start accepts. Automaton has 3438 states and 5185 transitions. Word has length 165
[2025-03-08 01:01:18,542 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:01:18,542 INFO  L471      AbstractCegarLoop]: Abstraction has 3438 states and 5185 transitions.
[2025-03-08 01:01:18,543 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:18,543 INFO  L276                IsEmpty]: Start isEmpty. Operand 3438 states and 5185 transitions.
[2025-03-08 01:01:18,546 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 167
[2025-03-08 01:01:18,550 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:18,550 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:01:18,550 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 01:01:18,550 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:18,551 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:18,551 INFO  L85        PathProgramCache]: Analyzing trace with hash 1419770147, now seen corresponding path program 1 times
[2025-03-08 01:01:18,551 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:18,551 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163567175]
[2025-03-08 01:01:18,551 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:18,551 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:18,610 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes.
[2025-03-08 01:01:18,638 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements.
[2025-03-08 01:01:18,638 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:18,638 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:18,874 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:01:18,875 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:01:18,875 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163567175]
[2025-03-08 01:01:18,875 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163567175] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:01:18,875 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513225094]
[2025-03-08 01:01:18,876 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:18,876 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:01:18,876 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:01:18,878 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 01:01:18,879 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 01:01:18,935 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes.
[2025-03-08 01:01:18,984 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements.
[2025-03-08 01:01:18,985 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:18,985 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:18,987 INFO  L256         TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 01:01:18,996 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:01:19,162 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-08 01:01:19,163 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 01:01:19,163 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513225094] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:01:19,163 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 01:01:19,163 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-03-08 01:01:19,163 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287467162]
[2025-03-08 01:01:19,163 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:01:19,164 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:01:19,164 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:01:19,164 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:01:19,164 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 01:01:19,164 INFO  L87              Difference]: Start difference. First operand 3438 states and 5185 transitions. Second operand  has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:19,827 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:01:19,827 INFO  L93              Difference]: Finished difference Result 10134 states and 15316 transitions.
[2025-03-08 01:01:19,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:01:19,827 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 166
[2025-03-08 01:01:19,828 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:01:19,845 INFO  L225             Difference]: With dead ends: 10134
[2025-03-08 01:01:19,845 INFO  L226             Difference]: Without dead ends: 6698
[2025-03-08 01:01:19,849 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 01:01:19,849 INFO  L435           NwaCegarLoop]: 388 mSDtfsCounter, 89 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:01:19,849 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 417 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:01:19,854 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6698 states.
[2025-03-08 01:01:19,935 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6698 to 6686.
[2025-03-08 01:01:19,943 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6686 states, 6685 states have (on average 1.3356768885564696) internal successors, (8929), 6685 states have internal predecessors, (8929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:19,954 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6686 states to 6686 states and 8929 transitions.
[2025-03-08 01:01:19,955 INFO  L78                 Accepts]: Start accepts. Automaton has 6686 states and 8929 transitions. Word has length 166
[2025-03-08 01:01:19,955 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:01:19,955 INFO  L471      AbstractCegarLoop]: Abstraction has 6686 states and 8929 transitions.
[2025-03-08 01:01:19,956 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:19,957 INFO  L276                IsEmpty]: Start isEmpty. Operand 6686 states and 8929 transitions.
[2025-03-08 01:01:19,962 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 167
[2025-03-08 01:01:19,963 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:19,963 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:01:19,970 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-08 01:01:20,163 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:01:20,164 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:20,165 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:20,165 INFO  L85        PathProgramCache]: Analyzing trace with hash -1862705331, now seen corresponding path program 1 times
[2025-03-08 01:01:20,165 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:20,165 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198060273]
[2025-03-08 01:01:20,165 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:20,165 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:20,199 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes.
[2025-03-08 01:01:20,207 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements.
[2025-03-08 01:01:20,207 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:20,207 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:20,353 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:01:20,353 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:01:20,353 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198060273]
[2025-03-08 01:01:20,354 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198060273] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:01:20,354 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:01:20,354 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:01:20,354 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018077036]
[2025-03-08 01:01:20,354 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:01:20,355 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:01:20,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:01:20,355 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:01:20,355 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:20,356 INFO  L87              Difference]: Start difference. First operand 6686 states and 8929 transitions. Second operand  has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:21,097 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:01:21,097 INFO  L93              Difference]: Finished difference Result 19915 states and 26599 transitions.
[2025-03-08 01:01:21,098 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:01:21,098 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 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 166
[2025-03-08 01:01:21,098 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:01:21,133 INFO  L225             Difference]: With dead ends: 19915
[2025-03-08 01:01:21,133 INFO  L226             Difference]: Without dead ends: 13231
[2025-03-08 01:01:21,144 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:21,144 INFO  L435           NwaCegarLoop]: 126 mSDtfsCounter, 239 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:01:21,145 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 161 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:01:21,157 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13231 states.
[2025-03-08 01:01:21,310 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13231 to 13219.
[2025-03-08 01:01:21,327 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13219 states, 13218 states have (on average 1.2806778635194431) internal successors, (16928), 13218 states have internal predecessors, (16928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:21,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13219 states to 13219 states and 16928 transitions.
[2025-03-08 01:01:21,351 INFO  L78                 Accepts]: Start accepts. Automaton has 13219 states and 16928 transitions. Word has length 166
[2025-03-08 01:01:21,351 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:01:21,351 INFO  L471      AbstractCegarLoop]: Abstraction has 13219 states and 16928 transitions.
[2025-03-08 01:01:21,351 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:21,351 INFO  L276                IsEmpty]: Start isEmpty. Operand 13219 states and 16928 transitions.
[2025-03-08 01:01:21,361 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 187
[2025-03-08 01:01:21,361 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:21,361 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:01:21,361 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 01:01:21,361 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:21,362 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:21,362 INFO  L85        PathProgramCache]: Analyzing trace with hash 1663858562, now seen corresponding path program 1 times
[2025-03-08 01:01:21,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:21,362 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104237247]
[2025-03-08 01:01:21,362 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:21,362 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:21,390 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes.
[2025-03-08 01:01:21,397 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements.
[2025-03-08 01:01:21,397 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:21,398 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:21,465 INFO  L134       CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2025-03-08 01:01:21,465 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:01:21,465 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104237247]
[2025-03-08 01:01:21,465 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104237247] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:01:21,465 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:01:21,465 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:01:21,465 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141388915]
[2025-03-08 01:01:21,465 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:01:21,465 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:01:21,465 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:01:21,466 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:01:21,466 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:21,466 INFO  L87              Difference]: Start difference. First operand 13219 states and 16928 transitions. Second operand  has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:21,890 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:01:21,890 INFO  L93              Difference]: Finished difference Result 26332 states and 33714 transitions.
[2025-03-08 01:01:21,891 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:01:21,891 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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 186
[2025-03-08 01:01:21,891 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:01:21,916 INFO  L225             Difference]: With dead ends: 26332
[2025-03-08 01:01:21,917 INFO  L226             Difference]: Without dead ends: 13115
[2025-03-08 01:01:21,928 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:21,929 INFO  L435           NwaCegarLoop]: 31 mSDtfsCounter, 321 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 01:01:21,929 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 01:01:21,941 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13115 states.
[2025-03-08 01:01:22,070 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13115 to 13115.
[2025-03-08 01:01:22,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13115 states, 13114 states have (on average 1.2520969955772456) internal successors, (16420), 13114 states have internal predecessors, (16420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:22,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13115 states to 13115 states and 16420 transitions.
[2025-03-08 01:01:22,104 INFO  L78                 Accepts]: Start accepts. Automaton has 13115 states and 16420 transitions. Word has length 186
[2025-03-08 01:01:22,104 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:01:22,104 INFO  L471      AbstractCegarLoop]: Abstraction has 13115 states and 16420 transitions.
[2025-03-08 01:01:22,105 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:22,105 INFO  L276                IsEmpty]: Start isEmpty. Operand 13115 states and 16420 transitions.
[2025-03-08 01:01:22,113 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 193
[2025-03-08 01:01:22,114 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:22,114 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:01:22,114 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 01:01:22,114 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:22,114 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:22,115 INFO  L85        PathProgramCache]: Analyzing trace with hash 285831091, now seen corresponding path program 1 times
[2025-03-08 01:01:22,115 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:22,115 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352730956]
[2025-03-08 01:01:22,115 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:22,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:22,140 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes.
[2025-03-08 01:01:22,147 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements.
[2025-03-08 01:01:22,147 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:22,147 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:22,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:01:22,355 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:01:22,355 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352730956]
[2025-03-08 01:01:22,356 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352730956] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:01:22,356 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:01:22,356 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:01:22,356 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724165736]
[2025-03-08 01:01:22,356 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:01:22,356 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:01:22,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:01:22,357 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:01:22,357 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:22,357 INFO  L87              Difference]: Start difference. First operand 13115 states and 16420 transitions. Second operand  has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:23,120 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:01:23,121 INFO  L93              Difference]: Finished difference Result 32773 states and 40915 transitions.
[2025-03-08 01:01:23,121 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:01:23,121 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 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 192
[2025-03-08 01:01:23,122 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:01:23,157 INFO  L225             Difference]: With dead ends: 32773
[2025-03-08 01:01:23,157 INFO  L226             Difference]: Without dead ends: 19660
[2025-03-08 01:01:23,172 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:23,173 INFO  L435           NwaCegarLoop]: 88 mSDtfsCounter, 197 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:01:23,173 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 100 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:01:23,194 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19660 states.
[2025-03-08 01:01:23,407 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19660 to 19656.
[2025-03-08 01:01:23,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19656 states, 19655 states have (on average 1.2361740015263292) internal successors, (24297), 19655 states have internal predecessors, (24297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:23,455 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19656 states to 19656 states and 24297 transitions.
[2025-03-08 01:01:23,455 INFO  L78                 Accepts]: Start accepts. Automaton has 19656 states and 24297 transitions. Word has length 192
[2025-03-08 01:01:23,455 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:01:23,456 INFO  L471      AbstractCegarLoop]: Abstraction has 19656 states and 24297 transitions.
[2025-03-08 01:01:23,456 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:23,456 INFO  L276                IsEmpty]: Start isEmpty. Operand 19656 states and 24297 transitions.
[2025-03-08 01:01:23,465 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 200
[2025-03-08 01:01:23,465 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:23,465 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:01:23,466 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 01:01:23,466 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:23,466 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:23,466 INFO  L85        PathProgramCache]: Analyzing trace with hash 1490857336, now seen corresponding path program 1 times
[2025-03-08 01:01:23,466 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:23,467 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015371207]
[2025-03-08 01:01:23,467 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:23,467 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:23,494 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes.
[2025-03-08 01:01:23,503 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements.
[2025-03-08 01:01:23,504 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:23,504 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:23,784 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:01:23,784 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:01:23,784 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015371207]
[2025-03-08 01:01:23,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015371207] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:01:23,785 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769856913]
[2025-03-08 01:01:23,785 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:23,785 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:01:23,785 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:01:23,787 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 01:01:23,789 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-08 01:01:23,838 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes.
[2025-03-08 01:01:23,887 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements.
[2025-03-08 01:01:23,887 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:23,887 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:23,889 INFO  L256         TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 01:01:23,892 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:01:24,057 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-08 01:01:24,058 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 01:01:24,058 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769856913] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:01:24,058 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 01:01:24,058 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-08 01:01:24,058 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014583301]
[2025-03-08 01:01:24,058 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:01:24,059 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:01:24,059 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:01:24,059 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:01:24,059 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 01:01:24,059 INFO  L87              Difference]: Start difference. First operand 19656 states and 24297 transitions. Second operand  has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:24,749 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:01:24,749 INFO  L93              Difference]: Finished difference Result 38938 states and 48142 transitions.
[2025-03-08 01:01:24,750 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:01:24,750 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199
[2025-03-08 01:01:24,750 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:01:24,779 INFO  L225             Difference]: With dead ends: 38938
[2025-03-08 01:01:24,780 INFO  L226             Difference]: Without dead ends: 19284
[2025-03-08 01:01:24,796 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 01:01:24,797 INFO  L435           NwaCegarLoop]: 315 mSDtfsCounter, 74 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:01:24,797 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 330 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:01:24,808 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19284 states.
[2025-03-08 01:01:24,934 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19284 to 19250.
[2025-03-08 01:01:24,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19250 states, 19249 states have (on average 1.222037508441997) internal successors, (23523), 19249 states have internal predecessors, (23523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:24,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19250 states to 19250 states and 23523 transitions.
[2025-03-08 01:01:24,974 INFO  L78                 Accepts]: Start accepts. Automaton has 19250 states and 23523 transitions. Word has length 199
[2025-03-08 01:01:24,974 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:01:24,975 INFO  L471      AbstractCegarLoop]: Abstraction has 19250 states and 23523 transitions.
[2025-03-08 01:01:24,975 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:24,975 INFO  L276                IsEmpty]: Start isEmpty. Operand 19250 states and 23523 transitions.
[2025-03-08 01:01:24,985 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2025-03-08 01:01:24,985 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:24,985 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:01:24,992 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-03-08 01:01:25,186 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8
[2025-03-08 01:01:25,186 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:25,186 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:25,187 INFO  L85        PathProgramCache]: Analyzing trace with hash 1977257277, now seen corresponding path program 1 times
[2025-03-08 01:01:25,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:25,187 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551821008]
[2025-03-08 01:01:25,187 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:25,187 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:25,219 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes.
[2025-03-08 01:01:25,227 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements.
[2025-03-08 01:01:25,227 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:25,227 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:25,300 INFO  L134       CoverageAnalysis]: Checked inductivity of 70 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-08 01:01:25,300 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:01:25,300 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551821008]
[2025-03-08 01:01:25,301 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551821008] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:01:25,301 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:01:25,301 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:01:25,301 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907724416]
[2025-03-08 01:01:25,301 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:01:25,301 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:01:25,302 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:01:25,302 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:01:25,302 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:25,302 INFO  L87              Difference]: Start difference. First operand 19250 states and 23523 transitions. Second operand  has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:26,035 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:01:26,035 INFO  L93              Difference]: Finished difference Result 56010 states and 68539 transitions.
[2025-03-08 01:01:26,036 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:01:26,036 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 205
[2025-03-08 01:01:26,036 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:01:26,081 INFO  L225             Difference]: With dead ends: 56010
[2025-03-08 01:01:26,081 INFO  L226             Difference]: Without dead ends: 36762
[2025-03-08 01:01:26,102 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:26,102 INFO  L435           NwaCegarLoop]: 338 mSDtfsCounter, 228 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:01:26,103 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 358 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:01:26,129 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36762 states.
[2025-03-08 01:01:26,467 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36762 to 36746.
[2025-03-08 01:01:26,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36746 states, 36745 states have (on average 1.1960266702952782) internal successors, (43948), 36745 states have internal predecessors, (43948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:26,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36746 states to 36746 states and 43948 transitions.
[2025-03-08 01:01:26,554 INFO  L78                 Accepts]: Start accepts. Automaton has 36746 states and 43948 transitions. Word has length 205
[2025-03-08 01:01:26,554 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:01:26,554 INFO  L471      AbstractCegarLoop]: Abstraction has 36746 states and 43948 transitions.
[2025-03-08 01:01:26,554 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:26,554 INFO  L276                IsEmpty]: Start isEmpty. Operand 36746 states and 43948 transitions.
[2025-03-08 01:01:26,574 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2025-03-08 01:01:26,574 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:26,574 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:01:26,574 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 01:01:26,574 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:26,575 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:26,575 INFO  L85        PathProgramCache]: Analyzing trace with hash -1712724028, now seen corresponding path program 1 times
[2025-03-08 01:01:26,575 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:26,575 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404999477]
[2025-03-08 01:01:26,575 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:26,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:26,619 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes.
[2025-03-08 01:01:26,629 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements.
[2025-03-08 01:01:26,629 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:26,629 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:26,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 120 backedges. 83 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2025-03-08 01:01:26,962 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:01:26,962 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404999477]
[2025-03-08 01:01:26,962 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404999477] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:01:26,962 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143535798]
[2025-03-08 01:01:26,962 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:26,963 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:01:26,963 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:01:26,965 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 01:01:26,966 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-08 01:01:27,023 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes.
[2025-03-08 01:01:27,081 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements.
[2025-03-08 01:01:27,081 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:27,081 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:27,084 INFO  L256         TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 01:01:27,087 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:01:27,113 INFO  L134       CoverageAnalysis]: Checked inductivity of 120 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-03-08 01:01:27,113 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 01:01:27,113 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143535798] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:01:27,113 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 01:01:27,113 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-08 01:01:27,114 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934719411]
[2025-03-08 01:01:27,114 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:01:27,114 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:01:27,114 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:01:27,114 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:01:27,114 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-08 01:01:27,115 INFO  L87              Difference]: Start difference. First operand 36746 states and 43948 transitions. Second operand  has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:27,840 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:01:27,841 INFO  L93              Difference]: Finished difference Result 85682 states and 103926 transitions.
[2025-03-08 01:01:27,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:01:27,841 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 224
[2025-03-08 01:01:27,841 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:01:27,900 INFO  L225             Difference]: With dead ends: 85682
[2025-03-08 01:01:27,900 INFO  L226             Difference]: Without dead ends: 48938
[2025-03-08 01:01:27,930 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2025-03-08 01:01:27,930 INFO  L435           NwaCegarLoop]: 116 mSDtfsCounter, 204 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 01:01:27,931 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 136 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 01:01:27,967 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48938 states.
[2025-03-08 01:01:28,435 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48938 to 48926.
[2025-03-08 01:01:28,474 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 48926 states, 48925 states have (on average 1.1684619315278488) internal successors, (57167), 48925 states have internal predecessors, (57167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:28,652 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48926 states to 48926 states and 57167 transitions.
[2025-03-08 01:01:28,653 INFO  L78                 Accepts]: Start accepts. Automaton has 48926 states and 57167 transitions. Word has length 224
[2025-03-08 01:01:28,653 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:01:28,653 INFO  L471      AbstractCegarLoop]: Abstraction has 48926 states and 57167 transitions.
[2025-03-08 01:01:28,653 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:28,654 INFO  L276                IsEmpty]: Start isEmpty. Operand 48926 states and 57167 transitions.
[2025-03-08 01:01:28,668 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 227
[2025-03-08 01:01:28,669 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:28,669 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:01:28,676 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-03-08 01:01:28,869 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:01:28,870 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:28,870 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:28,870 INFO  L85        PathProgramCache]: Analyzing trace with hash -805355245, now seen corresponding path program 1 times
[2025-03-08 01:01:28,870 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:28,870 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541789363]
[2025-03-08 01:01:28,870 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:28,870 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:28,895 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes.
[2025-03-08 01:01:28,905 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements.
[2025-03-08 01:01:28,905 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:28,905 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:29,094 INFO  L134       CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:01:29,095 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:01:29,095 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541789363]
[2025-03-08 01:01:29,095 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541789363] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:01:29,095 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:01:29,095 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 01:01:29,095 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127037673]
[2025-03-08 01:01:29,095 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:01:29,095 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:01:29,095 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:01:29,096 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:01:29,096 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:29,096 INFO  L87              Difference]: Start difference. First operand 48926 states and 57167 transitions. Second operand  has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:30,094 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:01:30,095 INFO  L93              Difference]: Finished difference Result 119496 states and 139877 transitions.
[2025-03-08 01:01:30,097 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:01:30,097 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 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 226
[2025-03-08 01:01:30,097 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:01:30,185 INFO  L225             Difference]: With dead ends: 119496
[2025-03-08 01:01:30,186 INFO  L226             Difference]: Without dead ends: 70572
[2025-03-08 01:01:30,224 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:30,225 INFO  L435           NwaCegarLoop]: 146 mSDtfsCounter, 159 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 01:01:30,225 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 161 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 01:01:30,276 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 70572 states.
[2025-03-08 01:01:30,929 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 70572 to 70566.
[2025-03-08 01:01:30,981 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 70566 states, 70565 states have (on average 1.1705944873520868) internal successors, (82603), 70565 states have internal predecessors, (82603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:31,056 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 70566 states to 70566 states and 82603 transitions.
[2025-03-08 01:01:31,057 INFO  L78                 Accepts]: Start accepts. Automaton has 70566 states and 82603 transitions. Word has length 226
[2025-03-08 01:01:31,057 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:01:31,057 INFO  L471      AbstractCegarLoop]: Abstraction has 70566 states and 82603 transitions.
[2025-03-08 01:01:31,057 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:31,057 INFO  L276                IsEmpty]: Start isEmpty. Operand 70566 states and 82603 transitions.
[2025-03-08 01:01:31,073 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-03-08 01:01:31,074 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:31,074 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:01:31,074 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 01:01:31,074 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:31,074 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:31,074 INFO  L85        PathProgramCache]: Analyzing trace with hash 1616803417, now seen corresponding path program 1 times
[2025-03-08 01:01:31,074 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:31,075 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900978465]
[2025-03-08 01:01:31,075 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:31,075 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:31,098 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-08 01:01:31,107 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-08 01:01:31,108 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:31,108 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:31,924 INFO  L134       CoverageAnalysis]: Checked inductivity of 83 backedges. 77 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:01:31,925 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:01:31,925 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900978465]
[2025-03-08 01:01:31,925 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900978465] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:01:31,925 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074980902]
[2025-03-08 01:01:31,925 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:31,925 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:01:31,925 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:01:31,928 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 01:01:31,931 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-08 01:01:31,998 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-08 01:01:32,054 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-08 01:01:32,055 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:32,055 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:32,057 INFO  L256         TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 01:01:32,060 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:01:32,198 INFO  L134       CoverageAnalysis]: Checked inductivity of 83 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-08 01:01:32,198 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 01:01:32,199 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074980902] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:01:32,199 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 01:01:32,199 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-08 01:01:32,199 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955747375]
[2025-03-08 01:01:32,199 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:01:32,199 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:01:32,199 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:01:32,200 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:01:32,200 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 01:01:32,200 INFO  L87              Difference]: Start difference. First operand 70566 states and 82603 transitions. Second operand  has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:33,007 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:01:33,008 INFO  L93              Difference]: Finished difference Result 140342 states and 164238 transitions.
[2025-03-08 01:01:33,008 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:01:33,008 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 231
[2025-03-08 01:01:33,008 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:01:33,110 INFO  L225             Difference]: With dead ends: 140342
[2025-03-08 01:01:33,110 INFO  L226             Difference]: Without dead ends: 69778
[2025-03-08 01:01:33,152 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 01:01:33,153 INFO  L435           NwaCegarLoop]: 76 mSDtfsCounter, 106 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 01:01:33,153 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 88 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 01:01:33,205 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 69778 states.
[2025-03-08 01:01:33,943 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 69778 to 69748.
[2025-03-08 01:01:33,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 69748 states, 69747 states have (on average 1.1468593631267294) internal successors, (79990), 69747 states have internal predecessors, (79990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:34,074 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 69748 states to 69748 states and 79990 transitions.
[2025-03-08 01:01:34,075 INFO  L78                 Accepts]: Start accepts. Automaton has 69748 states and 79990 transitions. Word has length 231
[2025-03-08 01:01:34,076 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:01:34,076 INFO  L471      AbstractCegarLoop]: Abstraction has 69748 states and 79990 transitions.
[2025-03-08 01:01:34,076 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:34,076 INFO  L276                IsEmpty]: Start isEmpty. Operand 69748 states and 79990 transitions.
[2025-03-08 01:01:34,093 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 248
[2025-03-08 01:01:34,093 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:34,093 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 01:01:34,099 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-03-08 01:01:34,293 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:01:34,294 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:34,294 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:34,294 INFO  L85        PathProgramCache]: Analyzing trace with hash 1757722838, now seen corresponding path program 1 times
[2025-03-08 01:01:34,294 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:34,294 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725661192]
[2025-03-08 01:01:34,294 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:34,294 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:34,319 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes.
[2025-03-08 01:01:34,334 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements.
[2025-03-08 01:01:34,335 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:34,335 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:35,322 INFO  L134       CoverageAnalysis]: Checked inductivity of 95 backedges. 30 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:01:35,322 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:01:35,323 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725661192]
[2025-03-08 01:01:35,323 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725661192] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:01:35,323 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051183834]
[2025-03-08 01:01:35,323 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:35,323 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:01:35,323 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:01:35,326 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 01:01:35,328 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-08 01:01:35,380 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes.
[2025-03-08 01:01:35,432 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements.
[2025-03-08 01:01:35,432 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:35,432 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:35,434 INFO  L256         TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 01:01:35,437 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:01:35,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked.
[2025-03-08 01:01:35,624 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 01:01:35,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051183834] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:01:35,624 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 01:01:35,624 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6
[2025-03-08 01:01:35,624 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62858641]
[2025-03-08 01:01:35,625 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:01:35,625 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:01:35,625 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:01:35,625 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:01:35,626 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 01:01:35,626 INFO  L87              Difference]: Start difference. First operand 69748 states and 79990 transitions. Second operand  has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:36,444 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:01:36,444 INFO  L93              Difference]: Finished difference Result 171275 states and 196943 transitions.
[2025-03-08 01:01:36,444 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:01:36,444 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 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 247
[2025-03-08 01:01:36,445 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:01:36,580 INFO  L225             Difference]: With dead ends: 171275
[2025-03-08 01:01:36,580 INFO  L226             Difference]: Without dead ends: 101529
[2025-03-08 01:01:36,635 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 01:01:36,635 INFO  L435           NwaCegarLoop]: 147 mSDtfsCounter, 78 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 01:01:36,635 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 174 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 01:01:36,702 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 101529 states.
[2025-03-08 01:01:37,543 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 101529 to 95135.
[2025-03-08 01:01:37,802 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 95135 states, 95134 states have (on average 1.1532575104589315) internal successors, (109714), 95134 states have internal predecessors, (109714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:37,957 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 95135 states to 95135 states and 109714 transitions.
[2025-03-08 01:01:37,959 INFO  L78                 Accepts]: Start accepts. Automaton has 95135 states and 109714 transitions. Word has length 247
[2025-03-08 01:01:37,960 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:01:37,960 INFO  L471      AbstractCegarLoop]: Abstraction has 95135 states and 109714 transitions.
[2025-03-08 01:01:37,960 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:37,960 INFO  L276                IsEmpty]: Start isEmpty. Operand 95135 states and 109714 transitions.
[2025-03-08 01:01:38,035 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 287
[2025-03-08 01:01:38,036 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:38,036 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:01:38,043 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-03-08 01:01:38,237 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2025-03-08 01:01:38,238 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:38,238 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:38,239 INFO  L85        PathProgramCache]: Analyzing trace with hash -775858107, now seen corresponding path program 1 times
[2025-03-08 01:01:38,239 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:38,239 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877888046]
[2025-03-08 01:01:38,240 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:38,240 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:38,288 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes.
[2025-03-08 01:01:38,298 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements.
[2025-03-08 01:01:38,298 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:38,298 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:38,623 INFO  L134       CoverageAnalysis]: Checked inductivity of 217 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked.
[2025-03-08 01:01:38,624 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:01:38,624 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877888046]
[2025-03-08 01:01:38,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877888046] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:01:38,624 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:01:38,624 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:01:38,624 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546440065]
[2025-03-08 01:01:38,624 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:01:38,624 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 01:01:38,624 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:01:38,625 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 01:01:38,625 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 01:01:38,625 INFO  L87              Difference]: Start difference. First operand 95135 states and 109714 transitions. Second operand  has 4 states, 4 states have (on average 51.75) 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-03-08 01:01:40,287 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:01:40,287 INFO  L93              Difference]: Finished difference Result 315302 states and 362971 transitions.
[2025-03-08 01:01:40,287 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 01:01:40,288 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 51.75) 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 286
[2025-03-08 01:01:40,288 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:01:40,586 INFO  L225             Difference]: With dead ends: 315302
[2025-03-08 01:01:40,586 INFO  L226             Difference]: Without dead ends: 220169
[2025-03-08 01:01:40,663 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-08 01:01:40,664 INFO  L435           NwaCegarLoop]: 31 mSDtfsCounter, 538 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 01:01:40,664 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 273 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 01:01:40,834 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 220169 states.
[2025-03-08 01:01:43,421 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 220169 to 220119.
[2025-03-08 01:01:43,537 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 220119 states, 220118 states have (on average 1.1487974631788405) internal successors, (252871), 220118 states have internal predecessors, (252871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:43,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 220119 states to 220119 states and 252871 transitions.
[2025-03-08 01:01:43,977 INFO  L78                 Accepts]: Start accepts. Automaton has 220119 states and 252871 transitions. Word has length 286
[2025-03-08 01:01:43,977 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:01:43,977 INFO  L471      AbstractCegarLoop]: Abstraction has 220119 states and 252871 transitions.
[2025-03-08 01:01:43,977 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 51.75) 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-03-08 01:01:43,977 INFO  L276                IsEmpty]: Start isEmpty. Operand 220119 states and 252871 transitions.
[2025-03-08 01:01:44,005 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 297
[2025-03-08 01:01:44,005 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:44,006 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:01:44,006 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-08 01:01:44,006 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:44,006 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:44,006 INFO  L85        PathProgramCache]: Analyzing trace with hash -719627427, now seen corresponding path program 1 times
[2025-03-08 01:01:44,006 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:44,006 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131808538]
[2025-03-08 01:01:44,006 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:44,007 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:44,044 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes.
[2025-03-08 01:01:44,056 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements.
[2025-03-08 01:01:44,057 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:44,057 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:44,523 INFO  L134       CoverageAnalysis]: Checked inductivity of 219 backedges. 138 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2025-03-08 01:01:44,524 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:01:44,524 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131808538]
[2025-03-08 01:01:44,524 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131808538] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:01:44,524 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942364694]
[2025-03-08 01:01:44,524 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:44,524 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:01:44,524 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:01:44,527 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 01:01:44,528 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-03-08 01:01:44,601 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes.
[2025-03-08 01:01:44,673 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements.
[2025-03-08 01:01:44,674 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:44,674 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:44,676 INFO  L256         TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 01:01:44,683 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:01:44,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2025-03-08 01:01:44,808 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 01:01:44,808 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [942364694] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:01:44,808 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 01:01:44,808 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-08 01:01:44,808 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028810122]
[2025-03-08 01:01:44,808 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:01:44,808 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:01:44,808 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:01:44,809 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:01:44,809 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 01:01:44,809 INFO  L87              Difference]: Start difference. First operand 220119 states and 252871 transitions. Second operand  has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:46,469 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:01:46,469 INFO  L93              Difference]: Finished difference Result 435812 states and 500896 transitions.
[2025-03-08 01:01:46,470 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:01:46,470 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 296
[2025-03-08 01:01:46,470 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:01:46,807 INFO  L225             Difference]: With dead ends: 435812
[2025-03-08 01:01:46,807 INFO  L226             Difference]: Without dead ends: 215695
[2025-03-08 01:01:46,890 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 01:01:46,891 INFO  L435           NwaCegarLoop]: 281 mSDtfsCounter, 114 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 01:01:46,892 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 290 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 01:01:47,055 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 215695 states.
[2025-03-08 01:01:49,658 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 215695 to 209756.
[2025-03-08 01:01:49,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 209756 states, 209755 states have (on average 1.1378656051107243) internal successors, (238673), 209755 states have internal predecessors, (238673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:50,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 209756 states to 209756 states and 238673 transitions.
[2025-03-08 01:01:50,105 INFO  L78                 Accepts]: Start accepts. Automaton has 209756 states and 238673 transitions. Word has length 296
[2025-03-08 01:01:50,105 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:01:50,105 INFO  L471      AbstractCegarLoop]: Abstraction has 209756 states and 238673 transitions.
[2025-03-08 01:01:50,105 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:50,105 INFO  L276                IsEmpty]: Start isEmpty. Operand 209756 states and 238673 transitions.
[2025-03-08 01:01:50,158 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 357
[2025-03-08 01:01:50,158 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:50,158 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:01:50,168 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-03-08 01:01:50,363 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-03-08 01:01:50,363 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:50,363 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:50,363 INFO  L85        PathProgramCache]: Analyzing trace with hash -1227225319, now seen corresponding path program 1 times
[2025-03-08 01:01:50,363 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:50,364 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004708188]
[2025-03-08 01:01:50,364 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:50,364 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:50,398 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes.
[2025-03-08 01:01:50,413 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements.
[2025-03-08 01:01:50,413 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:50,413 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:50,759 INFO  L134       CoverageAnalysis]: Checked inductivity of 299 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:01:50,759 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:01:50,759 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004708188]
[2025-03-08 01:01:50,759 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004708188] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:01:50,759 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:01:50,759 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:01:50,759 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226366209]
[2025-03-08 01:01:50,759 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:01:50,760 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:01:50,760 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:01:50,760 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:01:50,760 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:50,760 INFO  L87              Difference]: Start difference. First operand 209756 states and 238673 transitions. Second operand  has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:52,262 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:01:52,262 INFO  L93              Difference]: Finished difference Result 395005 states and 448496 transitions.
[2025-03-08 01:01:52,263 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:01:52,263 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 356
[2025-03-08 01:01:52,263 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:01:52,554 INFO  L225             Difference]: With dead ends: 395005
[2025-03-08 01:01:52,554 INFO  L226             Difference]: Without dead ends: 185251
[2025-03-08 01:01:52,637 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:52,637 INFO  L435           NwaCegarLoop]: 315 mSDtfsCounter, 151 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 01:01:52,638 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 330 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 01:01:52,772 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 185251 states.
[2025-03-08 01:01:55,114 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 185251 to 185223.
[2025-03-08 01:01:55,219 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 185223 states, 185222 states have (on average 1.1047445767781365) internal successors, (204623), 185222 states have internal predecessors, (204623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:55,428 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 185223 states to 185223 states and 204623 transitions.
[2025-03-08 01:01:55,432 INFO  L78                 Accepts]: Start accepts. Automaton has 185223 states and 204623 transitions. Word has length 356
[2025-03-08 01:01:55,432 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:01:55,432 INFO  L471      AbstractCegarLoop]: Abstraction has 185223 states and 204623 transitions.
[2025-03-08 01:01:55,432 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:55,433 INFO  L276                IsEmpty]: Start isEmpty. Operand 185223 states and 204623 transitions.
[2025-03-08 01:01:55,489 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 384
[2025-03-08 01:01:55,490 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:55,490 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:01:55,490 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-08 01:01:55,490 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:55,490 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:55,490 INFO  L85        PathProgramCache]: Analyzing trace with hash -560623206, now seen corresponding path program 1 times
[2025-03-08 01:01:55,490 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:55,490 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473596767]
[2025-03-08 01:01:55,490 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:55,491 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:55,526 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes.
[2025-03-08 01:01:55,535 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements.
[2025-03-08 01:01:55,535 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:55,535 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:01:55,639 INFO  L134       CoverageAnalysis]: Checked inductivity of 379 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked.
[2025-03-08 01:01:55,639 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:01:55,639 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473596767]
[2025-03-08 01:01:55,639 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473596767] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:01:55,639 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 01:01:55,639 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 01:01:55,639 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12341349]
[2025-03-08 01:01:55,640 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:01:55,641 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 01:01:55,641 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:01:55,641 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 01:01:55,641 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:55,642 INFO  L87              Difference]: Start difference. First operand 185223 states and 204623 transitions. Second operand  has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:57,008 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:01:57,009 INFO  L93              Difference]: Finished difference Result 342001 states and 377440 transitions.
[2025-03-08 01:01:57,009 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 01:01:57,009 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 383
[2025-03-08 01:01:57,010 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:01:57,241 INFO  L225             Difference]: With dead ends: 342001
[2025-03-08 01:01:57,241 INFO  L226             Difference]: Without dead ends: 156780
[2025-03-08 01:01:57,695 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 01:01:57,696 INFO  L435           NwaCegarLoop]: 303 mSDtfsCounter, 222 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 01:01:57,696 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 318 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 01:01:57,811 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 156780 states.
[2025-03-08 01:01:59,243 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 156780 to 80845.
[2025-03-08 01:01:59,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 80845 states, 80844 states have (on average 1.091336400969769) internal successors, (88228), 80844 states have internal predecessors, (88228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:59,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80845 states to 80845 states and 88228 transitions.
[2025-03-08 01:01:59,435 INFO  L78                 Accepts]: Start accepts. Automaton has 80845 states and 88228 transitions. Word has length 383
[2025-03-08 01:01:59,435 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:01:59,435 INFO  L471      AbstractCegarLoop]: Abstraction has 80845 states and 88228 transitions.
[2025-03-08 01:01:59,435 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:01:59,435 INFO  L276                IsEmpty]: Start isEmpty. Operand 80845 states and 88228 transitions.
[2025-03-08 01:01:59,467 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 404
[2025-03-08 01:01:59,467 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:01:59,467 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:01:59,467 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-08 01:01:59,468 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:01:59,468 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:01:59,468 INFO  L85        PathProgramCache]: Analyzing trace with hash 1794944827, now seen corresponding path program 1 times
[2025-03-08 01:01:59,468 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:01:59,468 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536589152]
[2025-03-08 01:01:59,468 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:01:59,468 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:01:59,512 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes.
[2025-03-08 01:01:59,522 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements.
[2025-03-08 01:01:59,522 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:01:59,522 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:02:00,954 INFO  L134       CoverageAnalysis]: Checked inductivity of 464 backedges. 223 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked.
[2025-03-08 01:02:00,955 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:02:00,955 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536589152]
[2025-03-08 01:02:00,955 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536589152] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:02:00,955 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749072529]
[2025-03-08 01:02:00,955 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:02:00,955 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:02:00,955 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:02:00,959 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 01:02:00,962 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-03-08 01:02:01,053 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes.
[2025-03-08 01:02:01,143 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements.
[2025-03-08 01:02:01,143 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:02:01,143 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:02:01,147 INFO  L256         TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-08 01:02:01,153 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:02:01,354 INFO  L134       CoverageAnalysis]: Checked inductivity of 464 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked.
[2025-03-08 01:02:01,354 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 01:02:01,355 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749072529] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:02:01,355 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 01:02:01,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-08 01:02:01,355 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575178681]
[2025-03-08 01:02:01,355 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:02:01,355 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 01:02:01,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:02:01,356 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 01:02:01,356 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 01:02:01,356 INFO  L87              Difference]: Start difference. First operand 80845 states and 88228 transitions. Second operand  has 4 states, 4 states have (on average 58.25) 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-03-08 01:02:02,442 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:02:02,442 INFO  L93              Difference]: Finished difference Result 170232 states and 185412 transitions.
[2025-03-08 01:02:02,442 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 01:02:02,443 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 58.25) 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 403
[2025-03-08 01:02:02,443 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:02:02,562 INFO  L225             Difference]: With dead ends: 170232
[2025-03-08 01:02:02,562 INFO  L226             Difference]: Without dead ends: 89389
[2025-03-08 01:02:02,625 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 01:02:02,626 INFO  L435           NwaCegarLoop]: 111 mSDtfsCounter, 493 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 01:02:02,626 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 139 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 01:02:02,698 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 89389 states.
[2025-03-08 01:02:03,532 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 89389 to 83078.
[2025-03-08 01:02:03,598 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 83078 states, 83077 states have (on average 1.0852943654681801) internal successors, (90163), 83077 states have internal predecessors, (90163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:02:03,680 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83078 states to 83078 states and 90163 transitions.
[2025-03-08 01:02:03,683 INFO  L78                 Accepts]: Start accepts. Automaton has 83078 states and 90163 transitions. Word has length 403
[2025-03-08 01:02:03,684 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:02:03,684 INFO  L471      AbstractCegarLoop]: Abstraction has 83078 states and 90163 transitions.
[2025-03-08 01:02:03,684 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 58.25) 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-03-08 01:02:03,684 INFO  L276                IsEmpty]: Start isEmpty. Operand 83078 states and 90163 transitions.
[2025-03-08 01:02:03,712 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 418
[2025-03-08 01:02:03,712 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:02:03,712 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:02:03,720 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-03-08 01:02:03,913 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:02:03,913 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:02:03,913 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:02:03,914 INFO  L85        PathProgramCache]: Analyzing trace with hash -1119906716, now seen corresponding path program 1 times
[2025-03-08 01:02:03,914 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:02:03,914 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359725260]
[2025-03-08 01:02:03,914 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:02:03,914 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:02:03,959 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes.
[2025-03-08 01:02:03,985 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements.
[2025-03-08 01:02:03,986 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:02:03,986 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:02:05,405 INFO  L134       CoverageAnalysis]: Checked inductivity of 444 backedges. 389 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 01:02:05,405 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 01:02:05,405 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359725260]
[2025-03-08 01:02:05,405 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359725260] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 01:02:05,405 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492892678]
[2025-03-08 01:02:05,405 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:02:05,405 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:02:05,405 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 01:02:05,407 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 01:02:05,409 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-03-08 01:02:05,480 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes.
[2025-03-08 01:02:05,576 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements.
[2025-03-08 01:02:05,576 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:02:05,576 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 01:02:05,581 INFO  L256         TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-03-08 01:02:05,586 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 01:02:05,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 444 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-08 01:02:05,851 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 01:02:05,851 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [492892678] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 01:02:05,851 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 01:02:05,852 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9
[2025-03-08 01:02:05,852 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358445074]
[2025-03-08 01:02:05,852 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 01:02:05,852 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 01:02:05,852 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 01:02:05,853 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 01:02:05,853 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-03-08 01:02:05,853 INFO  L87              Difference]: Start difference. First operand 83078 states and 90163 transitions. Second operand  has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:02:07,094 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 01:02:07,094 INFO  L93              Difference]: Finished difference Result 179200 states and 194599 transitions.
[2025-03-08 01:02:07,094 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 01:02:07,094 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 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 417
[2025-03-08 01:02:07,095 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 01:02:07,229 INFO  L225             Difference]: With dead ends: 179200
[2025-03-08 01:02:07,229 INFO  L226             Difference]: Without dead ends: 96124
[2025-03-08 01:02:07,297 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-03-08 01:02:07,297 INFO  L435           NwaCegarLoop]: 75 mSDtfsCounter, 335 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 01:02:07,299 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 93 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 01:02:07,378 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96124 states.
[2025-03-08 01:02:08,631 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96124 to 92416.
[2025-03-08 01:02:08,705 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92416 states, 92415 states have (on average 1.0793053075799384) internal successors, (99744), 92415 states have internal predecessors, (99744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:02:08,835 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92416 states to 92416 states and 99744 transitions.
[2025-03-08 01:02:08,839 INFO  L78                 Accepts]: Start accepts. Automaton has 92416 states and 99744 transitions. Word has length 417
[2025-03-08 01:02:08,840 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 01:02:08,840 INFO  L471      AbstractCegarLoop]: Abstraction has 92416 states and 99744 transitions.
[2025-03-08 01:02:08,840 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 01:02:08,840 INFO  L276                IsEmpty]: Start isEmpty. Operand 92416 states and 99744 transitions.
[2025-03-08 01:02:08,886 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 469
[2025-03-08 01:02:08,886 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 01:02:08,886 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 01:02:08,893 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2025-03-08 01:02:09,087 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 01:02:09,090 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 01:02:09,090 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 01:02:09,090 INFO  L85        PathProgramCache]: Analyzing trace with hash 1354120156, now seen corresponding path program 1 times
[2025-03-08 01:02:09,091 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 01:02:09,091 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803778256]
[2025-03-08 01:02:09,091 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 01:02:09,091 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 01:02:09,167 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes.
[2025-03-08 01:02:09,194 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements.
[2025-03-08 01:02:09,194 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 01:02:09,194 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat