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


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


Checking for ERROR reachability
Using default analysis
Version 798a7b37
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/Problem12_label38.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 96ba89cb3a10a6781dfc1b6622655a925bd28641990009005f1ed4397d7ee8ac
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 10:37:44,617 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 10:37:44,674 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 10:37:44,680 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 10:37:44,680 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 10:37:44,700 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 10:37:44,701 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 10:37:44,702 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 10:37:44,702 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 10:37:44,702 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 10:37:44,702 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 10:37:44,702 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 10:37:44,703 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 10:37:44,703 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 10:37:44,703 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 10:37:44,703 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 10:37:44,704 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 10:37:44,704 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 10:37:44,704 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 10:37:44,704 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 10:37:44,704 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 10:37:44,704 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 10:37:44,704 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 10:37:44,704 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 10:37:44,705 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 10:37:44,705 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 10:37:44,705 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 10:37:44,705 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 10:37:44,705 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 10:37:44,705 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 10:37:44,705 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 10:37:44,705 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 10:37:44,705 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 10:37:44,705 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 10:37:44,706 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 10:37:44,706 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 10:37:44,706 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 10:37:44,706 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 10:37:44,706 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 10:37:44,706 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 10:37:44,706 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 10:37:44,706 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 10:37:44,706 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 10:37:44,706 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 -> 96ba89cb3a10a6781dfc1b6622655a925bd28641990009005f1ed4397d7ee8ac
[2025-03-03 10:37:44,917 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 10:37:44,924 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 10:37:44,925 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 10:37:44,926 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 10:37:44,927 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 10:37:44,928 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label38.c
[2025-03-03 10:37:45,979 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e36fd5b9e/a6677c6147874bbb8b9f262b71020d3e/FLAG53d801298
[2025-03-03 10:37:46,406 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 10:37:46,407 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label38.c
[2025-03-03 10:37:46,436 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e36fd5b9e/a6677c6147874bbb8b9f262b71020d3e/FLAG53d801298
[2025-03-03 10:37:46,449 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e36fd5b9e/a6677c6147874bbb8b9f262b71020d3e
[2025-03-03 10:37:46,451 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 10:37:46,452 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 10:37:46,454 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 10:37:46,454 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 10:37:46,457 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 10:37:46,458 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:37:46" (1/1) ...
[2025-03-03 10:37:46,459 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390e58be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:46, skipping insertion in model container
[2025-03-03 10:37:46,460 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:37:46" (1/1) ...
[2025-03-03 10:37:46,535 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 10:37:46,677 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/Problem12_label38.c[3304,3317]
[2025-03-03 10:37:47,117 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 10:37:47,128 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 10:37:47,143 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/Problem12_label38.c[3304,3317]
[2025-03-03 10:37:47,367 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 10:37:47,382 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 10:37:47,383 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:47 WrapperNode
[2025-03-03 10:37:47,384 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 10:37:47,384 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 10:37:47,385 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 10:37:47,385 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 10:37:47,389 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:47" (1/1) ...
[2025-03-03 10:37:47,430 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:47" (1/1) ...
[2025-03-03 10:37:47,635 INFO  L138                Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758
[2025-03-03 10:37:47,636 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 10:37:47,636 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 10:37:47,636 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 10:37:47,636 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 10:37:47,643 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:47" (1/1) ...
[2025-03-03 10:37:47,643 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:47" (1/1) ...
[2025-03-03 10:37:47,675 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:47" (1/1) ...
[2025-03-03 10:37:47,846 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-03 10:37:47,846 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:47" (1/1) ...
[2025-03-03 10:37:47,847 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:47" (1/1) ...
[2025-03-03 10:37:47,981 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:47" (1/1) ...
[2025-03-03 10:37:48,038 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:47" (1/1) ...
[2025-03-03 10:37:48,069 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:47" (1/1) ...
[2025-03-03 10:37:48,085 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:47" (1/1) ...
[2025-03-03 10:37:48,126 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 10:37:48,127 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 10:37:48,128 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 10:37:48,128 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 10:37:48,129 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:47" (1/1) ...
[2025-03-03 10:37:48,133 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 10:37:48,143 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:37:48,154 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-03 10:37:48,160 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-03 10:37:48,175 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 10:37:48,175 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 10:37:48,175 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 10:37:48,175 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 10:37:48,224 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 10:37:48,225 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 10:37:51,322 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1;
[2025-03-03 10:37:51,324 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1;
[2025-03-03 10:37:51,324 INFO  L1325  $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1;
[2025-03-03 10:37:51,486 INFO  L?                        ?]: Removed 702 outVars from TransFormulas that were not future-live.
[2025-03-03 10:37:51,487 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 10:37:51,515 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 10:37:51,519 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 10:37:51,519 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:37:51 BoogieIcfgContainer
[2025-03-03 10:37:51,519 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 10:37:51,521 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 10:37:51,521 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 10:37:51,524 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 10:37:51,524 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:37:46" (1/3) ...
[2025-03-03 10:37:51,525 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c4e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:37:51, skipping insertion in model container
[2025-03-03 10:37:51,525 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:37:47" (2/3) ...
[2025-03-03 10:37:51,525 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c4e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:37:51, skipping insertion in model container
[2025-03-03 10:37:51,525 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:37:51" (3/3) ...
[2025-03-03 10:37:51,526 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem12_label38.c
[2025-03-03 10:37:51,538 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 10:37:51,540 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label38.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 10:37:51,611 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 10:37:51,621 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;@1287ce8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 10:37:51,622 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 10:37:51,628 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:37:51,632 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-03-03 10:37:51,633 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:37:51,634 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]
[2025-03-03 10:37:51,634 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:37:51,637 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:37:51,639 INFO  L85        PathProgramCache]: Analyzing trace with hash -802590109, now seen corresponding path program 1 times
[2025-03-03 10:37:51,644 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:37:51,644 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677719162]
[2025-03-03 10:37:51,645 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:37:51,646 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:37:51,699 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-03-03 10:37:51,723 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-03-03 10:37:51,726 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:37:51,726 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:37:51,854 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-03 10:37:51,856 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:37:51,856 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677719162]
[2025-03-03 10:37:51,857 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677719162] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:37:51,857 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:37:51,857 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:37:51,858 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916259582]
[2025-03-03 10:37:51,858 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:37:51,861 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:37:51,862 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:37:51,873 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:37:51,874 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:37:51,877 INFO  L87              Difference]: Start difference. First operand  has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-03 10:37:54,756 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:37:54,757 INFO  L93              Difference]: Finished difference Result 2404 states and 4642 transitions.
[2025-03-03 10:37:54,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:37:54,758 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24
[2025-03-03 10:37:54,759 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:37:54,776 INFO  L225             Difference]: With dead ends: 2404
[2025-03-03 10:37:54,776 INFO  L226             Difference]: Without dead ends: 1506
[2025-03-03 10:37:54,780 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-03 10:37:54,782 INFO  L435           NwaCegarLoop]: 515 mSDtfsCounter, 796 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:37:54,783 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 525 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-03-03 10:37:54,796 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1506 states.
[2025-03-03 10:37:54,860 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506.
[2025-03-03 10:37:54,863 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1506 states, 1505 states have (on average 1.6066445182724252) internal successors, (2418), 1505 states have internal predecessors, (2418), 0 states have call successors, (0), 0 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-03 10:37:54,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2418 transitions.
[2025-03-03 10:37:54,874 INFO  L78                 Accepts]: Start accepts. Automaton has 1506 states and 2418 transitions. Word has length 24
[2025-03-03 10:37:54,875 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:37:54,875 INFO  L471      AbstractCegarLoop]: Abstraction has 1506 states and 2418 transitions.
[2025-03-03 10:37:54,875 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-03 10:37:54,875 INFO  L276                IsEmpty]: Start isEmpty. Operand 1506 states and 2418 transitions.
[2025-03-03 10:37:54,877 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2025-03-03 10:37:54,877 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:37:54,877 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:37:54,877 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 10:37:54,878 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:37:54,878 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:37:54,878 INFO  L85        PathProgramCache]: Analyzing trace with hash -127634211, now seen corresponding path program 1 times
[2025-03-03 10:37:54,878 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:37:54,878 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287517719]
[2025-03-03 10:37:54,878 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:37:54,878 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:37:54,902 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes.
[2025-03-03 10:37:54,934 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements.
[2025-03-03 10:37:54,934 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:37:54,934 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:37:55,129 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:37:55,129 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:37:55,129 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287517719]
[2025-03-03 10:37:55,129 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287517719] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:37:55,130 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:37:55,130 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:37:55,130 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702354830]
[2025-03-03 10:37:55,130 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:37:55,131 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:37:55,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:37:55,132 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:37:55,132 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:37:55,132 INFO  L87              Difference]: Start difference. First operand 1506 states and 2418 transitions. Second operand  has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-03 10:37:57,704 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:37:57,704 INFO  L93              Difference]: Finished difference Result 4514 states and 7250 transitions.
[2025-03-03 10:37:57,705 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:37:57,705 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99
[2025-03-03 10:37:57,705 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:37:57,714 INFO  L225             Difference]: With dead ends: 4514
[2025-03-03 10:37:57,714 INFO  L226             Difference]: Without dead ends: 3010
[2025-03-03 10:37:57,716 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-03 10:37:57,716 INFO  L435           NwaCegarLoop]: 576 mSDtfsCounter, 916 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-03-03 10:37:57,716 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 583 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2380 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-03-03 10:37:57,719 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3010 states.
[2025-03-03 10:37:57,754 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3008.
[2025-03-03 10:37:57,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3008 states, 3007 states have (on average 1.4595942800133024) internal successors, (4389), 3007 states have internal predecessors, (4389), 0 states have call successors, (0), 0 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-03 10:37:57,763 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4389 transitions.
[2025-03-03 10:37:57,764 INFO  L78                 Accepts]: Start accepts. Automaton has 3008 states and 4389 transitions. Word has length 99
[2025-03-03 10:37:57,764 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:37:57,764 INFO  L471      AbstractCegarLoop]: Abstraction has 3008 states and 4389 transitions.
[2025-03-03 10:37:57,765 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-03 10:37:57,765 INFO  L276                IsEmpty]: Start isEmpty. Operand 3008 states and 4389 transitions.
[2025-03-03 10:37:57,768 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 129
[2025-03-03 10:37:57,768 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:37:57,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:37:57,769 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 10:37:57,769 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:37:57,769 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:37:57,769 INFO  L85        PathProgramCache]: Analyzing trace with hash -1389511905, now seen corresponding path program 1 times
[2025-03-03 10:37:57,769 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:37:57,769 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303094420]
[2025-03-03 10:37:57,769 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:37:57,773 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:37:57,788 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes.
[2025-03-03 10:37:57,803 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements.
[2025-03-03 10:37:57,803 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:37:57,803 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:37:57,948 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:37:57,949 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:37:57,949 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303094420]
[2025-03-03 10:37:57,949 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303094420] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:37:57,949 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:37:57,949 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 10:37:57,949 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288188464]
[2025-03-03 10:37:57,949 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:37:57,950 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:37:57,950 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:37:57,950 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:37:57,950 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:37:57,950 INFO  L87              Difference]: Start difference. First operand 3008 states and 4389 transitions. Second operand  has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 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-03 10:38:00,026 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:38:00,026 INFO  L93              Difference]: Finished difference Result 9018 states and 13162 transitions.
[2025-03-03 10:38:00,027 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:38:00,027 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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 128
[2025-03-03 10:38:00,027 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:38:00,042 INFO  L225             Difference]: With dead ends: 9018
[2025-03-03 10:38:00,042 INFO  L226             Difference]: Without dead ends: 6012
[2025-03-03 10:38:00,046 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-03 10:38:00,046 INFO  L435           NwaCegarLoop]: 441 mSDtfsCounter, 745 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-03 10:38:00,047 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 447 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-03 10:38:00,051 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6012 states.
[2025-03-03 10:38:00,107 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 6012.
[2025-03-03 10:38:00,114 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6012 states, 6011 states have (on average 1.2951256030610547) internal successors, (7785), 6011 states have internal predecessors, (7785), 0 states have call successors, (0), 0 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-03 10:38:00,123 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 7785 transitions.
[2025-03-03 10:38:00,124 INFO  L78                 Accepts]: Start accepts. Automaton has 6012 states and 7785 transitions. Word has length 128
[2025-03-03 10:38:00,125 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:38:00,125 INFO  L471      AbstractCegarLoop]: Abstraction has 6012 states and 7785 transitions.
[2025-03-03 10:38:00,125 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 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-03 10:38:00,125 INFO  L276                IsEmpty]: Start isEmpty. Operand 6012 states and 7785 transitions.
[2025-03-03 10:38:00,129 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2025-03-03 10:38:00,129 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:38:00,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:38:00,130 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 10:38:00,130 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:38:00,130 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:38:00,131 INFO  L85        PathProgramCache]: Analyzing trace with hash 564378616, now seen corresponding path program 1 times
[2025-03-03 10:38:00,131 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:38:00,131 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997860528]
[2025-03-03 10:38:00,131 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:38:00,131 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:38:00,150 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes.
[2025-03-03 10:38:00,165 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements.
[2025-03-03 10:38:00,166 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:38:00,166 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:38:00,273 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:38:00,273 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:38:00,273 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997860528]
[2025-03-03 10:38:00,273 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997860528] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:38:00,273 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:38:00,273 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:38:00,273 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702824604]
[2025-03-03 10:38:00,273 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:38:00,274 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:38:00,274 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:38:00,274 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:38:00,274 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:38:00,274 INFO  L87              Difference]: Start difference. First operand 6012 states and 7785 transitions. Second operand  has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 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-03 10:38:02,689 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:38:02,689 INFO  L93              Difference]: Finished difference Result 18030 states and 23350 transitions.
[2025-03-03 10:38:02,690 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:38:02,690 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 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-03 10:38:02,691 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:38:02,716 INFO  L225             Difference]: With dead ends: 18030
[2025-03-03 10:38:02,716 INFO  L226             Difference]: Without dead ends: 12020
[2025-03-03 10:38:02,721 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-03 10:38:02,723 INFO  L435           NwaCegarLoop]: 1433 mSDtfsCounter, 730 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2844 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 3220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 2844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-03-03 10:38:02,725 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1441 Invalid, 3220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 2844 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-03-03 10:38:02,735 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12020 states.
[2025-03-03 10:38:02,829 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12020 to 11269.
[2025-03-03 10:38:02,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11269 states, 11268 states have (on average 1.2676606318778842) internal successors, (14284), 11268 states have internal predecessors, (14284), 0 states have call successors, (0), 0 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-03 10:38:02,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 14284 transitions.
[2025-03-03 10:38:02,863 INFO  L78                 Accepts]: Start accepts. Automaton has 11269 states and 14284 transitions. Word has length 165
[2025-03-03 10:38:02,864 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:38:02,864 INFO  L471      AbstractCegarLoop]: Abstraction has 11269 states and 14284 transitions.
[2025-03-03 10:38:02,864 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 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-03 10:38:02,864 INFO  L276                IsEmpty]: Start isEmpty. Operand 11269 states and 14284 transitions.
[2025-03-03 10:38:02,866 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2025-03-03 10:38:02,866 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:38:02,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:38:02,866 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 10:38:02,866 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:38:02,867 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:38:02,867 INFO  L85        PathProgramCache]: Analyzing trace with hash -1574725317, now seen corresponding path program 1 times
[2025-03-03 10:38:02,867 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:38:02,867 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846286061]
[2025-03-03 10:38:02,867 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:38:02,867 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:38:02,882 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes.
[2025-03-03 10:38:02,898 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements.
[2025-03-03 10:38:02,898 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:38:02,899 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:38:03,340 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:38:03,340 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:38:03,340 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846286061]
[2025-03-03 10:38:03,340 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846286061] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:38:03,340 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:38:03,340 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-03 10:38:03,340 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856972460]
[2025-03-03 10:38:03,340 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:38:03,340 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-03 10:38:03,340 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:38:03,341 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-03 10:38:03,341 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:38:03,341 INFO  L87              Difference]: Start difference. First operand 11269 states and 14284 transitions. Second operand  has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-03 10:38:06,946 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:38:06,946 INFO  L93              Difference]: Finished difference Result 29295 states and 36129 transitions.
[2025-03-03 10:38:06,947 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-03 10:38:06,947 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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 168
[2025-03-03 10:38:06,947 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:38:06,976 INFO  L225             Difference]: With dead ends: 29295
[2025-03-03 10:38:06,976 INFO  L226             Difference]: Without dead ends: 18028
[2025-03-03 10:38:06,983 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-03-03 10:38:06,983 INFO  L435           NwaCegarLoop]: 694 mSDtfsCounter, 3431 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5369 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3431 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 5528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 5369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time
[2025-03-03 10:38:06,983 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3431 Valid, 720 Invalid, 5528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 5369 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time]
[2025-03-03 10:38:06,995 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18028 states.
[2025-03-03 10:38:07,122 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18028 to 16526.
[2025-03-03 10:38:07,151 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16526 states, 16525 states have (on average 1.2050226928895613) internal successors, (19913), 16525 states have internal predecessors, (19913), 0 states have call successors, (0), 0 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-03 10:38:07,171 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16526 states to 16526 states and 19913 transitions.
[2025-03-03 10:38:07,171 INFO  L78                 Accepts]: Start accepts. Automaton has 16526 states and 19913 transitions. Word has length 168
[2025-03-03 10:38:07,172 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:38:07,172 INFO  L471      AbstractCegarLoop]: Abstraction has 16526 states and 19913 transitions.
[2025-03-03 10:38:07,172 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-03 10:38:07,172 INFO  L276                IsEmpty]: Start isEmpty. Operand 16526 states and 19913 transitions.
[2025-03-03 10:38:07,173 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2025-03-03 10:38:07,173 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:38:07,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:38:07,174 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 10:38:07,174 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:38:07,174 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:38:07,174 INFO  L85        PathProgramCache]: Analyzing trace with hash 419618670, now seen corresponding path program 1 times
[2025-03-03 10:38:07,174 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:38:07,174 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711799878]
[2025-03-03 10:38:07,175 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:38:07,175 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:38:07,193 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes.
[2025-03-03 10:38:07,207 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements.
[2025-03-03 10:38:07,207 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:38:07,208 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:38:07,444 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:38:07,445 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:38:07,445 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711799878]
[2025-03-03 10:38:07,446 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711799878] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:38:07,446 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571628319]
[2025-03-03 10:38:07,446 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:38:07,448 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:38:07,448 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:38:07,451 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-03 10:38:07,455 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-03 10:38:07,494 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes.
[2025-03-03 10:38:07,523 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements.
[2025-03-03 10:38:07,524 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:38:07,524 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:38:07,526 INFO  L256         TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 10:38:07,531 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:38:07,720 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-03-03 10:38:07,720 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:38:07,721 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [571628319] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:38:07,721 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:38:07,721 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-03-03 10:38:07,721 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581174166]
[2025-03-03 10:38:07,721 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:38:07,721 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:38:07,721 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:38:07,722 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:38:07,722 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:38:07,722 INFO  L87              Difference]: Start difference. First operand 16526 states and 19913 transitions. Second operand  has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:38:10,008 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:38:10,009 INFO  L93              Difference]: Finished difference Result 48821 states and 58809 transitions.
[2025-03-03 10:38:10,009 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:38:10,009 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169
[2025-03-03 10:38:10,009 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:38:10,062 INFO  L225             Difference]: With dead ends: 48821
[2025-03-03 10:38:10,062 INFO  L226             Difference]: Without dead ends: 32297
[2025-03-03 10:38:10,079 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 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-03 10:38:10,079 INFO  L435           NwaCegarLoop]: 660 mSDtfsCounter, 619 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2458 mSolverCounterSat, 585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 3043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 2458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-03 10:38:10,080 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 667 Invalid, 3043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 2458 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-03 10:38:10,109 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32297 states.
[2025-03-03 10:38:10,328 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32297 to 28542.
[2025-03-03 10:38:10,365 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28542 states, 28541 states have (on average 1.1666374689043832) internal successors, (33297), 28541 states have internal predecessors, (33297), 0 states have call successors, (0), 0 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-03 10:38:10,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28542 states to 28542 states and 33297 transitions.
[2025-03-03 10:38:10,402 INFO  L78                 Accepts]: Start accepts. Automaton has 28542 states and 33297 transitions. Word has length 169
[2025-03-03 10:38:10,403 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:38:10,403 INFO  L471      AbstractCegarLoop]: Abstraction has 28542 states and 33297 transitions.
[2025-03-03 10:38:10,403 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:38:10,403 INFO  L276                IsEmpty]: Start isEmpty. Operand 28542 states and 33297 transitions.
[2025-03-03 10:38:10,405 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 237
[2025-03-03 10:38:10,405 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:38:10,405 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 10:38:10,413 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-03 10:38:10,606 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2025-03-03 10:38:10,607 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:38:10,607 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:38:10,607 INFO  L85        PathProgramCache]: Analyzing trace with hash -1914030542, now seen corresponding path program 1 times
[2025-03-03 10:38:10,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:38:10,607 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341344682]
[2025-03-03 10:38:10,607 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:38:10,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:38:10,626 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes.
[2025-03-03 10:38:10,639 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements.
[2025-03-03 10:38:10,639 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:38:10,639 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:38:10,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 113 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked.
[2025-03-03 10:38:10,708 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:38:10,708 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341344682]
[2025-03-03 10:38:10,708 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341344682] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:38:10,708 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:38:10,708 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:38:10,708 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540593666]
[2025-03-03 10:38:10,708 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:38:10,708 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:38:10,709 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:38:10,709 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:38:10,709 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:38:10,709 INFO  L87              Difference]: Start difference. First operand 28542 states and 33297 transitions. Second operand  has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-03 10:38:13,267 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:38:13,268 INFO  L93              Difference]: Finished difference Result 66845 states and 79335 transitions.
[2025-03-03 10:38:13,268 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:38:13,268 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 236
[2025-03-03 10:38:13,268 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:38:13,322 INFO  L225             Difference]: With dead ends: 66845
[2025-03-03 10:38:13,323 INFO  L226             Difference]: Without dead ends: 38305
[2025-03-03 10:38:13,342 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-03 10:38:13,343 INFO  L435           NwaCegarLoop]: 683 mSDtfsCounter, 731 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 2990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-03-03 10:38:13,343 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 690 Invalid, 2990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-03-03 10:38:13,367 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 38305 states.
[2025-03-03 10:38:13,604 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 38305 to 28542.
[2025-03-03 10:38:13,627 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28542 states, 28541 states have (on average 1.1666374689043832) internal successors, (33297), 28541 states have internal predecessors, (33297), 0 states have call successors, (0), 0 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-03 10:38:13,653 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28542 states to 28542 states and 33297 transitions.
[2025-03-03 10:38:13,654 INFO  L78                 Accepts]: Start accepts. Automaton has 28542 states and 33297 transitions. Word has length 236
[2025-03-03 10:38:13,654 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:38:13,654 INFO  L471      AbstractCegarLoop]: Abstraction has 28542 states and 33297 transitions.
[2025-03-03 10:38:13,655 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-03 10:38:13,655 INFO  L276                IsEmpty]: Start isEmpty. Operand 28542 states and 33297 transitions.
[2025-03-03 10:38:13,658 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 240
[2025-03-03 10:38:13,658 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:38:13,658 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:38:13,658 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 10:38:13,658 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:38:13,659 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:38:13,659 INFO  L85        PathProgramCache]: Analyzing trace with hash -376129473, now seen corresponding path program 1 times
[2025-03-03 10:38:13,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:38:13,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022874193]
[2025-03-03 10:38:13,659 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:38:13,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:38:13,675 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes.
[2025-03-03 10:38:13,685 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements.
[2025-03-03 10:38:13,685 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:38:13,685 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:38:13,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:38:13,968 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:38:13,968 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022874193]
[2025-03-03 10:38:13,968 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022874193] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:38:13,968 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:38:13,968 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:38:13,968 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107454024]
[2025-03-03 10:38:13,968 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:38:13,968 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:38:13,968 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:38:13,969 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:38:13,969 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:38:13,969 INFO  L87              Difference]: Start difference. First operand 28542 states and 33297 transitions. Second operand  has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 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-03 10:38:16,251 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:38:16,252 INFO  L93              Difference]: Finished difference Result 63878 states and 73850 transitions.
[2025-03-03 10:38:16,252 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:38:16,252 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 239
[2025-03-03 10:38:16,252 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:38:16,291 INFO  L225             Difference]: With dead ends: 63878
[2025-03-03 10:38:16,291 INFO  L226             Difference]: Without dead ends: 35301
[2025-03-03 10:38:16,308 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-03 10:38:16,309 INFO  L435           NwaCegarLoop]: 694 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-03 10:38:16,309 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 708 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-03 10:38:16,332 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 35301 states.
[2025-03-03 10:38:16,542 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 35301 to 35301.
[2025-03-03 10:38:16,680 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 35301 states, 35300 states have (on average 1.1373654390934844) internal successors, (40149), 35300 states have internal predecessors, (40149), 0 states have call successors, (0), 0 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-03 10:38:16,713 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35301 states to 35301 states and 40149 transitions.
[2025-03-03 10:38:16,713 INFO  L78                 Accepts]: Start accepts. Automaton has 35301 states and 40149 transitions. Word has length 239
[2025-03-03 10:38:16,715 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:38:16,715 INFO  L471      AbstractCegarLoop]: Abstraction has 35301 states and 40149 transitions.
[2025-03-03 10:38:16,715 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 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-03 10:38:16,715 INFO  L276                IsEmpty]: Start isEmpty. Operand 35301 states and 40149 transitions.
[2025-03-03 10:38:16,717 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-03-03 10:38:16,717 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:38:16,717 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 10:38:16,718 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-03 10:38:16,718 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:38:16,718 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:38:16,718 INFO  L85        PathProgramCache]: Analyzing trace with hash -328955047, now seen corresponding path program 1 times
[2025-03-03 10:38:16,718 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:38:16,718 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268467663]
[2025-03-03 10:38:16,718 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:38:16,719 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:38:16,736 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-03-03 10:38:16,746 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-03-03 10:38:16,747 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:38:16,747 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:38:16,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 127 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-03-03 10:38:16,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:38:16,864 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268467663]
[2025-03-03 10:38:16,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268467663] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:38:16,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:38:16,864 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:38:16,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823913454]
[2025-03-03 10:38:16,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:38:16,866 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:38:16,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:38:16,866 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:38:16,866 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:38:16,866 INFO  L87              Difference]: Start difference. First operand 35301 states and 40149 transitions. Second operand  has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 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-03 10:38:19,220 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:38:19,220 INFO  L93              Difference]: Finished difference Result 88624 states and 101870 transitions.
[2025-03-03 10:38:19,221 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:38:19,221 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 254
[2025-03-03 10:38:19,221 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:38:19,278 INFO  L225             Difference]: With dead ends: 88624
[2025-03-03 10:38:19,278 INFO  L226             Difference]: Without dead ends: 53325
[2025-03-03 10:38:19,297 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-03 10:38:19,297 INFO  L435           NwaCegarLoop]: 1208 mSDtfsCounter, 751 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 2781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-03 10:38:19,298 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1216 Invalid, 2781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-03 10:38:19,331 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 53325 states.
[2025-03-03 10:38:19,718 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 53325 to 53325.
[2025-03-03 10:38:19,757 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 53325 states, 53324 states have (on average 1.1119195859275373) internal successors, (59292), 53324 states have internal predecessors, (59292), 0 states have call successors, (0), 0 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-03 10:38:19,824 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53325 states to 53325 states and 59292 transitions.
[2025-03-03 10:38:19,824 INFO  L78                 Accepts]: Start accepts. Automaton has 53325 states and 59292 transitions. Word has length 254
[2025-03-03 10:38:19,825 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:38:19,825 INFO  L471      AbstractCegarLoop]: Abstraction has 53325 states and 59292 transitions.
[2025-03-03 10:38:19,825 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 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-03 10:38:19,825 INFO  L276                IsEmpty]: Start isEmpty. Operand 53325 states and 59292 transitions.
[2025-03-03 10:38:19,829 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 310
[2025-03-03 10:38:19,829 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:38:19,829 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-03 10:38:19,829 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-03 10:38:19,829 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:38:19,830 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:38:19,830 INFO  L85        PathProgramCache]: Analyzing trace with hash 167495888, now seen corresponding path program 1 times
[2025-03-03 10:38:19,830 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:38:19,830 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297323242]
[2025-03-03 10:38:19,830 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:38:19,830 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:38:19,858 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes.
[2025-03-03 10:38:19,877 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements.
[2025-03-03 10:38:19,877 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:38:19,877 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:38:20,207 INFO  L134       CoverageAnalysis]: Checked inductivity of 183 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked.
[2025-03-03 10:38:20,207 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:38:20,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297323242]
[2025-03-03 10:38:20,207 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297323242] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:38:20,207 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:38:20,207 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:38:20,207 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042686348]
[2025-03-03 10:38:20,207 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:38:20,208 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:38:20,208 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:38:20,208 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:38:20,208 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:38:20,208 INFO  L87              Difference]: Start difference. First operand 53325 states and 59292 transitions. Second operand  has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 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-03 10:38:22,420 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:38:22,420 INFO  L93              Difference]: Finished difference Result 118664 states and 131536 transitions.
[2025-03-03 10:38:22,421 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:38:22,421 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 309
[2025-03-03 10:38:22,421 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:38:22,491 INFO  L225             Difference]: With dead ends: 118664
[2025-03-03 10:38:22,491 INFO  L226             Difference]: Without dead ends: 63839
[2025-03-03 10:38:22,514 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:38:22,514 INFO  L435           NwaCegarLoop]: 898 mSDtfsCounter, 847 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2137 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-03-03 10:38:22,515 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 906 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2137 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-03-03 10:38:22,551 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 63839 states.
[2025-03-03 10:38:22,922 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 63839 to 60835.
[2025-03-03 10:38:22,965 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60835 states, 60834 states have (on average 1.0937469178419963) internal successors, (66537), 60834 states have internal predecessors, (66537), 0 states have call successors, (0), 0 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-03 10:38:23,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60835 states to 60835 states and 66537 transitions.
[2025-03-03 10:38:23,020 INFO  L78                 Accepts]: Start accepts. Automaton has 60835 states and 66537 transitions. Word has length 309
[2025-03-03 10:38:23,021 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:38:23,021 INFO  L471      AbstractCegarLoop]: Abstraction has 60835 states and 66537 transitions.
[2025-03-03 10:38:23,021 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 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-03 10:38:23,021 INFO  L276                IsEmpty]: Start isEmpty. Operand 60835 states and 66537 transitions.
[2025-03-03 10:38:23,026 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 439
[2025-03-03 10:38:23,026 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:38:23,026 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:38:23,026 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 10:38:23,026 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:38:23,027 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:38:23,027 INFO  L85        PathProgramCache]: Analyzing trace with hash 1751344601, now seen corresponding path program 1 times
[2025-03-03 10:38:23,027 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:38:23,027 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196325364]
[2025-03-03 10:38:23,027 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:38:23,027 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:38:23,054 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes.
[2025-03-03 10:38:23,077 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements.
[2025-03-03 10:38:23,077 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:38:23,077 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:38:23,383 INFO  L134       CoverageAnalysis]: Checked inductivity of 362 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-03-03 10:38:23,383 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:38:23,383 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196325364]
[2025-03-03 10:38:23,383 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196325364] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:38:23,383 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:38:23,383 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:38:23,383 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242410090]
[2025-03-03 10:38:23,383 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:38:23,384 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:38:23,385 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:38:23,386 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:38:23,386 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:38:23,386 INFO  L87              Difference]: Start difference. First operand 60835 states and 66537 transitions. Second operand  has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 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-03 10:38:25,700 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:38:25,700 INFO  L93              Difference]: Finished difference Result 141196 states and 156148 transitions.
[2025-03-03 10:38:25,701 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:38:25,701 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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 438
[2025-03-03 10:38:25,701 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:38:25,786 INFO  L225             Difference]: With dead ends: 141196
[2025-03-03 10:38:25,786 INFO  L226             Difference]: Without dead ends: 80363
[2025-03-03 10:38:25,829 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-03 10:38:25,830 INFO  L435           NwaCegarLoop]: 592 mSDtfsCounter, 714 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 578 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 2929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 578 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-03 10:38:25,830 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 599 Invalid, 2929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [578 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-03 10:38:25,884 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80363 states.
[2025-03-03 10:38:26,466 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80363 to 79610.
[2025-03-03 10:38:26,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 79610 states, 79609 states have (on average 1.0990214674220251) internal successors, (87492), 79609 states have internal predecessors, (87492), 0 states have call successors, (0), 0 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-03 10:38:26,598 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79610 states to 79610 states and 87492 transitions.
[2025-03-03 10:38:26,598 INFO  L78                 Accepts]: Start accepts. Automaton has 79610 states and 87492 transitions. Word has length 438
[2025-03-03 10:38:26,599 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:38:26,599 INFO  L471      AbstractCegarLoop]: Abstraction has 79610 states and 87492 transitions.
[2025-03-03 10:38:26,599 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 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-03 10:38:26,599 INFO  L276                IsEmpty]: Start isEmpty. Operand 79610 states and 87492 transitions.
[2025-03-03 10:38:26,605 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 443
[2025-03-03 10:38:26,605 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:38:26,605 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:38:26,605 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 10:38:26,605 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:38:26,606 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:38:26,606 INFO  L85        PathProgramCache]: Analyzing trace with hash 1603247395, now seen corresponding path program 1 times
[2025-03-03 10:38:26,606 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:38:26,606 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246639138]
[2025-03-03 10:38:26,606 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:38:26,606 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:38:26,629 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes.
[2025-03-03 10:38:26,644 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements.
[2025-03-03 10:38:26,644 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:38:26,644 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:38:27,241 INFO  L134       CoverageAnalysis]: Checked inductivity of 366 backedges. 322 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 10:38:27,241 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:38:27,241 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246639138]
[2025-03-03 10:38:27,241 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246639138] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:38:27,241 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130496000]
[2025-03-03 10:38:27,242 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:38:27,242 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:38:27,242 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:38:27,244 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-03 10:38:27,245 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-03 10:38:27,306 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes.
[2025-03-03 10:38:27,378 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements.
[2025-03-03 10:38:27,379 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:38:27,379 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:38:27,381 INFO  L256         TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 10:38:27,387 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:38:27,473 INFO  L134       CoverageAnalysis]: Checked inductivity of 366 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-03-03 10:38:27,473 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:38:27,473 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [130496000] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:38:27,473 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:38:27,473 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7
[2025-03-03 10:38:27,473 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123221470]
[2025-03-03 10:38:27,473 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:38:27,474 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:38:27,474 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:38:27,474 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:38:27,474 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-03 10:38:27,475 INFO  L87              Difference]: Start difference. First operand 79610 states and 87492 transitions. Second operand  has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 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-03 10:38:30,124 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:38:30,124 INFO  L93              Difference]: Finished difference Result 187005 states and 206866 transitions.
[2025-03-03 10:38:30,124 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:38:30,125 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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 442
[2025-03-03 10:38:30,125 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:38:30,244 INFO  L225             Difference]: With dead ends: 187005
[2025-03-03 10:38:30,244 INFO  L226             Difference]: Without dead ends: 107397
[2025-03-03 10:38:30,283 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-03 10:38:30,283 INFO  L435           NwaCegarLoop]: 1275 mSDtfsCounter, 689 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2465 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 2465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-03-03 10:38:30,284 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1282 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 2465 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-03-03 10:38:30,349 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 107397 states.
[2025-03-03 10:38:31,078 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 107397 to 105144.
[2025-03-03 10:38:31,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 105144 states, 105143 states have (on average 1.1023082849072217) internal successors, (115900), 105143 states have internal predecessors, (115900), 0 states have call successors, (0), 0 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-03 10:38:31,295 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 105144 states to 105144 states and 115900 transitions.
[2025-03-03 10:38:31,296 INFO  L78                 Accepts]: Start accepts. Automaton has 105144 states and 115900 transitions. Word has length 442
[2025-03-03 10:38:31,296 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:38:31,296 INFO  L471      AbstractCegarLoop]: Abstraction has 105144 states and 115900 transitions.
[2025-03-03 10:38:31,297 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 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-03 10:38:31,297 INFO  L276                IsEmpty]: Start isEmpty. Operand 105144 states and 115900 transitions.
[2025-03-03 10:38:31,305 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 449
[2025-03-03 10:38:31,305 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:38:31,305 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:38:31,311 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-03 10:38:31,506 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,SelfDestructingSolverStorable11
[2025-03-03 10:38:31,506 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:38:31,506 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:38:31,506 INFO  L85        PathProgramCache]: Analyzing trace with hash -952146860, now seen corresponding path program 1 times
[2025-03-03 10:38:31,507 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:38:31,507 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015377347]
[2025-03-03 10:38:31,507 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:38:31,507 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:38:31,543 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes.
[2025-03-03 10:38:31,573 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements.
[2025-03-03 10:38:31,573 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:38:31,573 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:38:31,974 INFO  L134       CoverageAnalysis]: Checked inductivity of 378 backedges. 106 proven. 229 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked.
[2025-03-03 10:38:31,974 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:38:31,975 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015377347]
[2025-03-03 10:38:31,975 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015377347] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 10:38:31,975 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526495471]
[2025-03-03 10:38:31,975 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:38:31,975 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:38:31,975 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 10:38:31,977 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-03 10:38:31,979 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-03 10:38:32,039 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes.
[2025-03-03 10:38:32,103 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements.
[2025-03-03 10:38:32,103 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:38:32,103 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:38:32,104 INFO  L256         TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 10:38:32,109 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 10:38:32,280 INFO  L134       CoverageAnalysis]: Checked inductivity of 378 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-03-03 10:38:32,280 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 10:38:32,281 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [526495471] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:38:32,281 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 10:38:32,281 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-03-03 10:38:32,281 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637101683]
[2025-03-03 10:38:32,281 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:38:32,281 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:38:32,281 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:38:32,282 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:38:32,282 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-03 10:38:32,282 INFO  L87              Difference]: Start difference. First operand 105144 states and 115900 transitions. Second operand  has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 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-03 10:38:35,084 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:38:35,084 INFO  L93              Difference]: Finished difference Result 227559 states and 253116 transitions.
[2025-03-03 10:38:35,084 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:38:35,085 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 448
[2025-03-03 10:38:35,085 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:38:35,220 INFO  L225             Difference]: With dead ends: 227559
[2025-03-03 10:38:35,220 INFO  L226             Difference]: Without dead ends: 122417
[2025-03-03 10:38:35,264 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 448 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-03 10:38:35,264 INFO  L435           NwaCegarLoop]: 997 mSDtfsCounter, 619 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 722 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 3034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 722 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-03 10:38:35,265 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 1004 Invalid, 3034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [722 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-03 10:38:35,344 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 122417 states.
[2025-03-03 10:38:36,454 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 122417 to 122417.
[2025-03-03 10:38:36,508 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 122417 states, 122416 states have (on average 1.110426741602405) internal successors, (135934), 122416 states have internal predecessors, (135934), 0 states have call successors, (0), 0 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-03 10:38:36,764 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 122417 states to 122417 states and 135934 transitions.
[2025-03-03 10:38:36,765 INFO  L78                 Accepts]: Start accepts. Automaton has 122417 states and 135934 transitions. Word has length 448
[2025-03-03 10:38:36,765 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:38:36,766 INFO  L471      AbstractCegarLoop]: Abstraction has 122417 states and 135934 transitions.
[2025-03-03 10:38:36,766 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 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-03 10:38:36,766 INFO  L276                IsEmpty]: Start isEmpty. Operand 122417 states and 135934 transitions.
[2025-03-03 10:38:36,776 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 496
[2025-03-03 10:38:36,776 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:38:36,776 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:38:36,783 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-03 10:38:36,977 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 10:38:36,977 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:38:36,978 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:38:36,978 INFO  L85        PathProgramCache]: Analyzing trace with hash 1757771935, now seen corresponding path program 1 times
[2025-03-03 10:38:36,978 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:38:36,978 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984164605]
[2025-03-03 10:38:36,978 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:38:36,978 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:38:37,020 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes.
[2025-03-03 10:38:37,045 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements.
[2025-03-03 10:38:37,045 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:38:37,046 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:38:37,244 INFO  L134       CoverageAnalysis]: Checked inductivity of 489 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked.
[2025-03-03 10:38:37,245 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:38:37,245 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984164605]
[2025-03-03 10:38:37,245 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984164605] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:38:37,245 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:38:37,245 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:38:37,245 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192452525]
[2025-03-03 10:38:37,245 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:38:37,246 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:38:37,246 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:38:37,246 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:38:37,246 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:38:37,247 INFO  L87              Difference]: Start difference. First operand 122417 states and 135934 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-03 10:38:39,828 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:38:39,828 INFO  L93              Difference]: Finished difference Result 283884 states and 316907 transitions.
[2025-03-03 10:38:39,828 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:38:39,829 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 495
[2025-03-03 10:38:39,829 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:38:40,021 INFO  L225             Difference]: With dead ends: 283884
[2025-03-03 10:38:40,021 INFO  L226             Difference]: Without dead ends: 161469
[2025-03-03 10:38:40,108 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-03 10:38:40,109 INFO  L435           NwaCegarLoop]: 1245 mSDtfsCounter, 637 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2132 mSolverCounterSat, 706 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 2838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 706 IncrementalHoareTripleChecker+Valid, 2132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-03-03 10:38:40,109 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1252 Invalid, 2838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [706 Valid, 2132 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-03-03 10:38:40,237 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 161469 states.
[2025-03-03 10:38:41,744 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 161469 to 152457.
[2025-03-03 10:38:41,811 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 152457 states, 152456 states have (on average 1.098474313900404) internal successors, (167469), 152456 states have internal predecessors, (167469), 0 states have call successors, (0), 0 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-03 10:38:41,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 152457 states to 152457 states and 167469 transitions.
[2025-03-03 10:38:41,956 INFO  L78                 Accepts]: Start accepts. Automaton has 152457 states and 167469 transitions. Word has length 495
[2025-03-03 10:38:41,956 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:38:41,956 INFO  L471      AbstractCegarLoop]: Abstraction has 152457 states and 167469 transitions.
[2025-03-03 10:38:41,956 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-03 10:38:41,957 INFO  L276                IsEmpty]: Start isEmpty. Operand 152457 states and 167469 transitions.
[2025-03-03 10:38:41,966 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 529
[2025-03-03 10:38:41,966 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:38:41,967 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:38:41,967 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 10:38:41,967 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:38:41,967 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:38:41,967 INFO  L85        PathProgramCache]: Analyzing trace with hash -1572919494, now seen corresponding path program 1 times
[2025-03-03 10:38:41,967 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:38:41,967 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661686382]
[2025-03-03 10:38:41,967 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:38:41,968 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:38:41,992 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes.
[2025-03-03 10:38:42,163 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements.
[2025-03-03 10:38:42,164 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:38:42,164 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:38:42,363 INFO  L134       CoverageAnalysis]: Checked inductivity of 661 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked.
[2025-03-03 10:38:42,363 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:38:42,363 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661686382]
[2025-03-03 10:38:42,363 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661686382] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:38:42,363 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:38:42,363 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:38:42,363 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396518761]
[2025-03-03 10:38:42,363 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:38:42,364 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:38:42,364 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:38:42,365 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:38:42,365 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:38:42,365 INFO  L87              Difference]: Start difference. First operand 152457 states and 167469 transitions. Second operand  has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 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-03 10:38:45,270 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:38:45,270 INFO  L93              Difference]: Finished difference Result 328944 states and 361935 transitions.
[2025-03-03 10:38:45,271 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:38:45,271 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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 528
[2025-03-03 10:38:45,271 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:38:45,460 INFO  L225             Difference]: With dead ends: 328944
[2025-03-03 10:38:45,460 INFO  L226             Difference]: Without dead ends: 176489
[2025-03-03 10:38:45,541 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:38:45,542 INFO  L435           NwaCegarLoop]: 454 mSDtfsCounter, 623 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 2935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-03-03 10:38:45,542 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 460 Invalid, 2935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-03-03 10:38:45,851 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 176489 states.
[2025-03-03 10:38:47,015 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 176489 to 152457.
[2025-03-03 10:38:47,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 152457 states, 152456 states have (on average 1.098474313900404) internal successors, (167469), 152456 states have internal predecessors, (167469), 0 states have call successors, (0), 0 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-03 10:38:47,231 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 152457 states to 152457 states and 167469 transitions.
[2025-03-03 10:38:47,232 INFO  L78                 Accepts]: Start accepts. Automaton has 152457 states and 167469 transitions. Word has length 528
[2025-03-03 10:38:47,232 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:38:47,232 INFO  L471      AbstractCegarLoop]: Abstraction has 152457 states and 167469 transitions.
[2025-03-03 10:38:47,232 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 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-03 10:38:47,233 INFO  L276                IsEmpty]: Start isEmpty. Operand 152457 states and 167469 transitions.
[2025-03-03 10:38:47,244 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 541
[2025-03-03 10:38:47,244 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:38:47,244 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:38:47,245 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-03 10:38:47,245 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:38:47,245 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:38:47,245 INFO  L85        PathProgramCache]: Analyzing trace with hash 604077614, now seen corresponding path program 1 times
[2025-03-03 10:38:47,245 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:38:47,245 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183010589]
[2025-03-03 10:38:47,245 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:38:47,245 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:38:47,270 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes.
[2025-03-03 10:38:47,287 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements.
[2025-03-03 10:38:47,287 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:38:47,287 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:38:47,699 INFO  L134       CoverageAnalysis]: Checked inductivity of 677 backedges. 491 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked.
[2025-03-03 10:38:47,699 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:38:47,699 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183010589]
[2025-03-03 10:38:47,699 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183010589] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:38:47,699 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:38:47,699 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:38:47,699 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138801027]
[2025-03-03 10:38:47,699 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:38:47,700 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:38:47,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:38:47,700 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:38:47,700 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:38:47,700 INFO  L87              Difference]: Start difference. First operand 152457 states and 167469 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-03 10:38:50,512 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:38:50,512 INFO  L93              Difference]: Finished difference Result 339458 states and 374192 transitions.
[2025-03-03 10:38:50,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:38:50,513 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 540
[2025-03-03 10:38:50,513 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:38:50,746 INFO  L225             Difference]: With dead ends: 339458
[2025-03-03 10:38:50,746 INFO  L226             Difference]: Without dead ends: 187003
[2025-03-03 10:38:50,818 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-03 10:38:50,818 INFO  L435           NwaCegarLoop]: 1288 mSDtfsCounter, 579 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-03 10:38:50,819 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1296 Invalid, 2763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-03 10:38:50,942 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 187003 states.
[2025-03-03 10:38:52,314 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 187003 to 180244.
[2025-03-03 10:38:52,437 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 180244 states, 180243 states have (on average 1.0931242822190044) internal successors, (197028), 180243 states have internal predecessors, (197028), 0 states have call successors, (0), 0 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-03 10:38:52,619 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 180244 states to 180244 states and 197028 transitions.
[2025-03-03 10:38:52,621 INFO  L78                 Accepts]: Start accepts. Automaton has 180244 states and 197028 transitions. Word has length 540
[2025-03-03 10:38:52,621 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:38:52,621 INFO  L471      AbstractCegarLoop]: Abstraction has 180244 states and 197028 transitions.
[2025-03-03 10:38:52,621 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-03 10:38:52,621 INFO  L276                IsEmpty]: Start isEmpty. Operand 180244 states and 197028 transitions.
[2025-03-03 10:38:52,633 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 587
[2025-03-03 10:38:52,633 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:38:52,633 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 10:38:52,634 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-03 10:38:52,634 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:38:52,634 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:38:52,634 INFO  L85        PathProgramCache]: Analyzing trace with hash 57424562, now seen corresponding path program 1 times
[2025-03-03 10:38:52,634 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:38:52,634 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129232523]
[2025-03-03 10:38:52,634 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:38:52,634 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:38:52,935 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes.
[2025-03-03 10:38:52,953 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements.
[2025-03-03 10:38:52,953 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:38:52,953 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:38:53,120 INFO  L134       CoverageAnalysis]: Checked inductivity of 972 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked.
[2025-03-03 10:38:53,120 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:38:53,120 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129232523]
[2025-03-03 10:38:53,120 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129232523] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:38:53,120 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:38:53,120 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:38:53,120 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385309083]
[2025-03-03 10:38:53,120 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:38:53,121 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:38:53,121 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:38:53,121 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:38:53,121 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:38:53,121 INFO  L87              Difference]: Start difference. First operand 180244 states and 197028 transitions. Second operand  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:38:56,043 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:38:56,043 INFO  L93              Difference]: Finished difference Result 362739 states and 396212 transitions.
[2025-03-03 10:38:56,044 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:38:56,044 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 586
[2025-03-03 10:38:56,044 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:38:56,254 INFO  L225             Difference]: With dead ends: 362739
[2025-03-03 10:38:56,254 INFO  L226             Difference]: Without dead ends: 176489
[2025-03-03 10:38:56,354 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-03 10:38:56,354 INFO  L435           NwaCegarLoop]: 1223 mSDtfsCounter, 748 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2173 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 2173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-03-03 10:38:56,354 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1231 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 2173 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-03-03 10:38:56,489 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 176489 states.
[2025-03-03 10:38:57,852 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 176489 to 157714.
[2025-03-03 10:38:57,958 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 157714 states, 157713 states have (on average 1.0614597401609251) internal successors, (167406), 157713 states have internal predecessors, (167406), 0 states have call successors, (0), 0 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-03 10:38:58,105 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 157714 states to 157714 states and 167406 transitions.
[2025-03-03 10:38:58,107 INFO  L78                 Accepts]: Start accepts. Automaton has 157714 states and 167406 transitions. Word has length 586
[2025-03-03 10:38:58,107 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:38:58,107 INFO  L471      AbstractCegarLoop]: Abstraction has 157714 states and 167406 transitions.
[2025-03-03 10:38:58,107 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 10:38:58,107 INFO  L276                IsEmpty]: Start isEmpty. Operand 157714 states and 167406 transitions.
[2025-03-03 10:38:58,118 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 602
[2025-03-03 10:38:58,118 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:38:58,118 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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]
[2025-03-03 10:38:58,118 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-03 10:38:58,118 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:38:58,119 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:38:58,119 INFO  L85        PathProgramCache]: Analyzing trace with hash 1656638207, now seen corresponding path program 1 times
[2025-03-03 10:38:58,119 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:38:58,119 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314710659]
[2025-03-03 10:38:58,119 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:38:58,119 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:38:58,146 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes.
[2025-03-03 10:38:58,162 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements.
[2025-03-03 10:38:58,162 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:38:58,162 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:38:58,599 INFO  L134       CoverageAnalysis]: Checked inductivity of 822 backedges. 684 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked.
[2025-03-03 10:38:58,599 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:38:58,599 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314710659]
[2025-03-03 10:38:58,600 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314710659] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:38:58,600 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:38:58,600 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:38:58,600 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907735867]
[2025-03-03 10:38:58,600 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:38:58,600 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 10:38:58,600 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:38:58,601 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 10:38:58,601 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 10:38:58,601 INFO  L87              Difference]: Start difference. First operand 157714 states and 167406 transitions. Second operand  has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 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-03 10:39:01,264 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:39:01,264 INFO  L93              Difference]: Finished difference Result 343213 states and 365482 transitions.
[2025-03-03 10:39:01,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 10:39:01,264 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 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 601
[2025-03-03 10:39:01,265 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:39:01,496 INFO  L225             Difference]: With dead ends: 343213
[2025-03-03 10:39:01,496 INFO  L226             Difference]: Without dead ends: 186252
[2025-03-03 10:39:01,565 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-03 10:39:01,565 INFO  L435           NwaCegarLoop]: 1274 mSDtfsCounter, 646 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2240 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 2240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-03-03 10:39:01,565 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 1282 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 2240 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-03-03 10:39:01,709 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 186252 states.
[2025-03-03 10:39:03,484 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 186252 to 179493.
[2025-03-03 10:39:03,576 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 179493 states, 179492 states have (on average 1.0526263008936332) internal successors, (188938), 179492 states have internal predecessors, (188938), 0 states have call successors, (0), 0 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-03 10:39:03,738 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 179493 states to 179493 states and 188938 transitions.
[2025-03-03 10:39:03,739 INFO  L78                 Accepts]: Start accepts. Automaton has 179493 states and 188938 transitions. Word has length 601
[2025-03-03 10:39:03,740 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 10:39:03,740 INFO  L471      AbstractCegarLoop]: Abstraction has 179493 states and 188938 transitions.
[2025-03-03 10:39:03,740 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 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-03 10:39:03,740 INFO  L276                IsEmpty]: Start isEmpty. Operand 179493 states and 188938 transitions.
[2025-03-03 10:39:03,748 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 603
[2025-03-03 10:39:03,748 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 10:39:03,748 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:39:03,748 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-03 10:39:03,749 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 10:39:03,749 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 10:39:03,749 INFO  L85        PathProgramCache]: Analyzing trace with hash 1827928240, now seen corresponding path program 1 times
[2025-03-03 10:39:03,749 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 10:39:03,749 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075759356]
[2025-03-03 10:39:03,749 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 10:39:03,749 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 10:39:03,781 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes.
[2025-03-03 10:39:03,804 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements.
[2025-03-03 10:39:03,804 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 10:39:03,804 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 10:39:04,345 INFO  L134       CoverageAnalysis]: Checked inductivity of 415 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked.
[2025-03-03 10:39:04,345 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 10:39:04,345 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075759356]
[2025-03-03 10:39:04,345 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075759356] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 10:39:04,345 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 10:39:04,345 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 10:39:04,345 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771054356]
[2025-03-03 10:39:04,345 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 10:39:04,346 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 10:39:04,346 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 10:39:04,346 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 10:39:04,346 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 10:39:04,346 INFO  L87              Difference]: Start difference. First operand 179493 states and 188938 transitions. Second operand  has 4 states, 4 states have (on average 83.0) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-03 10:39:08,706 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 10:39:08,706 INFO  L93              Difference]: Finished difference Result 524957 states and 552888 transitions.
[2025-03-03 10:39:08,707 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 10:39:08,707 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 83.0) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 602
[2025-03-03 10:39:08,707 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 10:39:09,117 INFO  L225             Difference]: With dead ends: 524957
[2025-03-03 10:39:09,117 INFO  L226             Difference]: Without dead ends: 346217
[2025-03-03 10:39:09,245 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-03 10:39:09,245 INFO  L435           NwaCegarLoop]: 39 mSDtfsCounter, 1753 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4572 mSolverCounterSat, 592 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1753 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 592 IncrementalHoareTripleChecker+Valid, 4572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time
[2025-03-03 10:39:09,245 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1753 Valid, 54 Invalid, 5164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [592 Valid, 4572 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time]
[2025-03-03 10:39:09,829 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 346217 states.