./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label19.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/Problem03_label19.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 dbab4b57592d1cd844f46032ce61618d4e076adc5adb242b34e740348fe0a295
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 09:50:45,302 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 09:50:45,351 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 09:50:45,356 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 09:50:45,358 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 09:50:45,379 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 09:50:45,379 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 09:50:45,380 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 09:50:45,380 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 09:50:45,380 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 09:50:45,380 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 09:50:45,380 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 09:50:45,380 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 09:50:45,380 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 09:50:45,380 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 09:50:45,380 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 09:50:45,380 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 09:50:45,380 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 09:50:45,382 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 09:50:45,382 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 09:50:45,382 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 09:50:45,382 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 09:50:45,382 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 09:50:45,382 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 09:50:45,382 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 09:50:45,383 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 09:50:45,383 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 09:50:45,383 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 09:50:45,383 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 09:50:45,383 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 09:50:45,383 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 09:50:45,383 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 09:50:45,383 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:50:45,384 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 09:50:45,384 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 09:50:45,384 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 09:50:45,384 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 09:50:45,384 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 09:50:45,384 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 09:50:45,384 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 09:50:45,384 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 09:50:45,384 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 09:50:45,384 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 09:50:45,384 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 -> dbab4b57592d1cd844f46032ce61618d4e076adc5adb242b34e740348fe0a295
[2025-03-03 09:50:45,647 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 09:50:45,655 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 09:50:45,657 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 09:50:45,657 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 09:50:45,658 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 09:50:45,658 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label19.c
[2025-03-03 09:50:46,794 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9801f41e/3c90e23733084d4b93d636916730c501/FLAGfc5c941a4
[2025-03-03 09:50:47,091 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 09:50:47,092 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label19.c
[2025-03-03 09:50:47,103 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9801f41e/3c90e23733084d4b93d636916730c501/FLAGfc5c941a4
[2025-03-03 09:50:47,118 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9801f41e/3c90e23733084d4b93d636916730c501
[2025-03-03 09:50:47,120 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 09:50:47,121 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 09:50:47,122 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 09:50:47,122 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 09:50:47,125 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 09:50:47,125 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,126 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad69ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47, skipping insertion in model container
[2025-03-03 09:50:47,126 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,168 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 09:50:47,441 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label19.c[59475,59488]
[2025-03-03 09:50:47,462 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:50:47,472 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 09:50:47,576 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label19.c[59475,59488]
[2025-03-03 09:50:47,586 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 09:50:47,603 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 09:50:47,603 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47 WrapperNode
[2025-03-03 09:50:47,604 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 09:50:47,605 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 09:50:47,605 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 09:50:47,606 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 09:50:47,610 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,629 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,719 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769
[2025-03-03 09:50:47,719 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 09:50:47,720 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 09:50:47,720 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 09:50:47,720 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 09:50:47,726 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,727 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,740 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,778 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 09:50:47,779 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,779 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,812 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,818 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,827 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,833 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,843 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 09:50:47,844 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 09:50:47,844 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 09:50:47,845 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 09:50:47,845 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (1/1) ...
[2025-03-03 09:50:47,849 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 09:50:47,857 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:47,869 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 09:50:47,874 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 09:50:47,889 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 09:50:47,889 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 09:50:47,889 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 09:50:47,889 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 09:50:47,942 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 09:50:47,944 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 09:50:49,442 INFO  L?                        ?]: Removed 147 outVars from TransFormulas that were not future-live.
[2025-03-03 09:50:49,442 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 09:50:49,460 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 09:50:49,463 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 09:50:49,463 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:50:49 BoogieIcfgContainer
[2025-03-03 09:50:49,464 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 09:50:49,465 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 09:50:49,466 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 09:50:49,470 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 09:50:49,470 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:50:47" (1/3) ...
[2025-03-03 09:50:49,470 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f2c1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:50:49, skipping insertion in model container
[2025-03-03 09:50:49,471 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:50:47" (2/3) ...
[2025-03-03 09:50:49,471 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f2c1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:50:49, skipping insertion in model container
[2025-03-03 09:50:49,471 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:50:49" (3/3) ...
[2025-03-03 09:50:49,472 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem03_label19.c
[2025-03-03 09:50:49,485 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 09:50:49,489 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label19.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 09:50:49,545 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 09:50:49,554 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;@5cb0127c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 09:50:49,555 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 09:50:49,558 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:49,574 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 188
[2025-03-03 09:50:49,575 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:49,575 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:49,576 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:49,581 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:49,582 INFO  L85        PathProgramCache]: Analyzing trace with hash 231922024, now seen corresponding path program 1 times
[2025-03-03 09:50:49,587 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:49,590 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295761958]
[2025-03-03 09:50:49,590 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:49,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:49,687 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes.
[2025-03-03 09:50:49,857 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements.
[2025-03-03 09:50:49,858 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:49,858 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:50,293 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 09:50:50,295 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:50,295 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295761958]
[2025-03-03 09:50:50,296 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295761958] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:50,296 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:50,296 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:50:50,297 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659103675]
[2025-03-03 09:50:50,297 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:50,301 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:50,302 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:50,318 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:50,318 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:50,321 INFO  L87              Difference]: Start difference. First operand  has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 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 09:50:51,178 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:51,179 INFO  L93              Difference]: Finished difference Result 857 states and 1495 transitions.
[2025-03-03 09:50:51,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:51,181 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187
[2025-03-03 09:50:51,181 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:51,188 INFO  L225             Difference]: With dead ends: 857
[2025-03-03 09:50:51,188 INFO  L226             Difference]: Without dead ends: 462
[2025-03-03 09:50:51,191 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 09:50:51,193 INFO  L435           NwaCegarLoop]: 149 mSDtfsCounter, 101 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:51,193 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 187 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-03 09:50:51,204 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 462 states.
[2025-03-03 09:50:51,223 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460.
[2025-03-03 09:50:51,224 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 460 states, 459 states have (on average 1.5381263616557734) internal successors, (706), 459 states have internal predecessors, (706), 0 states have call successors, (0), 0 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 09:50:51,231 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 706 transitions.
[2025-03-03 09:50:51,232 INFO  L78                 Accepts]: Start accepts. Automaton has 460 states and 706 transitions. Word has length 187
[2025-03-03 09:50:51,232 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:51,233 INFO  L471      AbstractCegarLoop]: Abstraction has 460 states and 706 transitions.
[2025-03-03 09:50:51,233 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 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 09:50:51,233 INFO  L276                IsEmpty]: Start isEmpty. Operand 460 states and 706 transitions.
[2025-03-03 09:50:51,235 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2025-03-03 09:50:51,235 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:51,235 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:51,235 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-03 09:50:51,236 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:51,236 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:51,236 INFO  L85        PathProgramCache]: Analyzing trace with hash -831506350, now seen corresponding path program 1 times
[2025-03-03 09:50:51,236 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:51,236 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502892314]
[2025-03-03 09:50:51,237 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:51,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:51,273 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes.
[2025-03-03 09:50:51,287 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements.
[2025-03-03 09:50:51,287 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:51,287 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:51,415 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:51,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:51,416 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502892314]
[2025-03-03 09:50:51,416 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502892314] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:51,416 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:51,416 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:50:51,416 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669598679]
[2025-03-03 09:50:51,416 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:51,417 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:51,417 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:51,418 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:51,418 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:51,418 INFO  L87              Difference]: Start difference. First operand 460 states and 706 transitions. Second operand  has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 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 09:50:52,079 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:52,080 INFO  L93              Difference]: Finished difference Result 1344 states and 2079 transitions.
[2025-03-03 09:50:52,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:52,080 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 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 195
[2025-03-03 09:50:52,081 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:52,083 INFO  L225             Difference]: With dead ends: 1344
[2025-03-03 09:50:52,083 INFO  L226             Difference]: Without dead ends: 886
[2025-03-03 09:50:52,084 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 09:50:52,085 INFO  L435           NwaCegarLoop]: 77 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:52,085 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 91 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 09:50:52,087 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 886 states.
[2025-03-03 09:50:52,112 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 870.
[2025-03-03 09:50:52,114 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 870 states, 869 states have (on average 1.5132336018411967) internal successors, (1315), 869 states have internal predecessors, (1315), 0 states have call successors, (0), 0 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 09:50:52,118 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1315 transitions.
[2025-03-03 09:50:52,118 INFO  L78                 Accepts]: Start accepts. Automaton has 870 states and 1315 transitions. Word has length 195
[2025-03-03 09:50:52,118 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:52,118 INFO  L471      AbstractCegarLoop]: Abstraction has 870 states and 1315 transitions.
[2025-03-03 09:50:52,118 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 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 09:50:52,119 INFO  L276                IsEmpty]: Start isEmpty. Operand 870 states and 1315 transitions.
[2025-03-03 09:50:52,124 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 203
[2025-03-03 09:50:52,124 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:52,125 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:52,125 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 09:50:52,125 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:52,125 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:52,125 INFO  L85        PathProgramCache]: Analyzing trace with hash 768698477, now seen corresponding path program 1 times
[2025-03-03 09:50:52,128 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:52,128 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677570344]
[2025-03-03 09:50:52,128 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:52,128 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:52,190 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes.
[2025-03-03 09:50:52,220 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements.
[2025-03-03 09:50:52,220 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:52,220 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:52,780 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:50:52,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:52,782 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677570344]
[2025-03-03 09:50:52,782 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677570344] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:52,782 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:52,782 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:50:52,782 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629142074]
[2025-03-03 09:50:52,782 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:52,783 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:50:52,783 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:52,783 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:50:52,784 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:50:52,785 INFO  L87              Difference]: Start difference. First operand 870 states and 1315 transitions. Second operand  has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 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 09:50:53,545 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:53,546 INFO  L93              Difference]: Finished difference Result 1884 states and 2886 transitions.
[2025-03-03 09:50:53,547 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:50:53,547 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202
[2025-03-03 09:50:53,547 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:53,551 INFO  L225             Difference]: With dead ends: 1884
[2025-03-03 09:50:53,551 INFO  L226             Difference]: Without dead ends: 842
[2025-03-03 09:50:53,553 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 09:50:53,553 INFO  L435           NwaCegarLoop]: 32 mSDtfsCounter, 299 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:53,554 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 47 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 09:50:53,555 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 842 states.
[2025-03-03 09:50:53,566 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842.
[2025-03-03 09:50:53,567 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 842 states, 841 states have (on average 1.3650416171224733) internal successors, (1148), 841 states have internal predecessors, (1148), 0 states have call successors, (0), 0 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 09:50:53,569 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1148 transitions.
[2025-03-03 09:50:53,569 INFO  L78                 Accepts]: Start accepts. Automaton has 842 states and 1148 transitions. Word has length 202
[2025-03-03 09:50:53,569 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:53,570 INFO  L471      AbstractCegarLoop]: Abstraction has 842 states and 1148 transitions.
[2025-03-03 09:50:53,570 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 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 09:50:53,570 INFO  L276                IsEmpty]: Start isEmpty. Operand 842 states and 1148 transitions.
[2025-03-03 09:50:53,572 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 211
[2025-03-03 09:50:53,572 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:53,572 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:53,572 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 09:50:53,572 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:53,573 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:53,573 INFO  L85        PathProgramCache]: Analyzing trace with hash -1935046547, now seen corresponding path program 1 times
[2025-03-03 09:50:53,573 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:53,573 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928640354]
[2025-03-03 09:50:53,573 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:53,573 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:53,608 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes.
[2025-03-03 09:50:53,622 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements.
[2025-03-03 09:50:53,623 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:53,623 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:53,734 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:53,735 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:53,735 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928640354]
[2025-03-03 09:50:53,735 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928640354] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:53,735 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:53,735 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:50:53,735 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818093131]
[2025-03-03 09:50:53,735 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:53,735 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:53,735 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:53,736 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:53,736 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:53,736 INFO  L87              Difference]: Start difference. First operand 842 states and 1148 transitions. Second operand  has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:54,267 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:54,267 INFO  L93              Difference]: Finished difference Result 2506 states and 3421 transitions.
[2025-03-03 09:50:54,267 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:54,268 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210
[2025-03-03 09:50:54,268 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:54,272 INFO  L225             Difference]: With dead ends: 2506
[2025-03-03 09:50:54,272 INFO  L226             Difference]: Without dead ends: 1666
[2025-03-03 09:50:54,273 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 09:50:54,274 INFO  L435           NwaCegarLoop]: 53 mSDtfsCounter, 229 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:54,274 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 70 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:50:54,277 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1666 states.
[2025-03-03 09:50:54,295 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1663.
[2025-03-03 09:50:54,297 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1663 states, 1662 states have (on average 1.325511432009627) internal successors, (2203), 1662 states have internal predecessors, (2203), 0 states have call successors, (0), 0 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 09:50:54,302 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2203 transitions.
[2025-03-03 09:50:54,302 INFO  L78                 Accepts]: Start accepts. Automaton has 1663 states and 2203 transitions. Word has length 210
[2025-03-03 09:50:54,302 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:54,302 INFO  L471      AbstractCegarLoop]: Abstraction has 1663 states and 2203 transitions.
[2025-03-03 09:50:54,303 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:50:54,303 INFO  L276                IsEmpty]: Start isEmpty. Operand 1663 states and 2203 transitions.
[2025-03-03 09:50:54,306 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 216
[2025-03-03 09:50:54,306 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:54,306 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:54,306 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 09:50:54,306 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:54,307 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:54,307 INFO  L85        PathProgramCache]: Analyzing trace with hash -1668171929, now seen corresponding path program 1 times
[2025-03-03 09:50:54,307 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:54,307 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288860533]
[2025-03-03 09:50:54,307 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:54,307 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:54,333 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-03-03 09:50:54,338 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-03-03 09:50:54,339 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:54,339 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:54,519 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:54,519 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:54,520 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288860533]
[2025-03-03 09:50:54,520 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288860533] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:54,520 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:54,520 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:50:54,520 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357996670]
[2025-03-03 09:50:54,520 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:54,521 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:54,521 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:54,522 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:54,522 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:50:54,522 INFO  L87              Difference]: Start difference. First operand 1663 states and 2203 transitions. Second operand  has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 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 09:50:55,133 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:55,134 INFO  L93              Difference]: Finished difference Result 4156 states and 5494 transitions.
[2025-03-03 09:50:55,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:50:55,134 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 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 215
[2025-03-03 09:50:55,134 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:55,141 INFO  L225             Difference]: With dead ends: 4156
[2025-03-03 09:50:55,141 INFO  L226             Difference]: Without dead ends: 2495
[2025-03-03 09:50:55,143 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 09:50:55,144 INFO  L435           NwaCegarLoop]: 44 mSDtfsCounter, 203 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:55,144 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 57 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-03 09:50:55,146 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2495 states.
[2025-03-03 09:50:55,173 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2492.
[2025-03-03 09:50:55,176 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2492 states, 2491 states have (on average 1.3167402649538338) internal successors, (3280), 2491 states have internal predecessors, (3280), 0 states have call successors, (0), 0 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 09:50:55,182 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 3280 transitions.
[2025-03-03 09:50:55,182 INFO  L78                 Accepts]: Start accepts. Automaton has 2492 states and 3280 transitions. Word has length 215
[2025-03-03 09:50:55,182 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:55,182 INFO  L471      AbstractCegarLoop]: Abstraction has 2492 states and 3280 transitions.
[2025-03-03 09:50:55,183 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 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 09:50:55,183 INFO  L276                IsEmpty]: Start isEmpty. Operand 2492 states and 3280 transitions.
[2025-03-03 09:50:55,186 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 219
[2025-03-03 09:50:55,186 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:55,187 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:55,187 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 09:50:55,187 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:55,187 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:55,187 INFO  L85        PathProgramCache]: Analyzing trace with hash 1602819585, now seen corresponding path program 1 times
[2025-03-03 09:50:55,188 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:55,188 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010027104]
[2025-03-03 09:50:55,188 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:55,188 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:55,212 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes.
[2025-03-03 09:50:55,226 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements.
[2025-03-03 09:50:55,226 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:55,227 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:55,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:55,590 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:55,590 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010027104]
[2025-03-03 09:50:55,590 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010027104] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:55,590 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:50:55,590 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:50:55,590 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037798933]
[2025-03-03 09:50:55,590 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:55,590 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:50:55,590 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:55,591 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:50:55,591 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:50:55,591 INFO  L87              Difference]: Start difference. First operand 2492 states and 3280 transitions. Second operand  has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 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 09:50:56,528 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:56,528 INFO  L93              Difference]: Finished difference Result 6979 states and 9220 transitions.
[2025-03-03 09:50:56,528 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:50:56,528 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 218
[2025-03-03 09:50:56,529 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:56,539 INFO  L225             Difference]: With dead ends: 6979
[2025-03-03 09:50:56,539 INFO  L226             Difference]: Without dead ends: 4141
[2025-03-03 09:50:56,541 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 09:50:56,543 INFO  L435           NwaCegarLoop]: 98 mSDtfsCounter, 194 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:56,543 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 121 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 09:50:56,548 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4141 states.
[2025-03-03 09:50:56,597 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 4140.
[2025-03-03 09:50:56,601 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4140 states, 4139 states have (on average 1.2974148345010872) internal successors, (5370), 4139 states have internal predecessors, (5370), 0 states have call successors, (0), 0 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 09:50:56,608 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 5370 transitions.
[2025-03-03 09:50:56,609 INFO  L78                 Accepts]: Start accepts. Automaton has 4140 states and 5370 transitions. Word has length 218
[2025-03-03 09:50:56,609 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:56,609 INFO  L471      AbstractCegarLoop]: Abstraction has 4140 states and 5370 transitions.
[2025-03-03 09:50:56,609 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 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 09:50:56,609 INFO  L276                IsEmpty]: Start isEmpty. Operand 4140 states and 5370 transitions.
[2025-03-03 09:50:56,615 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 223
[2025-03-03 09:50:56,615 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:56,615 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:56,616 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 09:50:56,616 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:56,616 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:56,616 INFO  L85        PathProgramCache]: Analyzing trace with hash -2086876158, now seen corresponding path program 1 times
[2025-03-03 09:50:56,616 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:56,616 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501134300]
[2025-03-03 09:50:56,616 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:56,616 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:56,647 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes.
[2025-03-03 09:50:56,653 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements.
[2025-03-03 09:50:56,654 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:56,654 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:56,926 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:56,927 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:56,927 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501134300]
[2025-03-03 09:50:56,927 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501134300] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:50:56,927 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128492638]
[2025-03-03 09:50:56,927 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:56,927 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:56,928 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:56,936 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 09:50:56,942 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 09:50:57,021 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes.
[2025-03-03 09:50:57,077 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements.
[2025-03-03 09:50:57,077 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:57,077 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:57,080 INFO  L256         TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-03-03 09:50:57,090 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:50:57,224 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:57,224 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:50:57,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128492638] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:57,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:50:57,224 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-03-03 09:50:57,224 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934297935]
[2025-03-03 09:50:57,224 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:57,224 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:50:57,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:57,225 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:50:57,225 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:50:57,225 INFO  L87              Difference]: Start difference. First operand 4140 states and 5370 transitions. Second operand  has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 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 09:50:57,977 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:50:57,977 INFO  L93              Difference]: Finished difference Result 14606 states and 18960 transitions.
[2025-03-03 09:50:57,978 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:50:57,978 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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 222
[2025-03-03 09:50:57,978 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:50:58,012 INFO  L225             Difference]: With dead ends: 14606
[2025-03-03 09:50:58,012 INFO  L226             Difference]: Without dead ends: 10468
[2025-03-03 09:50:58,020 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:50:58,021 INFO  L435           NwaCegarLoop]: 60 mSDtfsCounter, 491 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-03 09:50:58,021 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 293 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-03 09:50:58,032 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10468 states.
[2025-03-03 09:50:58,166 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10468 to 10460.
[2025-03-03 09:50:58,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10460 states, 10459 states have (on average 1.2783248876565638) internal successors, (13370), 10459 states have internal predecessors, (13370), 0 states have call successors, (0), 0 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 09:50:58,194 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10460 states to 10460 states and 13370 transitions.
[2025-03-03 09:50:58,195 INFO  L78                 Accepts]: Start accepts. Automaton has 10460 states and 13370 transitions. Word has length 222
[2025-03-03 09:50:58,195 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:50:58,195 INFO  L471      AbstractCegarLoop]: Abstraction has 10460 states and 13370 transitions.
[2025-03-03 09:50:58,195 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 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 09:50:58,196 INFO  L276                IsEmpty]: Start isEmpty. Operand 10460 states and 13370 transitions.
[2025-03-03 09:50:58,206 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2025-03-03 09:50:58,206 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:50:58,206 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:58,214 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 09:50:58,411 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:58,411 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:50:58,412 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:50:58,412 INFO  L85        PathProgramCache]: Analyzing trace with hash 570161030, now seen corresponding path program 1 times
[2025-03-03 09:50:58,412 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:50:58,412 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874505401]
[2025-03-03 09:50:58,412 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:58,412 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:50:58,438 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes.
[2025-03-03 09:50:58,444 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements.
[2025-03-03 09:50:58,444 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:58,444 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:59,119 INFO  L134       CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:50:59,119 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:50:59,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874505401]
[2025-03-03 09:50:59,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874505401] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:50:59,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603516982]
[2025-03-03 09:50:59,119 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:50:59,119 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:50:59,120 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:50:59,122 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 09:50:59,124 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 09:50:59,190 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes.
[2025-03-03 09:50:59,249 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements.
[2025-03-03 09:50:59,249 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:50:59,249 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:50:59,252 INFO  L256         TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:50:59,255 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:50:59,460 INFO  L134       CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2025-03-03 09:50:59,460 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:50:59,460 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603516982] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:50:59,460 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:50:59,460 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-03 09:50:59,461 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060211355]
[2025-03-03 09:50:59,461 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:50:59,461 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:50:59,461 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:50:59,462 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:50:59,462 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:50:59,462 INFO  L87              Difference]: Start difference. First operand 10460 states and 13370 transitions. Second operand  has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 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 09:51:00,038 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:00,038 INFO  L93              Difference]: Finished difference Result 20932 states and 26763 transitions.
[2025-03-03 09:51:00,038 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:00,039 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 225
[2025-03-03 09:51:00,039 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:00,066 INFO  L225             Difference]: With dead ends: 20932
[2025-03-03 09:51:00,067 INFO  L226             Difference]: Without dead ends: 10474
[2025-03-03 09:51:00,082 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:51:00,083 INFO  L435           NwaCegarLoop]: 284 mSDtfsCounter, 37 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:00,083 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 299 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:51:00,093 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10474 states.
[2025-03-03 09:51:00,224 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10474 to 10460.
[2025-03-03 09:51:00,243 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10460 states, 10459 states have (on average 1.268381298403289) internal successors, (13266), 10459 states have internal predecessors, (13266), 0 states have call successors, (0), 0 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 09:51:00,259 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10460 states to 10460 states and 13266 transitions.
[2025-03-03 09:51:00,260 INFO  L78                 Accepts]: Start accepts. Automaton has 10460 states and 13266 transitions. Word has length 225
[2025-03-03 09:51:00,260 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:00,260 INFO  L471      AbstractCegarLoop]: Abstraction has 10460 states and 13266 transitions.
[2025-03-03 09:51:00,261 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 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 09:51:00,261 INFO  L276                IsEmpty]: Start isEmpty. Operand 10460 states and 13266 transitions.
[2025-03-03 09:51:00,271 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-03-03 09:51:00,272 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:00,272 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:00,280 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 09:51:00,472 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,SelfDestructingSolverStorable7
[2025-03-03 09:51:00,473 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:00,474 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:00,474 INFO  L85        PathProgramCache]: Analyzing trace with hash 1291877421, now seen corresponding path program 1 times
[2025-03-03 09:51:00,474 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:00,474 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10852528]
[2025-03-03 09:51:00,474 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:00,474 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:00,501 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-03 09:51:00,508 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-03 09:51:00,508 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:00,508 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:01,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 54 backedges. 44 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-03 09:51:01,118 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:01,118 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10852528]
[2025-03-03 09:51:01,118 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10852528] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:51:01,118 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88896950]
[2025-03-03 09:51:01,118 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:01,118 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:01,118 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:51:01,120 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 09:51:01,122 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 09:51:01,176 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-03 09:51:01,230 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-03 09:51:01,230 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:01,230 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:01,232 INFO  L256         TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:51:01,235 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:51:01,246 INFO  L134       CoverageAnalysis]: Checked inductivity of 54 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:51:01,247 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:51:01,247 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [88896950] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:01,247 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:51:01,247 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-03 09:51:01,247 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548902379]
[2025-03-03 09:51:01,247 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:01,247 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:01,248 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:01,248 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:01,248 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:51:01,249 INFO  L87              Difference]: Start difference. First operand 10460 states and 13266 transitions. Second operand  has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:01,802 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:01,802 INFO  L93              Difference]: Finished difference Result 31075 states and 39419 transitions.
[2025-03-03 09:51:01,806 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:01,806 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231
[2025-03-03 09:51:01,807 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:01,839 INFO  L225             Difference]: With dead ends: 31075
[2025-03-03 09:51:01,840 INFO  L226             Difference]: Without dead ends: 20617
[2025-03-03 09:51:01,852 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:51:01,853 INFO  L435           NwaCegarLoop]: 320 mSDtfsCounter, 215 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:01,853 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 340 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:51:01,869 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20617 states.
[2025-03-03 09:51:02,092 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20617 to 20610.
[2025-03-03 09:51:02,113 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20610 states, 20609 states have (on average 1.167596681061672) internal successors, (24063), 20609 states have internal predecessors, (24063), 0 states have call successors, (0), 0 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 09:51:02,133 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20610 states to 20610 states and 24063 transitions.
[2025-03-03 09:51:02,133 INFO  L78                 Accepts]: Start accepts. Automaton has 20610 states and 24063 transitions. Word has length 231
[2025-03-03 09:51:02,133 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:02,134 INFO  L471      AbstractCegarLoop]: Abstraction has 20610 states and 24063 transitions.
[2025-03-03 09:51:02,134 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:02,134 INFO  L276                IsEmpty]: Start isEmpty. Operand 20610 states and 24063 transitions.
[2025-03-03 09:51:02,151 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 239
[2025-03-03 09:51:02,152 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:02,152 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:02,161 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-03-03 09:51:02,352 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:02,353 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:02,353 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:02,353 INFO  L85        PathProgramCache]: Analyzing trace with hash -1572381381, now seen corresponding path program 1 times
[2025-03-03 09:51:02,353 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:02,353 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808690597]
[2025-03-03 09:51:02,353 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:02,353 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:02,383 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes.
[2025-03-03 09:51:02,389 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements.
[2025-03-03 09:51:02,389 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:02,389 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:02,619 INFO  L134       CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:51:02,619 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:02,619 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808690597]
[2025-03-03 09:51:02,620 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808690597] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:02,620 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:51:02,620 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:51:02,620 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861567619]
[2025-03-03 09:51:02,620 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:02,620 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:02,620 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:02,620 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:02,621 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:51:02,621 INFO  L87              Difference]: Start difference. First operand 20610 states and 24063 transitions. Second operand  has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 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 09:51:03,260 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:03,260 INFO  L93              Difference]: Finished difference Result 59173 states and 69126 transitions.
[2025-03-03 09:51:03,261 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:03,261 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 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 238
[2025-03-03 09:51:03,261 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:03,322 INFO  L225             Difference]: With dead ends: 59173
[2025-03-03 09:51:03,322 INFO  L226             Difference]: Without dead ends: 38565
[2025-03-03 09:51:03,347 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 09:51:03,348 INFO  L435           NwaCegarLoop]: 77 mSDtfsCounter, 210 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:03,348 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 98 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:51:03,379 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 38565 states.
[2025-03-03 09:51:03,688 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 38565 to 38556.
[2025-03-03 09:51:03,721 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 38556 states, 38555 states have (on average 1.1630916872001038) internal successors, (44843), 38555 states have internal predecessors, (44843), 0 states have call successors, (0), 0 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 09:51:03,890 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38556 states to 38556 states and 44843 transitions.
[2025-03-03 09:51:03,891 INFO  L78                 Accepts]: Start accepts. Automaton has 38556 states and 44843 transitions. Word has length 238
[2025-03-03 09:51:03,891 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:03,891 INFO  L471      AbstractCegarLoop]: Abstraction has 38556 states and 44843 transitions.
[2025-03-03 09:51:03,891 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 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 09:51:03,891 INFO  L276                IsEmpty]: Start isEmpty. Operand 38556 states and 44843 transitions.
[2025-03-03 09:51:03,922 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 242
[2025-03-03 09:51:03,922 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:03,922 INFO  L218           NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:51:03,923 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-03 09:51:03,923 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:03,924 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:03,924 INFO  L85        PathProgramCache]: Analyzing trace with hash -191439383, now seen corresponding path program 1 times
[2025-03-03 09:51:03,924 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:03,924 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692758081]
[2025-03-03 09:51:03,924 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:03,924 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:03,947 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes.
[2025-03-03 09:51:03,954 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements.
[2025-03-03 09:51:03,955 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:03,955 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:04,069 INFO  L134       CoverageAnalysis]: Checked inductivity of 64 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:51:04,069 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:04,069 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692758081]
[2025-03-03 09:51:04,069 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692758081] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:04,069 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:51:04,069 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:51:04,069 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825093949]
[2025-03-03 09:51:04,069 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:04,070 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:04,070 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:04,070 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:04,070 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:51:04,070 INFO  L87              Difference]: Start difference. First operand 38556 states and 44843 transitions. Second operand  has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 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 09:51:04,770 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:04,771 INFO  L93              Difference]: Finished difference Result 93147 states and 109845 transitions.
[2025-03-03 09:51:04,771 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:04,771 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 241
[2025-03-03 09:51:04,771 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:04,846 INFO  L225             Difference]: With dead ends: 93147
[2025-03-03 09:51:04,846 INFO  L226             Difference]: Without dead ends: 54593
[2025-03-03 09:51:04,879 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 09:51:04,881 INFO  L435           NwaCegarLoop]: 109 mSDtfsCounter, 212 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:04,881 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 129 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:51:04,915 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54593 states.
[2025-03-03 09:51:05,413 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54593 to 51548.
[2025-03-03 09:51:05,456 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51548 states, 51547 states have (on average 1.1353522028440064) internal successors, (58524), 51547 states have internal predecessors, (58524), 0 states have call successors, (0), 0 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 09:51:05,684 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51548 states to 51548 states and 58524 transitions.
[2025-03-03 09:51:05,685 INFO  L78                 Accepts]: Start accepts. Automaton has 51548 states and 58524 transitions. Word has length 241
[2025-03-03 09:51:05,685 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:05,685 INFO  L471      AbstractCegarLoop]: Abstraction has 51548 states and 58524 transitions.
[2025-03-03 09:51:05,685 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 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 09:51:05,686 INFO  L276                IsEmpty]: Start isEmpty. Operand 51548 states and 58524 transitions.
[2025-03-03 09:51:05,707 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 254
[2025-03-03 09:51:05,707 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:05,707 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:51:05,707 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-03 09:51:05,707 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:05,708 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:05,708 INFO  L85        PathProgramCache]: Analyzing trace with hash 2103352453, now seen corresponding path program 1 times
[2025-03-03 09:51:05,708 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:05,708 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861972044]
[2025-03-03 09:51:05,708 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:05,708 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:05,737 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes.
[2025-03-03 09:51:05,743 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements.
[2025-03-03 09:51:05,744 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:05,744 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:06,623 INFO  L134       CoverageAnalysis]: Checked inductivity of 105 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2025-03-03 09:51:06,623 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:06,623 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861972044]
[2025-03-03 09:51:06,623 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861972044] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:51:06,624 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760245279]
[2025-03-03 09:51:06,624 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:06,624 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:06,624 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:51:06,630 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:51:06,632 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-03 09:51:06,703 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes.
[2025-03-03 09:51:06,772 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements.
[2025-03-03 09:51:06,772 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:06,772 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:06,774 INFO  L256         TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 09:51:06,778 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:51:06,821 INFO  L134       CoverageAnalysis]: Checked inductivity of 105 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:51:06,822 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:51:06,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760245279] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:06,822 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:51:06,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-03 09:51:06,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125222142]
[2025-03-03 09:51:06,822 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:06,822 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:06,822 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:06,823 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:06,823 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:51:06,823 INFO  L87              Difference]: Start difference. First operand 51548 states and 58524 transitions. Second operand  has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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 09:51:07,544 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:07,545 INFO  L93              Difference]: Finished difference Result 101654 states and 115191 transitions.
[2025-03-03 09:51:07,545 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:07,546 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253
[2025-03-03 09:51:07,546 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:07,612 INFO  L225             Difference]: With dead ends: 101654
[2025-03-03 09:51:07,612 INFO  L226             Difference]: Without dead ends: 50108
[2025-03-03 09:51:07,649 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:51:07,650 INFO  L435           NwaCegarLoop]: 275 mSDtfsCounter, 213 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:07,650 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 289 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:51:07,684 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50108 states.
[2025-03-03 09:51:08,110 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50108 to 50101.
[2025-03-03 09:51:08,147 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 50101 states, 50100 states have (on average 1.1034930139720558) internal successors, (55285), 50100 states have internal predecessors, (55285), 0 states have call successors, (0), 0 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 09:51:08,201 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50101 states to 50101 states and 55285 transitions.
[2025-03-03 09:51:08,202 INFO  L78                 Accepts]: Start accepts. Automaton has 50101 states and 55285 transitions. Word has length 253
[2025-03-03 09:51:08,202 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:08,202 INFO  L471      AbstractCegarLoop]: Abstraction has 50101 states and 55285 transitions.
[2025-03-03 09:51:08,203 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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 09:51:08,203 INFO  L276                IsEmpty]: Start isEmpty. Operand 50101 states and 55285 transitions.
[2025-03-03 09:51:08,220 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 260
[2025-03-03 09:51:08,220 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:08,220 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:51:08,228 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-03-03 09:51:08,420 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:08,421 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:08,421 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:08,421 INFO  L85        PathProgramCache]: Analyzing trace with hash -1560770440, now seen corresponding path program 1 times
[2025-03-03 09:51:08,421 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:08,421 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233717514]
[2025-03-03 09:51:08,421 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:08,421 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:08,446 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes.
[2025-03-03 09:51:08,452 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements.
[2025-03-03 09:51:08,452 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:08,452 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:08,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 114 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2025-03-03 09:51:08,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:08,557 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233717514]
[2025-03-03 09:51:08,557 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233717514] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:08,557 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:51:08,557 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:51:08,557 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373345285]
[2025-03-03 09:51:08,557 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:08,557 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:51:08,557 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:08,558 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:51:08,558 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:51:08,558 INFO  L87              Difference]: Start difference. First operand 50101 states and 55285 transitions. Second operand  has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:09,354 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:09,354 INFO  L93              Difference]: Finished difference Result 147780 states and 162565 transitions.
[2025-03-03 09:51:09,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:51:09,355 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259
[2025-03-03 09:51:09,355 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:09,467 INFO  L225             Difference]: With dead ends: 147780
[2025-03-03 09:51:09,467 INFO  L226             Difference]: Without dead ends: 97681
[2025-03-03 09:51:09,516 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 09:51:09,516 INFO  L435           NwaCegarLoop]: 78 mSDtfsCounter, 469 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:09,517 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 317 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 09:51:09,592 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 97681 states.
[2025-03-03 09:51:10,503 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 97681 to 97672.
[2025-03-03 09:51:10,570 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 97672 states, 97671 states have (on average 1.0969581554402024) internal successors, (107141), 97671 states have internal predecessors, (107141), 0 states have call successors, (0), 0 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 09:51:10,673 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97672 states to 97672 states and 107141 transitions.
[2025-03-03 09:51:10,675 INFO  L78                 Accepts]: Start accepts. Automaton has 97672 states and 107141 transitions. Word has length 259
[2025-03-03 09:51:10,675 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:10,675 INFO  L471      AbstractCegarLoop]: Abstraction has 97672 states and 107141 transitions.
[2025-03-03 09:51:10,675 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 57.25) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-03 09:51:10,675 INFO  L276                IsEmpty]: Start isEmpty. Operand 97672 states and 107141 transitions.
[2025-03-03 09:51:10,702 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 263
[2025-03-03 09:51:10,702 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:10,702 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:10,702 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-03 09:51:10,702 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:10,703 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:10,703 INFO  L85        PathProgramCache]: Analyzing trace with hash -1632667555, now seen corresponding path program 1 times
[2025-03-03 09:51:10,703 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:10,703 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654199329]
[2025-03-03 09:51:10,703 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:10,703 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:10,730 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes.
[2025-03-03 09:51:10,738 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements.
[2025-03-03 09:51:10,739 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:10,739 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:10,848 INFO  L134       CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:51:10,849 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:10,849 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654199329]
[2025-03-03 09:51:10,849 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654199329] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:10,849 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:51:10,849 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 09:51:10,849 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884137399]
[2025-03-03 09:51:10,849 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:10,849 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:10,850 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:10,850 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:10,850 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-03 09:51:10,850 INFO  L87              Difference]: Start difference. First operand 97672 states and 107141 transitions. Second operand  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 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 09:51:11,970 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:11,971 INFO  L93              Difference]: Finished difference Result 248856 states and 272915 transitions.
[2025-03-03 09:51:11,972 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:11,972 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 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 262
[2025-03-03 09:51:11,972 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:12,327 INFO  L225             Difference]: With dead ends: 248856
[2025-03-03 09:51:12,327 INFO  L226             Difference]: Without dead ends: 151186
[2025-03-03 09:51:12,363 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 09:51:12,364 INFO  L435           NwaCegarLoop]: 127 mSDtfsCounter, 155 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:12,364 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 142 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:51:12,442 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 151186 states.
[2025-03-03 09:51:13,802 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 151186 to 151176.
[2025-03-03 09:51:13,912 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 151176 states, 151175 states have (on average 1.0955713576980322) internal successors, (165623), 151175 states have internal predecessors, (165623), 0 states have call successors, (0), 0 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 09:51:14,088 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 151176 states to 151176 states and 165623 transitions.
[2025-03-03 09:51:14,090 INFO  L78                 Accepts]: Start accepts. Automaton has 151176 states and 165623 transitions. Word has length 262
[2025-03-03 09:51:14,090 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:14,090 INFO  L471      AbstractCegarLoop]: Abstraction has 151176 states and 165623 transitions.
[2025-03-03 09:51:14,091 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 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 09:51:14,091 INFO  L276                IsEmpty]: Start isEmpty. Operand 151176 states and 165623 transitions.
[2025-03-03 09:51:14,122 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 270
[2025-03-03 09:51:14,122 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:14,122 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:51:14,122 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-03 09:51:14,122 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:14,122 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:14,123 INFO  L85        PathProgramCache]: Analyzing trace with hash -1634081182, now seen corresponding path program 1 times
[2025-03-03 09:51:14,123 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:14,123 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885937690]
[2025-03-03 09:51:14,123 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:14,123 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:14,148 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes.
[2025-03-03 09:51:14,157 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements.
[2025-03-03 09:51:14,158 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:14,158 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:15,200 INFO  L134       CoverageAnalysis]: Checked inductivity of 87 backedges. 81 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:51:15,200 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:15,200 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885937690]
[2025-03-03 09:51:15,200 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885937690] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:51:15,200 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811190097]
[2025-03-03 09:51:15,200 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:15,200 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:15,200 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:51:15,202 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:51:15,203 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-03-03 09:51:15,268 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes.
[2025-03-03 09:51:15,328 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements.
[2025-03-03 09:51:15,328 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:15,328 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:15,330 INFO  L256         TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-03 09:51:15,334 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:51:15,411 INFO  L134       CoverageAnalysis]: Checked inductivity of 87 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-03-03 09:51:15,412 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:51:15,412 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811190097] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:15,412 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:51:15,412 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5
[2025-03-03 09:51:15,412 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515557290]
[2025-03-03 09:51:15,412 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:15,412 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:15,412 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:15,413 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:15,413 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:51:15,413 INFO  L87              Difference]: Start difference. First operand 151176 states and 165623 transitions. Second operand  has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 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 09:51:16,593 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:16,593 INFO  L93              Difference]: Finished difference Result 378202 states and 414324 transitions.
[2025-03-03 09:51:16,593 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:16,594 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 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 269
[2025-03-03 09:51:16,594 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:16,876 INFO  L225             Difference]: With dead ends: 378202
[2025-03-03 09:51:16,877 INFO  L226             Difference]: Without dead ends: 227028
[2025-03-03 09:51:16,977 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:51:16,978 INFO  L435           NwaCegarLoop]: 99 mSDtfsCounter, 152 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:16,978 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 126 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:51:17,152 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 227028 states.
[2025-03-03 09:51:19,417 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 227028 to 187732.
[2025-03-03 09:51:19,556 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 187732 states, 187731 states have (on average 1.1046550649599693) internal successors, (207378), 187731 states have internal predecessors, (207378), 0 states have call successors, (0), 0 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 09:51:20,064 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 187732 states to 187732 states and 207378 transitions.
[2025-03-03 09:51:20,067 INFO  L78                 Accepts]: Start accepts. Automaton has 187732 states and 207378 transitions. Word has length 269
[2025-03-03 09:51:20,067 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:20,067 INFO  L471      AbstractCegarLoop]: Abstraction has 187732 states and 207378 transitions.
[2025-03-03 09:51:20,067 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 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 09:51:20,067 INFO  L276                IsEmpty]: Start isEmpty. Operand 187732 states and 207378 transitions.
[2025-03-03 09:51:20,097 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 287
[2025-03-03 09:51:20,097 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:20,097 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:51:20,103 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-03-03 09:51:20,297 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2025-03-03 09:51:20,298 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:20,298 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:20,298 INFO  L85        PathProgramCache]: Analyzing trace with hash 738265710, now seen corresponding path program 1 times
[2025-03-03 09:51:20,298 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:20,298 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250698050]
[2025-03-03 09:51:20,298 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:20,298 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:20,325 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes.
[2025-03-03 09:51:20,331 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements.
[2025-03-03 09:51:20,332 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:20,332 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:21,067 INFO  L134       CoverageAnalysis]: Checked inductivity of 167 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked.
[2025-03-03 09:51:21,068 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:21,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250698050]
[2025-03-03 09:51:21,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250698050] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:51:21,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308263691]
[2025-03-03 09:51:21,068 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:21,068 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:21,068 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:51:21,070 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:51:21,071 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-03-03 09:51:21,165 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes.
[2025-03-03 09:51:21,223 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements.
[2025-03-03 09:51:21,223 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:21,223 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:21,225 INFO  L256         TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 09:51:21,228 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:51:21,276 INFO  L134       CoverageAnalysis]: Checked inductivity of 167 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-03-03 09:51:21,276 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:51:21,276 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308263691] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:21,276 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:51:21,276 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-03 09:51:21,276 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757823520]
[2025-03-03 09:51:21,276 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:21,277 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:21,277 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:21,277 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:21,277 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:51:21,277 INFO  L87              Difference]: Start difference. First operand 187732 states and 207378 transitions. Second operand  has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 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 09:51:22,785 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:22,785 INFO  L93              Difference]: Finished difference Result 525521 states and 580271 transitions.
[2025-03-03 09:51:22,785 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:22,786 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 286
[2025-03-03 09:51:22,786 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:23,257 INFO  L225             Difference]: With dead ends: 525521
[2025-03-03 09:51:23,257 INFO  L226             Difference]: Without dead ends: 337791
[2025-03-03 09:51:23,358 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:51:23,358 INFO  L435           NwaCegarLoop]: 561 mSDtfsCounter, 231 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:23,358 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 798 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 09:51:23,626 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 337791 states.
[2025-03-03 09:51:27,219 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 337791 to 333706.
[2025-03-03 09:51:27,477 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 333706 states, 333705 states have (on average 1.0938973045054763) internal successors, (365039), 333705 states have internal predecessors, (365039), 0 states have call successors, (0), 0 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 09:51:28,341 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 333706 states to 333706 states and 365039 transitions.
[2025-03-03 09:51:28,346 INFO  L78                 Accepts]: Start accepts. Automaton has 333706 states and 365039 transitions. Word has length 286
[2025-03-03 09:51:28,346 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:28,346 INFO  L471      AbstractCegarLoop]: Abstraction has 333706 states and 365039 transitions.
[2025-03-03 09:51:28,346 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 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 09:51:28,346 INFO  L276                IsEmpty]: Start isEmpty. Operand 333706 states and 365039 transitions.
[2025-03-03 09:51:28,398 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 288
[2025-03-03 09:51:28,398 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:28,399 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:28,409 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-03-03 09:51:28,603 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-03-03 09:51:28,603 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:28,604 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:28,604 INFO  L85        PathProgramCache]: Analyzing trace with hash -1863245805, now seen corresponding path program 1 times
[2025-03-03 09:51:28,604 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:28,604 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239155468]
[2025-03-03 09:51:28,609 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:28,609 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:28,639 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes.
[2025-03-03 09:51:28,644 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements.
[2025-03-03 09:51:28,645 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:28,645 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:29,493 INFO  L134       CoverageAnalysis]: Checked inductivity of 204 backedges. 108 proven. 6 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2025-03-03 09:51:29,494 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:29,494 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239155468]
[2025-03-03 09:51:29,494 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239155468] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 09:51:29,494 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797059682]
[2025-03-03 09:51:29,494 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:29,494 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:29,494 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 09:51:29,496 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-03 09:51:29,499 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-03-03 09:51:29,653 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes.
[2025-03-03 09:51:29,711 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements.
[2025-03-03 09:51:29,711 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:29,711 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:29,713 INFO  L256         TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-03 09:51:29,716 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 09:51:29,752 INFO  L134       CoverageAnalysis]: Checked inductivity of 204 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2025-03-03 09:51:29,752 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 09:51:29,752 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [797059682] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:29,752 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 09:51:29,752 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-03 09:51:29,753 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679769434]
[2025-03-03 09:51:29,753 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:29,754 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-03 09:51:29,754 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:29,754 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-03 09:51:29,754 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:51:29,754 INFO  L87              Difference]: Start difference. First operand 333706 states and 365039 transitions. Second operand  has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 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 09:51:31,720 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:31,721 INFO  L93              Difference]: Finished difference Result 666632 states and 730001 transitions.
[2025-03-03 09:51:31,721 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-03 09:51:31,722 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 287
[2025-03-03 09:51:31,722 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:32,222 INFO  L225             Difference]: With dead ends: 666632
[2025-03-03 09:51:32,222 INFO  L226             Difference]: Without dead ends: 332928
[2025-03-03 09:51:32,417 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-03 09:51:32,417 INFO  L435           NwaCegarLoop]: 278 mSDtfsCounter, 201 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:32,417 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 299 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 09:51:32,720 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 332928 states.
[2025-03-03 09:51:36,097 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 332928 to 305069.
[2025-03-03 09:51:36,248 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 305069 states, 305068 states have (on average 1.0924941324557147) internal successors, (333285), 305068 states have internal predecessors, (333285), 0 states have call successors, (0), 0 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 09:51:36,720 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 305069 states to 305069 states and 333285 transitions.
[2025-03-03 09:51:36,726 INFO  L78                 Accepts]: Start accepts. Automaton has 305069 states and 333285 transitions. Word has length 287
[2025-03-03 09:51:36,726 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 09:51:36,726 INFO  L471      AbstractCegarLoop]: Abstraction has 305069 states and 333285 transitions.
[2025-03-03 09:51:36,726 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 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 09:51:36,726 INFO  L276                IsEmpty]: Start isEmpty. Operand 305069 states and 333285 transitions.
[2025-03-03 09:51:36,797 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 290
[2025-03-03 09:51:36,797 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 09:51:36,797 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 09:51:36,803 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-03-03 09:51:36,997 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 09:51:36,998 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 09:51:36,998 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 09:51:36,998 INFO  L85        PathProgramCache]: Analyzing trace with hash -1605905465, now seen corresponding path program 1 times
[2025-03-03 09:51:36,998 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 09:51:36,998 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028810122]
[2025-03-03 09:51:36,998 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 09:51:36,998 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 09:51:37,040 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes.
[2025-03-03 09:51:37,053 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements.
[2025-03-03 09:51:37,053 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 09:51:37,053 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 09:51:37,313 INFO  L134       CoverageAnalysis]: Checked inductivity of 102 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-03 09:51:37,313 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 09:51:37,313 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028810122]
[2025-03-03 09:51:37,313 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028810122] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 09:51:37,313 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 09:51:37,313 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-03 09:51:37,313 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149719028]
[2025-03-03 09:51:37,313 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 09:51:37,314 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-03 09:51:37,314 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 09:51:37,314 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-03 09:51:37,314 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-03-03 09:51:37,314 INFO  L87              Difference]: Start difference. First operand 305069 states and 333285 transitions. Second operand  has 4 states, 4 states have (on average 72.25) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 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 09:51:39,909 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 09:51:39,910 INFO  L93              Difference]: Finished difference Result 634411 states and 694599 transitions.
[2025-03-03 09:51:39,910 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-03 09:51:39,910 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 72.25) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 289
[2025-03-03 09:51:39,910 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 09:51:40,385 INFO  L225             Difference]: With dead ends: 634411
[2025-03-03 09:51:40,386 INFO  L226             Difference]: Without dead ends: 329344
[2025-03-03 09:51:40,540 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 09:51:40,540 INFO  L435           NwaCegarLoop]: 66 mSDtfsCounter, 344 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-03 09:51:40,541 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 96 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-03 09:51:40,808 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 329344 states.